The Epistemology of Computer-Mediated Proofs

DOI10.1007/978-3-319-93779-3_8zbMath1451.68311OpenAlexW2898388323MaRDI QIDQ4972861

Selmer Bringsjord, Naveen Sundar Govindarajulu

Publication date: 27 November 2019

Published in: Philosophy of Engineering and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-93779-3_8

Mathematics Subject Classification ID

Philosophy of mathematics (00A30) Mechanization of proofs and logical operations (03B35) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15) Computer assisted proofs of proofs-by-exhaustion type (68V05)

Cites Work

• Derivation of a parsing algorithm in Martin-Löf's theory of types
• The modal argument for hypercomputing minds
• Automated natural deduction in THINKER
• Modular elliptic curves and Fermat's Last Theorem
• A Vindication of Program Verification
• Proof-Theoretic Semantics for a Natural Language Fragment
• Infinite time Turing machines
• Transfinite Progressions: A Second Look at Completeness
• Interlude: About the First Theorem
• The Legacy of a Great Researcher
• Small Steps toward Hypercomputation via Infinitary Machine Proof Verification and Proof Generation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Epistemology of Computer-Mediated Proofs