Induction the Hard Way

DOI10.2307/2589710MaRDI QIDQ4222474zbMATH OpenOpenAlexFDO

Authors Michael Sheard

Publication date 7 December 1998

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

zbMATH Keywords

boundsinduction principlelength of proofs

Mathematics Subject Classification ID

Complexity of proofs (03F20) First-order arithmetic and fragments (03F30) Measures of information, entropy (94A17)

Review text

This paper explains why logicians are interested in \textit{short} ``logical proofs of instances of the induction principle. A ``good bound is extracted from known arguments. (The list of names given is incomplete.).

Recommendations

• Induction rules in bounded arithmetic
• scientific article; zbMATH DE number 1163362
• scientific article; zbMATH DE number 1841838
• Some observations on the logical foundations of inductive theorem proving
• Explanation by induction?

Cited in

(1)

• Strict finitism, feasibility, and the sorites

This page was built for publication: Induction the Hard Way

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