Pages that link to "Item:Q1263584"
From MaRDI portal
The following pages link to The complexity of Gentzen systems for propositional logic (Q1263584):
Displaying 13 items.
- Tractability of cut-free Gentzen type propositional calculus with permutation inference (Q672046) (← links)
- Two party immediate response disputes: Properties and efficiency (Q814510) (← links)
- Argumentation in artificial intelligence (Q1028943) (← links)
- The intractability of resolution (Q1071750) (← links)
- Seventy-five problems for testing automatic theorem provers (Q1101242) (← links)
- An answer to an open problem of Urquhart (Q1129262) (← links)
- A proper hierarchy of propositional sequent calculi (Q1350509) (← links)
- The relative complexity of resolution and cut-free Gentzen systems (Q1353988) (← links)
- Reduction of Hilbert-type proof systems to the if-then-else equational logic (Q1428985) (← links)
- A Measure of Logical Inference and Its Game Theoretical Applications (Q3094002) (← links)
- Regular Resolution Versus Unrestricted Resolution (Q3137703) (← links)
- Simulation of Natural Deduction and Gentzen Sequent Calculus (Q4683217) (← links)
- A Logical Autobiography (Q5027230) (← links)
