Essential structure of proofs as a measure of complexity
From MaRDI portal
Publication:2183713
DOI10.1007/s11787-020-00251-4zbMath1457.03071OpenAlexW3015754167WikidataQ113899854 ScholiaQ113899854MaRDI QIDQ2183713
Jaime Ramos, João Rasga, Cristina Sernadas
Publication date: 27 May 2020
Published in: Logica Universalis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11787-020-00251-4
Classical first-order logic (03B10) Proof theory in general (including proof-theoretic semantics) (03F03) Abstract deductive systems (03B22) Complexity of proofs (03F20)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proof complexity of intuitionistic implicational formulas
- The number of proof lines and the size of proofs in first order logic
- On the number of steps in proofs
- On the idea of a general proof theory
- Normal proofs, cut free derivations and structural rules
- Combinatorial foundations of information theory and the calculus of probabilities
- Kolmogorov and mathematical logic
- Hilbert's Twenty-Fourth Problem
- Modulated fibring and the collapsing problem
- Some Results on the Length of Proofs
- PRESERVATION OF ADMISSIBLE RULES WHEN COMBINING LOGICS
This page was built for publication: Essential structure of proofs as a measure of complexity