Persistent queues — false conclusion
Lax755887.PersistentQueueClaim · concepts/Lax755887/PersistentQueueClaim.lean · lax-755887
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
This deliberately false application claim is derived only from the unchecked contract. A checked conditional derivation must not mark this statement proven.
Concept map
Evidence
Each proof establishes this claim relative to its assumptions.
Lean source view on GitHub
| 1 | import Lax755887.PersistentQueue |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Persistent queues — false conclusion |
| 6 | type: theorem |
| 7 | --- |
| 8 | This deliberately false application claim is derived only from the unchecked contract. A checked conditional derivation must not mark this statement proven. |
| 9 | -/ |
| 10 | |
| 11 | namespace Lax755887.PersistentQueueClaim |
| 12 | |
| 13 | open Lax755887.PersistentQueue |
| 14 | |
| 15 | axiom repeated_dequeue_linear : |
| 16 | ∃ C : ℕ, ∀ n, totalWork (List.replicate (n + 1) (dequeue n)) ≤ C * (n + 1) |
| 17 | |
| 18 | end Lax755887.PersistentQueueClaim |
| 19 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments