Some results on measure independent Gödel speed-ups

DOI10.2307/2273506zbMath0398.03027OpenAlexW2032008860MaRDI QIDQ4182725

Martin Kenneth Solomon

Publication date: 1978

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

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

zbMATH Keywords

Computational ComplexityProof ComplexitySpeed-Ups

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity of proofs (03F20)

Related Items (1)

Measure independent Gödel speed‐ups and the relative difficulty of recognizing sets

Cites Work

• Unnamed Item
• Unnamed Item
• 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: Some results on measure independent Gödel speed-ups