Partizan Games in Isabelle/HOLZF
From MaRDI portal
Publication:3525155
DOI10.1007/11921240_19zbMath1168.68543OpenAlexW1485040255MaRDI QIDQ3525155
Publication date: 11 September 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11921240_19
Related Items
Generating custom set theories with non-set structured objects, Reconsidering pairs and functions as sets, Formalization of Forcing in Isabelle/ZF, ProofScript: Proof Scripting for the Masses, The formal verification of the ctm approach to forcing, Wetzel: formalisation of an undecidable problem linked to the continuum hypothesis, Combining higher-order logic with set theory formalizations, An Axiomatic Value Model for Isabelle/UTP, Imperative Functional Programming with Isabelle/HOL, Higher-Order Tarski Grothendieck as a Foundation for Formal Proof., Semantics of Mizar as an Isabelle object logic, First steps towards a formalization of forcing
Uses Software
