Don't eliminate cut

DOI10.1007/BF00247711zbMath0564.03005MaRDI QIDQ1057847

George Boolos

Publication date: 1984

Published in: Journal of Philosophical Logic (Search for Journal in Brave)

zbMATH Keywords

cut eliminationnatural deductiontableau methodssemantic tableauxfirst order logicfeasibility of proof proceduresmethod of trees

Mathematics Subject Classification ID

Classical first-order logic (03B10) Cut-elimination and normal-form theorems (03F05)

Related Items

Structure of proofs and the complexity of cut elimination, Antirealism, Meaning and Truth-Conditional Semantics, Simplifying proofs in Fitch-style natural deduction systems, Cut and pay, Algorithmic introduction of quantified cuts, Rasiowa-Sikorski deduction systems with the rule of cut: a case study, Strict finitism and the happy sorites, Non-elementary speed-ups in proof length by different variants of classical analytic calculi, Cut elimination and automatic proof procedures, Hybrid-logical reasoning in the Smarties and Sally-Anne tasks, Cycling in proofs and feasibility, The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem, Bivalent semantics, generalized compositionality and analytic classic-like tableaux for finite-valued logics, Social processes, program verification and all that, Turning cycles into spirals