Pages that link to "Item:Q674415"
From MaRDI portal
The following pages link to Interpolants, cut elimination and flow graphs for the propositional calculus (Q674415):
Displaying 17 items.
- Interpolants, cut elimination and flow graphs for the propositional calculus (Q674415) (← links)
- A new mapping between combinatorial proofs and sequent calculus proofs read out from logical flow graphs (Q964500) (← links)
- Describing proofs by short tautologies (Q1023053) (← links)
- Logical structures and genus of proofs (Q1035649) (← links)
- Turning cycles into spirals (Q1295442) (← links)
- Streams and strings in formal proofs. (Q1853510) (← links)
- Craig interpolation in the presence of unreliable connectives (Q2254572) (← links)
- Partition-based logical reasoning for first-order and propositional theories (Q2457688) (← links)
- Models of deduction (Q2500815) (← links)
- Computing interpolants in implicational logics (Q2503400) (← links)
- Simulating non-prenex cuts in quantified propositional calculus (Q3096088) (← links)
- Making proofs without Modus Ponens: An introduction to the combinatorics and complexity of cut elimination (Q4337947) (← links)
- (Q4503949) (← links)
- The cost of a cycle is a square (Q4532599) (← links)
- Identity of Proofs Based on Normalization and Generality (Q4650310) (← links)
- Cycling in proofs and feasibility (Q4942870) (← links)
- Asymptotic cyclic expansion and bridge groups of formal proofs (Q5945614) (← links)