Pages that link to "Item:Q4707766"
From MaRDI portal
The following pages link to A `theory' mechanism for a proof-verifier based on first-order set theory (Q4707766):
Displaying 12 items.
- The automation of syllogistic. I: Syllogistic normal forms (Q1111540) (← links)
- Automated deduction in von Neumann-Bernays-Gödel set theory (Q1187858) (← links)
- SET-VAR (Q1319383) (← links)
- Formative processes with applications to the decision problem in set theory. II. Powerset and singleton operators, finiteness predicate (Q2252530) (← links)
- Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets (Q2352482) (← links)
- Decision algorithms for fragments of real analysis. I: Continuous functions with strict convexity and concavity predicates (Q2457362) (← links)
- Banishing Ultrafilters from Our Consciousness (Q3305324) (← links)
- NATURAL FORMALIZATION: DERIVING THE CANTOR-BERNSTEIN THEOREM IN ZF (Q5001547) (← links)
- Computational Logic and Set Theory (Q5198513) (← links)
- Using First-Order Theorem Provers in the Jahob Data Structure Verification System (Q5452598) (← links)
- Theorem Proving in Higher Order Logics (Q5477663) (← links)
- An Automation-Friendly Set Theory for the B Method (Q5881455) (← links)