Proof theory
From MaRDI portal
Recommendations
Cited in
(26)- Counting proofs in propositional logic
- Gentzen systems, resolution, and literal trees
- Unsolvable systems of equations and proof complexity
- Propositional consistency proofs
- Proof theory and ordinal analysis
- On proof normal forms for some systems of classical propositional logic
- The properties of determinative disjunctive normal forms and systems based on them
- Propositional proofs in Frege and extended Frege systems (abstract)
- scientific article; zbMATH DE number 3870638 (Why is no real title available?)
- scientific article; zbMATH DE number 5150882 (Why is no real title available?)
- Logical Closure Properties of Propositional Proof Systems
- scientific article; zbMATH DE number 3922641 (Why is no real title available?)
- scientific article; zbMATH DE number 65760 (Why is no real title available?)
- scientific article; zbMATH DE number 1215500 (Why is no real title available?)
- Making proofs without Modus Ponens: An introduction to the combinatorics and complexity of cut elimination
- scientific article; zbMATH DE number 941039 (Why is no real title available?)
- An exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle
- scientific article; zbMATH DE number 1390276 (Why is no real title available?)
- A Logical Autobiography
- Usablity of some theorem proving systems
- scientific article; zbMATH DE number 5070526 (Why is no real title available?)
- scientific article; zbMATH DE number 3313427 (Why is no real title available?)
- The Complexity of Propositional Proofs with the Substitution Rule
- PROOF COMPLEXITIES ON A CLASS OF BALANCED FORMULAS IN SOME PROPOSITIONAL SYSTEMS
- Formalized proof systems for propositional logic
- Tractability of cut-free Gentzen type propositional calculus with permutation inference
This page was built for publication: Proof theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3081620)
