| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 13430468 | Electronic Notes in Theoretical Computer Science | 2019 | 18 Pages |
Abstract
Given a transitive set M, we define its generic extension M[G], the canonical names for elements of M, and finally show that if M satisfies the axiom of pairing, then M[G] also does. We also prove that M[G] is transitive.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Emmanuel Gunther, Miguel Pagano, Pedro Sánchez Terraf,