This volume announces a new era in the philosophy of God. Many of its contributions work to create stronger links between the philosophy of God, on the one hand, and mathematics or metamathematics, on the other hand. It is about not only the possibilities of applying mathematics or metamathematics to questions about God, but also the reverse question: Does the philosophy of God have anything to offer mathematics or metamathematics? The remaining contributions tackle stereotypes in the philosophy of religion. The (...) volume includes 35 contributions. It is divided into nine parts: 1. Who Created the Concept of God; 2. Omniscience, Omnipotence, Timelessness and Spacelessness of God; 3. God and Perfect Goodness, Perfect Beauty, Perfect Freedom; 4. God, Fundamentality and Creation of All Else; 5. Simplicity and Ineffability of God; 6. God, Necessity and Abstract Objects; 7. God, Infinity, and Pascal's Wager; 8. God and (Meta-)Mathematics; and 9. God and Mind. (shrink)

We introduce the resurrection axioms, a new class of forcing axioms, and the uplifting cardinals, a new large cardinal notion, and prove that various instances of the resurrection axioms are equiconsistent over ZFC with the existence of an uplifting cardinal.

The main theorem of this article is that every countable model of set theory 〈M, ∈M〉, including every well-founded model, is isomorphic to a submodel of its own constructible universe 〈LM, ∈M〉 by means of an embedding j : M → LM. It follows from the proof that the countable models of set theory are linearly pre-ordered by embeddability: if 〈M, ∈M〉 and 〈N, ∈N〉 are countable models of set theory, then either M is isomorphic to a submodel of N (...) or conversely. Indeed, these models are pre-well-ordered by embeddability in order-type exactly ω1+ 1. Specifically, the countable well-founded models are ordered under embeddability exactly in accordance with the heights of their ordinals; every shorter model embeds into every taller model; every model of set theory M is universal for all countable well-founded binary relations of rank at most OrdM; and every ill-founded model of set theory is universal for all countable acyclic binary relations. Finally, strengthening a classical theorem of Ressayre, the proof method shows that if M is any nonstandard model of PA, then every countable model of set theory — in particular, every model of ZFC plus large cardinals — is isomorphic to a submodel of the hereditarily finite sets 〈 HFM, ∈M〉 of M. Indeed, 〈 HFM, ∈M〉 is universal for all countable acyclic binary relations. (shrink)

This paper explores several topics related to Woodin’s HOD conjecture. We improve the large cardinal hypothesis of Woodin’s HOD dichotomy theorem from an extendible cardinal to a strongly compact cardinal. We show that assuming there is a strongly compact cardinal and the HOD hypothesis holds, there is no elementary embedding from HOD to HOD, settling a question of Woodin. We show that the HOD hypothesis is equivalent to a uniqueness property of elementary embeddings of levels of the cumulative hierarchy. We (...) prove that the HOD hypothesis holds if and only if every regular cardinal above the first strongly compact cardinal carries an ordinal definable [Formula: see text]-Jónsson algebra. We show that if the HOD hypothesis holds and HOD satisfies the Ultrapower Axiom, then every supercompact cardinal is supercompact in HOD. (shrink)

In this paper, we prove that: if κ is supercompact and the math formula Hypothesis holds, then there is a proper class of regular cardinals in math formula which are measurable in math formula. Woodin also proved this result independently [11]. As a corollary, we prove Woodin's Local Universality Theorem. This work shows that under the assumption of the math formula Hypothesis and supercompact cardinals, large cardinals in math formula are reflected to be large cardinals in math formula in a (...) local way, and reveals the huge difference between math formula-supercompact cardinals and supercompact cardinals under the math formula Hypothesis. (shrink)

We introduce the notion of ${\cal C}$-system of filters, generalizing the standard definitions of both extenders and towers of normal ideals. This provides a framework to develop the theory of extenders and towers in a more general and concise way. In this framework we investigate the topic of definability of generic large cardinals properties.