Zachiri McKenzie

dblp:159/6763 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
2since 2021 · last 2022
0000-0003-0807-9561ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3 · 2 first-author · 2 since 2021
YearPublicationVenuePosition
2022 End extending models of set theory via power admissible covers
abstract
Motivated by problems involving end extensions of models of set theory, we develop the rudiments of the power admissible cover construction (over ill-founded models of set theory), an extension of the machinery of admissible covers invented by Barwise as a versatile tool for generalising model-theoretic results about countable well-founded models of set theory to countable ill-founded ones. Our development of the power admissible machinery allows us to obtain new results concerning powerset-preserving end extensions and rank extensions of countable models of subsystems of ZFC. The canonical extension KPP of Kripke-Platek set theory KP plays a key role in our work; one of our results refines a theorem of Rathjen by showing that Σ1P-Foundation is provable in KPP (without invoking the axiom of choice).
Zachiri McKenzie, Ali Enayat
Ann. Pure Appl. Log.1
2021 Initial Self-Embeddings of Models of Set Theory
abstract
Abstract By a classical theorem of Harvey Friedman (1973), every countable nonstandard model $\mathcal {M}$ of a sufficiently strong fragment of ZF has a proper rank-initial self-embedding j, i.e., j is a self-embedding of $\mathcal {M}$ such that $j[\mathcal {M}]\subsetneq \mathcal {M}$ , and the ordinal rank of each member of $j[\mathcal {M}]$ is less than the ordinal rank of each element of $\mathcal {M}\setminus j[\mathcal {M}]$ . Here, we investigate the larger family of proper initial-embeddings j of models $\mathcal {M}$ of fragments of set theory, where the image of j is a transitive submodel of $\mathcal {M}$ . Our results include the following three theorems. In what follows, $\mathrm {ZF}^-$ is $\mathrm {ZF}$ without the power set axiom; $\mathrm {WO}$ is the axiom stating that every set can be well-ordered; $\mathrm {WF}(\mathcal {M})$ is the well-founded part of $\mathcal {M}$ ; and $\Pi ^1_\infty \text{-}\mathrm {DC}_\alpha $ is the full scheme of dependent choice of length $\alpha $ . Theorem A. There is an $\omega $ -standard countable nonstandard model $\mathcal {M}$ of $\mathrm {ZF}^-+\mathrm {WO}$ that carries no initial self-embedding $j:\mathcal {M} \longrightarrow \mathcal {M}$ other than the identity embedding. Theorem B. Every countable $\omega $ -nonstandard model $\mathcal {M}$ of $\ \mathrm {ZF}$ is isomorphic to a transitive submodel of the hereditarily countable sets of its own constructible universe $L^{\mathcal {M}}$ . Theorem C. The following three conditions are equivalent for a countable nonstandard model $\mathcal {M}$ of $\mathrm {ZF}^{-}+\mathrm {WO}+\forall \alpha \ \Pi ^1_\infty \text{-}\mathrm {DC}_\alpha $ . (I) There is a cardinal in $\mathcal {M}$ that is a strict upper bound for the cardinality of each member of $\mathrm {WF}(\mathcal {M})$ . (II) $\mathrm {WF}(\mathcal {M})$ satisfies the powerset axiom. (III) For all $n \in \omega $ and for all $b \in M$ , there exists a proper initial self-embedding $j: \mathcal {M} \longrightarrow \mathcal {M}$ </
Ali Enayat, Zachiri McKenzie
J. Symb. Log.2
2015 Automorphisms of models of set theory and extensions of NFU
Zachiri McKenzie
Ann. Pure Appl. Log.1