The following pages link to Partizan Games in Isabelle/HOLZF (Q3525155):
Displaying 12 items.
- Reconsidering pairs and functions as sets (Q286796) (← links)
- Generating custom set theories with non-set structured objects (Q2128829) (← links)
- Semantics of Mizar as an Isabelle object logic (Q2323445) (← links)
- First steps towards a formalization of forcing (Q2333671) (← links)
- An Axiomatic Value Model for Isabelle/UTP (Q2971180) (← links)
- ProofScript: Proof Scripting for the Masses (Q3179409) (← links)
- Imperative Functional Programming with Isabelle/HOL (Q3543655) (← links)
- Formalization of Forcing in Isabelle/ZF (Q5049004) (← links)
- Higher-Order Tarski Grothendieck as a Foundation for Formal Proof. (Q5875415) (← links)
- The formal verification of the ctm approach to forcing (Q6151819) (← links)
- Combining higher-order logic with set theory formalizations (Q6161232) (← links)
- Conway numbers -- formal introduction (Q6557120) (← links)