Pages that link to "Item:Q2457343"
From MaRDI portal
The following pages link to An automated prover for Zermelo-Fraenkel set theory in Theorema (Q2457343):
Displaying 9 items.
- Set theory in first-order logic: Clauses for Gödel's axioms (Q1097252) (← links)
- Automated deduction in von Neumann-Bernays-Gödel set theory (Q1187858) (← links)
- \({\mathcal Z}\)-match: An inference rule for incrementally elaborating set instantiations (Q1319387) (← links)
- Computer proofs about finite and regular sets: The unifying concept of subvariance. (Q1404990) (← links)
- A new refinement type system for automated \(\nu\text{HFL}_\mathbb{Z}\) validity checking (Q2038070) (← links)
- (Q4503899) (← links)
- A `theory' mechanism for a proof-verifier based on first-order set theory (Q4707766) (← links)
- NATURAL FORMALIZATION: DERIVING THE CANTOR-BERNSTEIN THEOREM IN ZF (Q5001547) (← links)
- Using Theorema in the Formalization of Theoretical Economics (Q5200108) (← links)
