Sets of theorems with short proofs

DOI10.2307/2272636MaRDI QIDQ4041554zbMATH OpenOpenAlexFDO

Authors Daniel C. Richardson

Publication date 1974

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

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

Mathematics Subject Classification ID

Classical first-order logic (03B10) Decidability of theories and sets of sentences (03B25) Proof theory and constructive mathematics (03F99)

Cited in

(11)

• The undecidability of k-provability
• Bounded arithmetic, proof complexity and two papers of Parikh
• The Kreisel length-of-proof problem
• A unification-theoretic method for investigating the \(k\)-provability problem
• Generalizing theorems in real closed fields
• Herbrand's theorem and term induction
• Taking out LK parts from a proof in Peano arithmetic
• Some Results on the Length of Proofs
• Remark on Kreisel's conjecture
• The lengths of proofs: Kreisel's conjecture and Gödel's speed-up theorem
• Generalizing proofs in monadic languages (with a postscript by Georg Kreisel).

This page was built for publication: Sets of theorems with short proofs

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