Abbreviating proofs by adding new axioms

DOI10.1090/S0002-9904-1971-12696-4zbMath0216.01002OpenAlexW1973037977WikidataQ114633764 ScholiaQ114633764MaRDI QIDQ5619080

Andrzej Ehrenfeucht, Jan Mycielski

Publication date: 1971

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9904-1971-12696-4

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Proof theory in general (including proof-theoretic semantics) (03F03)

Related Items

Dynamical system where proving chaos is equivalent to proving Fermat's conjecture, The lengths of proofs: Kreisel's conjecture and Gödel's speed-up theorem, On the number of steps in proofs, Two recursion theoretic characterizations of proof speed-ups, A theorem on shortening the length of proof in formal systems of arithmetic, Undecidability and incompleteness in classical mechanics, INCOMPLETENESS IN THE FINITE DOMAIN, Von Neumann, Gödel and Complexity Theory, Some results on measure independent Gödel speed-ups, A unification-theoretic method for investigating the \(k\)-provability problem, Truth and the philosophy of mathematics, New formally undecidable propositions: Non-trivial lower bounds on proof complexity and related theorems