The following pages link to Don't eliminate cut (Q1057847):
Displaying 15 items.
- Algorithmic introduction of quantified cuts (Q402115) (← links)
- Strict finitism and the happy sorites (Q427227) (← links)
- Bivalent semantics, generalized compositionality and analytic classic-like tableaux for finite-valued logics (Q744990) (← links)
- Simplifying proofs in Fitch-style natural deduction systems (Q851139) (← links)
- Cut and pay (Q851192) (← links)
- Cut elimination and automatic proof procedures (Q1183598) (← links)
- Turning cycles into spirals (Q1295442) (← links)
- Hybrid-logical reasoning in the Smarties and Sally-Anne tasks (Q2258816) (← links)
- Structure of proofs and the complexity of cut elimination (Q2368983) (← links)
- Rasiowa-Sikorski deduction systems with the rule of cut: a case study (Q2422312) (← links)
- Antirealism, Meaning and Truth-Conditional Semantics (Q2908760) (← links)
- Social processes, program verification and all that (Q3643359) (← links)
- Non-elementary speed-ups in proof length by different variants of classical analytic calculi (Q4610324) (← links)
- Cycling in proofs and feasibility (Q4942870) (← links)
- The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem (Q5204803) (← links)
