Pages that link to "Item:Q5477659"

The following pages link to Theorem Proving in Higher Order Logics (Q5477659):

Displaying 7 items.

• A mechanised proof of Gödel's incompleteness theorems using Nominal Isabelle (Q286772) (← links)
• Distilling the requirements of Gödel's incompleteness theorems with a proof assistant (Q2051568) (← links)
• A formally verified abstract account of Gödel's incompleteness theorems (Q2305432) (← links)
• Mechanised Computability Theory (Q3088013) (← links)
• Quantitative continuity and Computable Analysis in Coq (Q5875440) (← links)
• Formalizing Bachmair and Ganzinger's ordered resolution prover (Q5919011) (← links)
• Synthetic undecidability and incompleteness of first-order axiom systems in Coq. Extended version (Q6156642) (← links)