arXiv Analytics

Sign in

arXiv:1901.03313 [cs.LO]AbstractReferencesReviewsResources

Mechanization of Separation in Generic Extensions

Emmanuel Gunther, Miguel Pagano, Pedro Sánchez Terraf

Published 2019-01-10Version 1

We mechanize, in the proof assistant Isabelle, a proof of the axiom-scheme of Separation in generic extensions of models of set theory by using the fundamental theorems of forcing. We also formalize the satisfaction of the axioms of Extensionality, Foundation, Union, and Powerset. The axiom of Infinity is likewise treated, under additional assumptions on the ground model. In order to achieve these goals, we extended Paulson's library on constructibility with renaming of variables for internalized formulas, improved results on definitions by recursion on well-founded relations, and sharpened hypotheses in his development of relativization and absoluteness.

Comments: 23 pages, 1 figure
Categories: cs.LO, math.LO
Subjects: 03B35, 03E40, 03B70, 68T15, F.4.1
Related articles: Most relevant | Search more
arXiv:cs/9612104 [cs.LO] (Published 2001-03-29)
Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of Choice.
arXiv:1106.1242 [cs.LO] (Published 2011-06-07)
Separation of Test-Free Propositional Dynamic Logics over Context-Free Languages
arXiv:1202.2296 [cs.LO] (Published 2012-02-10, updated 2012-05-22)
An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning