4 citations · 11 across the 7 of their papers we have counts for
11 papers
Chain Bounding, the leanest proof of Zorn's lemma, and an illustration of computerized proof formalization
Guillermo L. Incatasciato, Pedro Sánchez Terraf
We present an exposition of the *Chain Bounding Lemma*, which is a common generalization of both Zorn's Lemma and the Bourbaki-Witt fixed point theorem. The proofs of these results…
Formalization of Forcing in Isabelle/ZF
Emmanuel Gunther, Miguel Pagano, Pedro Sánchez Terraf
We formalize the theory of forcing in the set theory framework of Isabelle/ZF. Under the assumption of the existence of a countable transitive model of ZFC, we construct a proper g…
Mechanization of Separation in Generic Extensions
Emmanuel Gunther, Miguel Pagano, Pedro Sánchez Terraf
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.…
First steps towards a formalization of Forcing
Emmanuel Gunther, Miguel Pagano, Pedro Sánchez Terraf
We lay the ground for an Isabelle/ZF formalization of Cohen's technique of forcing. We formalize the definition of forcing notions as preorders with top, dense subsets, and generic…
Semipullbacks of labelled Markov processes
Jan Pachl, Pedro Sánchez Terraf
A labelled Markov process (LMP) consists of a measurable space together with an indexed family of Markov kernels from to itself. This structure has been used to model proba…
The Lattice of Congruences of a Finite Line Frame
Carlos Areces, Miguel Campercholi, Daniel Penazzi +1
Let be a finite Kripke frame. A congruence of is a bisimulation of that is also an equivalence relation on F.…