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

DOI10.2307/2272163zbMATH Open0316.02046OpenAlexW2051561433MaRDI QIDQ4075449FDOQ4075449

Authors: 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) Recursively (computably) enumerable sets and degrees (03D25) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Recursive functions and relations, subrecursive hierarchies (03D20)

Cites Work

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

Cited In (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

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

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