Pages that link to "Item:Q2940885"

The following pages link to A MACHINE-ASSISTED PROOF OF GÖDEL’S INCOMPLETENESS THEOREMS FOR THE THEORY OF HEREDITARILY FINITE SETS (Q2940885):

Displaying 11 items.

• A mechanised proof of Gödel's incompleteness theorems using Nominal Isabelle (Q286772) (← links)
• Formalization of the resolution calculus for first-order logic (Q1663242) (← links)
• Distilling the requirements of Gödel's incompleteness theorems with a proof assistant (Q2051568) (← links)
• The scope of Gödel's first incompleteness theorem (Q2254575) (← links)
• A formally verified abstract account of Gödel's incompleteness theorems (Q2305432) (← links)
• Formalising mathematics -- in praxis; a mathematician's first experiences with Isabelle/HOL and the why and how of getting started (Q2657827) (← links)
• Tactics for mechanized reasoning: a commentary on Milner (1984) ‘The use of machines to assist in rigorous proof’ (Q2955752) (← links)
• Computational logic: its origins and applications (Q4559535) (← links)
• NATURAL FORMALIZATION: DERIVING THE CANTOR-BERNSTEIN THEOREM IN ZF (Q5001547) (← links)
• Formalizing Bachmair and Ganzinger's ordered resolution prover (Q5919011) (← links)
• Undecidable problems in quantum field theory (Q6049665) (← links)