The following pages link to Joel David Hamkins (Q167886):
Displaying 50 items.
- Canonical seeds and Prikry trees (Q4358046) (← links)
- Small forcing makes any cardinal superdestructible (Q4391421) (← links)
- Pf ≠ NPf for almost all f (Q4434508) (← links)
- Small forcing creates neither strong nor Woodin cardinals (Q4501093) (← links)
- Infinite time Turing machines (Q4508248) (← links)
- ZFC PROVES THAT THE CLASS OF ORDINALS IS NOT WEAKLY COMPACT FOR DEFINABLE CLASSES (Q4638982) (← links)
- (Q4781760) (← links)
- (Q4805392) (← links)
- Extensions with the approximation and cover properties have no new large cardinals (Q4811323) (← links)
- The Hierarchy of Equivalence Relations on the Natural Numbers Under Computable Reducibility (Q4904456) (← links)
- Pointwise definable models of set theory (Q4916549) (← links)
- (Q4951682) (← links)
- Set-theoretic mereology (Q4978521) (← links)
- The foundation axiom and elementary self-embeddings of the universe (Q4982449) (← links)
- Topological models of arithmetic (Q5029029) (← links)
- Transfinite game values in infinite draughts (Q5057070) (← links)
- THE MODAL LOGIC OF SET-THEORETIC POTENTIALISM AND THE POTENTIALIST MAXIMALITY PRINCIPLES (Q5065132) (← links)
- THE Σ<sub>1</sub>-DEFINABLE UNIVERSAL FINITE SEQUENCE (Q5082064) (← links)
- (Q5107104) (← links)
- Incomparable ω<sub>1</sub>‐like models of set theory (Q5108089) (← links)
- When does every definable nonempty set have a definable element? (Q5108871) (← links)
- Representing Ordinal Numbers with Arithmetically Interesting Sets of Real Numbers (Q5109419) (← links)
- BI-INTERPRETATION IN WEAK SET THEORIES (Q5159491) (← links)
- Kelley–Morse set theory does not prove the class Fodor principle (Q5162572) (← links)
- A MULTIVERSE PERSPECTIVE ON THE AXIOM OF CONSTRUCTIBILITY (Q5178528) (← links)
- The rearrangement number (Q5206253) (← links)
- THE IMPLICITLY CONSTRUCTIBLE UNIVERSE (Q5207559) (← links)
- The subseries number (Q5226519) (← links)
- Open determinacy for class games (Q5351852) (← links)
- (Q5384986) (← links)
- EVERY COUNTABLE MODEL OF SET THEORY EMBEDS INTO ITS OWN CONSTRUCTIBLE UNIVERSE (Q5401599) (← links)
- Post’s Problem for Ordinal Register Machines (Q5425337) (← links)
- The Complexity of Quickly ORM-Decidable Sets (Q5425351) (← links)
- The modal logic of forcing (Q5437615) (← links)
- Transfinite game values in infinite chess (Q5495452) (← links)
- Tall cardinals (Q5505142) (← links)
- The Necessary Maximality Principle for c. c. c. forcing is equiconsistent with a weakly compact cardinal (Q5693598) (← links)
- New Computational Paradigms (Q5717037) (← links)
- THE EXACT STRENGTH OF THE CLASS FORCING THEOREM (Q5855740) (← links)
- (Q5856638) (← links)
- (Q5857677) (← links)
- The wholeness axioms and V=HOD (Q5928307) (← links)
- Gap forcing (Q5951514) (← links)
- Superstrong and other large cardinals are never Laver indestructible (Q5964928) (← links)
- Choiceless large cardinals and set‐theoretic potentialism (Q6094163) (← links)
- Infinite Wordle and the mastermind numbers (Q6140749) (← links)
- The Rearrangement Number (Q6281182) (← links)
- A model of the generic Vop\v{e}nka principle in which the ordinals are not Mahlo (Q6287432) (← links)
- Kelley-Morse set theory does not prove the class Fodor principle (Q6316902) (← links)
- The Sigma_1-definable universal finite sequence (Q6325637) (← links)
