Two recursion theoretic characterizations of proof speed-ups

DOI10.2307/2274866zbMath0702.03034OpenAlexW2085522220MaRDI QIDQ3480036

James S. Royer

Publication date: 1989

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

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

zbMATH Keywords

complexity measures for proofsEffective speedabilityproof speed-uprecursively enumerable inseparability of sets

Mathematics Subject Classification ID

Complexity of proofs (03F20)

Cites Work

• On Goedel speed-up and succinctness of language representations
• Sentences undecidable in formalized arithmetic. An exposition of the theory of Kurt Gödel
• A theorem on shortening the length of proof in formal systems of arithmetic
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Abbreviating proofs by adding new axioms

This page was built for publication: Two recursion theoretic characterizations of proof speed-ups