Interpolants, cut elimination and flow graphs for the propositional calculus
From MaRDI portal
Publication:674415
DOI10.1016/S0168-0072(96)00019-XzbMath0873.03050OpenAlexW2158086914MaRDI QIDQ674415
Publication date: 26 October 1997
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0168-0072(96)00019-x
interpolationcut eliminationsequent calculuslogical flow graphspropositional calculussize of interpolants
Cut-elimination and normal-form theorems (03F05) Structure of proofs (03F07) Complexity of proofs (03F20)
Related Items
The cost of a cycle is a square, Combinatorial flows as bicolored atomic flows, Partition-based logical reasoning for first-order and propositional theories, Interpolants, cut elimination and flow graphs for the propositional calculus, Identity of Proofs Based on Normalization and Generality, Craig interpolation in the presence of unreliable connectives, A new mapping between combinatorial proofs and sequent calculus proofs read out from logical flow graphs, Asymptotic cyclic expansion and bridge groups of formal proofs, Models of deduction, Cycling in proofs and feasibility, Computing interpolants in implicational logics, Describing proofs by short tautologies, Logical structures and genus of proofs, Turning cycles into spirals, Streams and strings in formal proofs.
Cites Work
- Linear logic
- Interpolants, cut elimination and flow graphs for the propositional calculus
- The number of proof lines and the size of proofs in first order logic
- The undecidability of \(k\)-provability
- A unification-theoretic method for investigating the \(k\)-provability problem
- Complexity of the realization of a linear function in the class of \(\Pi\)-circuits
- The relative efficiency of propositional proof systems
- The Universe of Set Theory
- Some Results on the Length of Proofs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
