Pages that link to "Item:Q1904402"
From MaRDI portal
The following pages link to Set theory for verification. II: Induction and recursion (Q1904402):
Displayed 16 items.
- Ordinal arithmetic: Algorithms and mechanization (Q851144) (← links)
- Structuring metatheory on inductive definitions (Q1854368) (← links)
- First steps towards a formalization of forcing (Q2333671) (← links)
- Automatic Proof and Disproof in Isabelle/HOL (Q3172879) (← links)
- ProofScript: Proof Scripting for the Masses (Q3179409) (← links)
- The Relative Consistency of the Axiom of Choice — Mechanized Using Isabelle/ZF (Q3507465) (← links)
- The Isabelle Framework (Q3543647) (← links)
- Fixpoints and Search in PVS (Q3558967) (← links)
- The Relative Consistency of the Axiom of Choice Mechanized Using Isabelle⁄zf (Q4827615) (← links)
- Layered map reasoning (Q4923516) (← links)
- NATURAL FORMALIZATION: DERIVING THE CANTOR-BERNSTEIN THEOREM IN ZF (Q5001547) (← links)
- A fixedpoint approach to implementing (Co)inductive definitions (Q5210768) (← links)
- Formalization of the fundamental group in untyped set theory using auto2 (Q5915787) (← links)
- Goals and benchmarks for automated map reasoning (Q5927984) (← links)
- A concrete final coalgebra theorem for ZF set theory (Q6061877) (← links)
- The formal verification of the ctm approach to forcing (Q6151819) (← links)