Pages that link to "Item:Q1187858"

The following pages link to Automated deduction in von Neumann-Bernays-Gödel set theory (Q1187858):

Displaying 15 items.

• Set theory in first-order logic: Clauses for Gödel's axioms (Q1097252) (← links)
• Set theory for verification. I: From foundations to functions (Q1319386) (← links)
• Issues in commonsense set theory (Q1346620) (← links)
• Computer proofs about finite and regular sets: The unifying concept of subvariance. (Q1404990) (← links)
• The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0 (Q1694574) (← links)
• Automated search for Gödel's proofs (Q1772785) (← links)
• Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets (Q2352482) (← links)
• An automated prover for Zermelo-Fraenkel set theory in Theorema (Q2457343) (← links)
• The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0 (Q2655326) (← links)
• Hao Wang's contributions to mechanized deduction and to the Entscheidungsproblem (Q2845892) (← links)
• The Relative Consistency of the Axiom of Choice — Mechanized Using Isabelle/ZF (Q3507465) (← links)
• A `theory' mechanism for a proof-verifier based on first-order set theory (Q4707766) (← links)
• Theorem Proving in Large Formal Mathematics as an Emerging AI Field (Q4913871) (← links)
• The TPTP problem library (Q5210777) (← links)
• MBase: Representing knowledge and context for the integration of mathematical software systems (Q5950933) (← links)