Essential structure of proofs as a measure of complexity
From MaRDI portal
Recommendations
Cites work
- Combinatorial foundations of information theory and the calculus of probabilities
- Hilbert's Twenty-Fourth Problem
- scientific article; zbMATH DE number 48365 (Why is no real title available?)
- scientific article; zbMATH DE number 481931 (Why is no real title available?)
- scientific article; zbMATH DE number 1497485 (Why is no real title available?)
- scientific article; zbMATH DE number 3275554 (Why is no real title available?)
- scientific article; zbMATH DE number 3333259 (Why is no real title available?)
- scientific article; zbMATH DE number 2212138 (Why is no real title available?)
- Kolmogorov and mathematical logic
- Modulated fibring and the collapsing problem
- Normal proofs, cut free derivations and structural rules
- On the idea of a general proof theory
- On the number of steps in proofs
- Preservation of admissible rules when combining logics
- Proof complexity of intuitionistic implicational formulas
- Some Results on the Length of Proofs
- Structural proof theory. With an appendix by Aarne Ranta
- The number of proof lines and the size of proofs in first order logic
Cited in
(3)
This page was built for publication: Essential structure of proofs as a measure of complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2183713)