-
56Marginalia on a theorem of WoodinJournal of Symbolic Logic 82 (1): 359-374. 2017.Let$\left\langle {{W_n}:n \in \omega } \right\rangle$be a canonical enumeration of recursively enumerable sets, and supposeTis a recursively enumerable extension of PA (Peano Arithmetic) in the same language. Woodin (2011) showed that there exists an index$e \in \omega$(that depends onT) with the property that if${\cal M}$is a countable model ofTand for some${\cal M}$-finite sets,${\cal M}$satisfies${W_e} \subseteq s$, then${\cal M}$has an end extension${\cal N}$that satisfiesT+We=s.Here we gene…Read more
-
105Conservative extensions of models of set theory and generalizationsJournal of Symbolic Logic 51 (4): 1005-1021. 1986.
-
3Marriott Wardman Park Hotel, Washington, DC January 7–8, 2009Bulletin of Symbolic Logic 15 (2). 2009.
-
216Leibnizian models of set theoryJournal of Symbolic Logic 69 (3): 775-789. 2004.A model is said to be Leibnizian if it has no pair of indiscernibles. Mycielski has shown that there is a first order axiom LM (the Leibniz-Mycielski axiom) such that for any completion T of Zermelo-Fraenkel set theory ZF, T has a Leibnizian model if and only if T proves LM. Here we prove: THEOREM A. Every complete theory T extending ZF + LM has $2^{\aleph_{0}}$ nonisomorphic countable Leibnizian models. THEOREM B. If $\kappa$ is aprescribed definable infinite cardinal of a complete theory T ext…Read more
-
109Fixed points of self-embeddings of models of arithmeticAnnals of Pure and Applied Logic 169 (6): 487-513. 2018.
Gothenburg, Sweden