A Note on Relative Efficiency of Axiom Systems

DOI10.1002/MALQ.19940400211MaRDI QIDQ4304111zbMATH OpenOpenAlexWikidataFDO

Authors Sandra Fontani, Franco Montagna, Andrea Sorbi

Publication date 14 May 1995

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19940400211

zbMATH Keywords

polynomial time computationrelative efficiency of axiom systemsspeed- up of proofs

Mathematics Subject Classification ID

Complexity of proofs (03F20) First-order arithmetic and fragments (03F30)

Recommendations

• Two recursion theoretic characterizations of proof speed-ups
• Relative efficiency of a proof system for classical propositional logic
• On the relative efficiency of different systems for classical and nonclassical propositional logics
• Propositional proof systems, the consistency of first order theories and the complexity of computations
• Polynomially and superexponentially shorter proofs in fragments of arithmetic

Cited in

(2)

• Obituary: Franco Montagna (1948--2015)
• Axiomatizations of the Owen value without efficiency

This page was built for publication: A Note on Relative Efficiency of Axiom Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4304111)