A theorem on shortening the length of proof in formal systems of arithmetic

DOI10.2307/2272163zbMath0316.02046OpenAlexW2051561433MaRDI QIDQ4075449

Robert A. Di Paola

Publication date: 1975

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2272163

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (3)

Two recursion theoretic characterizations of proof speed-ups ⋮ Some results on measure independent Gödel speed-ups ⋮ New formally undecidable propositions: Non-trivial lower bounds on proof complexity and related theorems

Cites Work

• On sets represented by the same formula in distinct consistent axiomatizable Rosser theories
• Abbreviating proofs by adding new axioms

This page was built for publication: A theorem on shortening the length of proof in formal systems of arithmetic