|
+
PDF
Chat
|
How the continuum hypothesis could have been a fundamental axiom
|
2024
|
Joel David Hamkins
|
|
+
PDF
Chat
|
Did Turing prove the undecidability of the halting problem?
|
2024
|
Joel David Hamkins
Theodor Nenu
|
|
+
PDF
Chat
|
Every Countable Model of Arithmetic or Set Theory has a Pointwise-Definable End Extension
|
2024
|
Joel David Hamkins
|
|
+
PDF
Chat
|
Infinite Wordle and the mastermind numbers
|
2023
|
Joel David Hamkins
|
|
+
|
Nonlinearity and Illfoundedness in the Hierarchy of Large Cardinal Consistency Strength
|
2022
|
Joel David Hamkins
|
|
+
PDF
Chat
|
REFLECTION IN SECOND-ORDER SET THEORY WITH ABUNDANT URELEMENTS BI-INTERPRETS A SUPERCOMPACT CARDINAL
|
2022
|
Joel David Hamkins
Bokai Yao
|
|
+
PDF
Chat
|
Choiceless large cardinals and setâtheoretic potentialism
|
2022
|
Raffaella Cutolo
Joel David Hamkins
|
|
+
|
Reflection in second-order set theory with abundant urelements bi-interprets a supercompact cardinal
|
2022
|
Joel David Hamkins
Bokai Yao
|
|
+
|
Infinite Wordle and the Mastermind numbers
|
2022
|
Joel David Hamkins
|
|
+
|
Fregean abstraction in Zermelo-Fraenkel set theory: a deflationary account
|
2022
|
Joel David Hamkins
|
|
+
|
Every countable model of arithmetic or set theory has a pointwise-definable end extension
|
2022
|
Joel David Hamkins
|
|
+
|
Nonlinearity and illfoundedness in the hierarchy of large cardinal consistency strength
|
2022
|
Joel David Hamkins
|
|
+
|
Pseudo-countable models
|
2022
|
Joel David Hamkins
|
|
+
|
Infinite Hex is a draw
|
2022
|
Joel David Hamkins
Davide Leonessi
|
|
+
|
Transfinite game values in infinite draughts.
|
2021
|
Joel David Hamkins
Davide Leonessi
|
|
+
|
Is the twin prime conjecture independent of Peano Arithmetic
|
2021
|
Alessandro Berarducci
Antongiulio Fornasiero
Joel David Hamkins
|
|
+
|
Topological models of arithmetic
|
2021
|
Ali Enayat
Joel David Hamkins
Bartosz WcisĆo
|
|
+
PDF
Chat
|
KelleyâMorse set theory does not prove the class Fodor principle
|
2021
|
Victoria Gitman
Joel David Hamkins
Asaf Karagila
|
|
+
|
Transfinite game values in infinite draughts
|
2021
|
Joel David Hamkins
Davide Leonessi
|
|
+
|
Is the twin prime conjecture independent of Peano Arithmetic?
|
2021
|
Alessandro Berarducci
Antongiulio Fornasiero
Joel David Hamkins
|
|
+
PDF
Chat
|
BI-INTERPRETATION IN WEAK SET THEORIES
|
2020
|
Alfredo Roque Freire
Joel David Hamkins
|
|
+
|
Modal model theory
|
2020
|
Joel David Hamkins
Wojciech Aleksander WoĆoszyn
|
|
+
|
Categorical large cardinals and the tension between categoricity and set-theoretic reflection
|
2020
|
Joel David Hamkins
Hans Robin Solberg
|
|
+
PDF
Chat
|
THE EXACT STRENGTH OF THE CLASS FORCING THEOREM
|
2020
|
Victoria Gitman
Joel David Hamkins
Peter Holy
Philipp Schlicht
Kameryn J. Williams
|
|
+
|
Forcing as a computational process
|
2020
|
Joel David Hamkins
Russell Miller
Kameryn J. Williams
|
|
+
|
Bi-interpretation in weak set theories
|
2020
|
Alfredo Roque Freire
Joel David Hamkins
|
|
+
|
Choiceless large cardinals and set-theoretic potentialism
|
2020
|
Raffaella Cutolo
Joel David Hamkins
|
|
+
|
Categorical large cardinals and the tension between categoricity and set-theoretic reflection
|
2020
|
Joel David Hamkins
Hans Robin Solberg
|
|
+
|
Bi-interpretation in weak set theories
|
2020
|
Alfredo Roque Freire
Joel David Hamkins
|
|
+
|
Forcing as a computational process
|
2020
|
Joel David Hamkins
Russell Miller
Kameryn J. Williams
|
|
+
|
Modal model theory
|
2020
|
Joel David Hamkins
Wojciech Aleksander WoĆoszyn
|
|
+
PDF
Chat
|
When does every definable nonempty set have a definable element?
|
2019
|
François G. Dorais
Joel David Hamkins
|
|
+
PDF
Chat
|
THE MODAL LOGIC OF SET-THEORETIC POTENTIALISM AND THE POTENTIALIST MAXIMALITY PRINCIPLES
|
2019
|
Joel David Hamkins
Ăystein Linnebo
|
|
+
|
The rearrangement number
|
2019
|
Andreas Blass
Jörg Brendle
Will Brian
Joel David Hamkins
Michael Hardy
Paul Larson
|
|
+
PDF
Chat
|
THE IMPLICITLY CONSTRUCTIBLE UNIVERSE
|
2019
|
Marcia J. Groszek
Joel David Hamkins
|
|
+
|
Representing Ordinal Numbers with Arithmetically Interesting Sets of Real Numbers
|
2019
|
D. Dakota Blair
Joel David Hamkins
Kevin OâBryant
|
|
+
PDF
Chat
|
Inner-Model Reflection Principles
|
2019
|
Neil Barton
Andrés Eduardo Caicedo
GĂŒnter Fuchs
Joel David Hamkins
Jonas Reitz
Ralf Schindler
|
|
+
PDF
Chat
|
Set-theoretic blockchains
|
2019
|
Miha E. HabiÄ
Joel David Hamkins
Lukas Daniel Klausner
Jonathan L. Verner
Kameryn J. Williams
|
|
+
|
The Sigma_1-definable universal finite sequence
|
2019
|
Joel David Hamkins
Kameryn J. Williams
|
|
+
|
Representing Ordinal Numbers with Arithmetically Interesting Sets of Real Numbers
|
2019
|
D. Dakota Blair
Joel David Hamkins
Kevin OâBryant
|
|
+
|
Topological models of arithmetic
|
2018
|
Ali Enayat
Joel David Hamkins
Bartosz WcisĆo
|
|
+
PDF
Chat
|
ZFC PROVES THAT THE CLASS OF ORDINALS IS NOT WEAKLY COMPACT FOR DEFINABLE CLASSES
|
2018
|
Ali Enayat
Joel David Hamkins
|
|
+
|
The subseries number
|
2018
|
Jörg Brendle
Will Brian
Joel David Hamkins
|
|
+
|
The modal logic of arithmetic potentialism and the universal algorithm
|
2018
|
Joel David Hamkins
|
|
+
PDF
Chat
|
Ehrenfeuchtâs Lemma in Set Theory
|
2018
|
GĂŒnter Fuchs
Victoria Gitman
Joel David Hamkins
|
|
+
|
Open class determinacy is preserved by forcing
|
2018
|
Joel David Hamkins
W. Hugh Woodin
|
|
+
|
Topological models of arithmetic
|
2018
|
Ali Enayat
Joel David Hamkins
Bartosz WcisĆo
|
|
+
|
The modal logic of arithmetic potentialism and the universal algorithm
|
2018
|
Joel David Hamkins
|
|
+
|
The subseries number
|
2018
|
Jörg Brendle
Will Brian
Joel David Hamkins
|
|
+
|
The universal finite set
|
2017
|
Joel David Hamkins
W. Hugh Woodin
|
|
+
|
Inner-model reflection principles.
|
2017
|
Neil Barton
Andrés Eduardo Caicedo
GĂŒnter Fuchs
Joel David Hamkins
Jonas Reitz
|
|
+
PDF
Chat
|
Strongly uplifting cardinals and the boldface resurrection axioms
|
2017
|
Joel David Hamkins
Thomas A. Johnstone
|
|
+
|
The modal logic of set-theoretic potentialism and the potentialist maximality principles
|
2017
|
Joel David Hamkins
Ăystein Linnebo
|
|
+
|
When does every definable nonempty set have a definable element
|
2017
|
François G. Dorais
Joel David Hamkins
|
|
+
|
A model of the generic Vop\v{e}nka principle in which the ordinals are not Mahlo
|
2017
|
Victoria Gitman
Joel David Hamkins
|
|
+
|
Incomparable Ï<sub>1</sub>âlike models of set theory
|
2017
|
GĂŒnter Fuchs
Victoria Gitman
Joel David Hamkins
|
|
+
|
Mathematical Pluralism
|
2017
|
Justin ClarkeâDoane
Joel David Hamkins
|
|
+
|
Computable quotient presentations of models of arithmetic and set theory
|
2017
|
MichaĆ Tomasz Godziszewski
Joel David Hamkins
|
|
+
PDF
Chat
|
Open determinacy for class games
|
2017
|
Victoria Gitman
Joel David Hamkins
|
|
+
PDF
Chat
|
Computable Quotient Presentations of Models of Arithmetic and Set Theory
|
2017
|
MichaĆ Tomasz Godziszewski
Joel David Hamkins
|
|
+
|
The inclusion relations of the countable models of set theory are all isomorphic
|
2017
|
Joel David Hamkins
Makoto Kikuchi
|
|
+
|
Boolean ultrapowers, the Bukovsky-Dehornoy phenomenon, and iterated ultrapowers
|
2017
|
GĂŒnter Fuchs
Joel David Hamkins
|
|
+
|
The set-theoretic universe $V$ is not necessarily a class-forcing extension of HOD
|
2017
|
Joel David Hamkins
Jonas Reitz
|
|
+
|
The universal finite set
|
2017
|
Joel David Hamkins
W. Hugh Woodin
|
|
+
|
Computable quotient presentations of models of arithmetic and set theory
|
2017
|
MichaĆ Tomasz Godziszewski
Joel David Hamkins
|
|
+
|
The modal logic of set-theoretic potentialism and the potentialist maximality principles
|
2017
|
Joel David Hamkins
Ăystein Linnebo
|
|
+
|
A model of the generic VopÄnka principle in which the ordinals are not Mahlo
|
2017
|
Victoria Gitman
Joel David Hamkins
|
|
+
|
When does every definable nonempty set have a definable element?
|
2017
|
François G. Dorais
Joel David Hamkins
|
|
+
|
The Rearrangement Number
|
2016
|
Andreas Blass
Jörg Brendle
Will Brian
Joel David Hamkins
Michael Hardy
Paul Larson
|
|
+
|
ZFC proves that the class of ordinals is not weakly compact for definable classes
|
2016
|
Ali Enayat
Joel David Hamkins
|
|
+
PDF
Chat
|
What is the theory without power set?
|
2016
|
Victoria Gitman
Joel David Hamkins
Thomas A. Johnstone
|
|
+
|
The Ground Axiom
|
2016
|
Joel David Hamkins
|
|
+
|
The VopÄnka principle is inequivalent to but conservative over the VopÄnka scheme
|
2016
|
Joel David Hamkins
|
|
+
|
The Vop\v{e}nka principle is inequivalent to but conservative over the Vop\v{e}nka scheme
|
2016
|
Joel David Hamkins
|
|
+
PDF
Chat
|
Set-theoretic mereology
|
2016
|
Joel David Hamkins
Makoto Kikuchi
|
|
+
PDF
Chat
|
Algebraicity and Implicit Definability in Set Theory
|
2016
|
Joel David Hamkins
Cole Leahy
|
|
+
|
Set-theoretic mereology
|
2016
|
Joel David Hamkins
Makoto Kikuchi
|
|
+
|
The Rearrangement Number
|
2016
|
Andreas Blass
Jörg Brendle
Will Brian
Joel David Hamkins
Michael Hardy
Paul Larson
|
|
+
|
The Ground Axiom
|
2016
|
Joel David Hamkins
|
|
+
|
The VopÄnka principle is inequivalent to but conservative over the VopÄnka scheme
|
2016
|
Joel David Hamkins
|
|
+
|
ZFC proves that the class of ordinals is not weakly compact for definable classes
|
2016
|
Ali Enayat
Joel David Hamkins
|
|
+
PDF
Chat
|
Superstrong and other large cardinals are never Laver indestructible
|
2015
|
Joan Bagaria
Joel David Hamkins
Konstantinos Tsaprounis
Toshimichi Usuba
|
|
+
|
A position in infinite chess with game value $\omega^4$
|
2015
|
C. D. A. Evans
Joel David Hamkins
Norman Lewis Perlmutter
|
|
+
|
Large cardinals need not be large in HOD
|
2015
|
Yong Cheng
SyâDavid Friedman
Joel David Hamkins
|
|
+
PDF
Chat
|
Structural connections between a forcing class and its modal logic
|
2015
|
Joel David Hamkins
George Leibman
Benedikt Löwe
|
|
+
PDF
Chat
|
The least weakly compact cardinal can be unfoldable, weakly measurable and nearly $${\theta}$$ Ξ -supercompact
|
2015
|
Brent Cody
Moti Gitik
Joel David Hamkins
Jason A. Schanker
|
|
+
|
Incomparable $\omega_1$-like models of set theory
|
2015
|
GĂŒnter Fuchs
Victoria Gitman
Joel David Hamkins
|
|
+
PDF
Chat
|
Is the Dream Solution of the Continuum Hypothesis Attainable?
|
2015
|
Joel David Hamkins
|
|
+
|
Upward closure and amalgamation in the generic multiverse of a countable model of set theory
|
2015
|
Joel David Hamkins
|
|
+
|
Open determinacy for class games
|
2015
|
Victoria Gitman
Joel David Hamkins
|
|
+
|
A position in infinite chess with game value $Ï^4$
|
2015
|
Cassandra Evans
Joel David Hamkins
Norman Lewis Perlmutter
|
|
+
|
Incomparable $Ï_1$-like models of set theory
|
2015
|
GĂŒnter Fuchs
Victoria Gitman
Joel David Hamkins
|
|
+
|
Set-theoretic geology
|
2014
|
GĂŒnter Fuchs
Joel David Hamkins
Jonas Reitz
|
|
+
|
Strongly uplifting cardinals and the boldface resurrection axioms
|
2014
|
Joel David Hamkins
Thomas A. Johnstone
|
|
+
PDF
Chat
|
Resurrection axioms and uplifting cardinals
|
2014
|
Joel David Hamkins
Thomas A. Johnstone
|
|
+
|
Large cardinals need not be large in HOD
|
2014
|
Yong Cheng
SyâDavid Friedman
Joel David Hamkins
|
|
+
|
TRANSFINITE GAME VALUES IN INFINITE CHESS
|
2014
|
C. D. A. Evans
Joel David Hamkins
|
|
+
|
Strongly uplifting cardinals and the boldface resurrection axioms
|
2014
|
Joel David Hamkins
Thomas A. Johnstone
|
|
+
|
The role of the foundation axiom in the Kunen inconsistency
|
2013
|
Ali Sadegh Daghighi
Mohammad Golshani
Joel David Hamkins
Emil JeĆĂĄbek
|
|
+
PDF
Chat
|
Infinite time Turing machines and an application to the hierarchy of equivalence relations on the reals
|
2013
|
Samuel Coskey
Joel David Hamkins
|
|
+
PDF
Chat
|
EVERY COUNTABLE MODEL OF SET THEORY EMBEDS INTO ITS OWN CONSTRUCTIBLE UNIVERSE
|
2013
|
Joel David Hamkins
|
|
+
|
Resurrection axioms and uplifting cardinals
|
2013
|
Joel David Hamkins
Thomas A. Johnstone
|
|
+
|
Superstrong and other large cardinals are never Laver indestructible
|
2013
|
Joan Bagaria
Joel David Hamkins
Konstantinos Tsaprounis
Toshimichi Usuba
|
|
+
PDF
Chat
|
Singular cardinals and strong extenders
|
2013
|
Arthur W. Apter
James Cummings
Joel David Hamkins
|
|
+
|
The least weakly compact cardinal can be unfoldable, weakly measurable and nearly $\theta$-supercompact
|
2013
|
Brent Cody
Moti Gitik
Joel David Hamkins
Jason A. Schanker
|
|
+
|
Transfinite game values in infinite chess
|
2013
|
C. D. A. Evans
Joel David Hamkins
|
|
+
PDF
Chat
|
Transfinite game values in infinite chess
|
2013
|
Cassandra Evans
Joel David Hamkins
|
|
+
PDF
Chat
|
Pointwise definable models of set theory
|
2013
|
Joel David Hamkins
David Linetsky
Jonas Reitz
|
|
+
|
The foundation axiom and elementary self-embeddings of the universe
|
2013
|
Ali Sadegh Daghighi
Mohammad Golshani
Joel David Hamkins
Emil JeĆĂĄbek
|
|
+
|
Satisfaction is not absolute
|
2013
|
Joel David Hamkins
Ruizhi Yang
|
|
+
|
Resurrection axioms and uplifting cardinals
|
2013
|
Joel David Hamkins
Thomas A. Johnstone
|
|
+
|
Superstrong and other large cardinals are never Laver indestructible
|
2013
|
Joan Bagaria
Joel David Hamkins
Konstantinos Tsaprounis
Toshimichi Usuba
|
|
+
|
The least weakly compact cardinal can be unfoldable, weakly measurable and nearly $Ξ$-supercompact
|
2013
|
Brent Cody
Moti Gitik
Joel David Hamkins
Jason A. Schanker
|
|
+
|
Transfinite game values in infinite chess
|
2013
|
Cassandra Evans
Joel David Hamkins
|
|
+
PDF
Chat
|
Moving Up and Down in the Generic Multiverse
|
2012
|
Joel David Hamkins
Benedikt Löwe
|
|
+
|
A multiverse perspective on the axiom of constructiblity
|
2012
|
Joel David Hamkins
|
|
+
PDF
Chat
|
The rigid relation principle, a new weak choice principle
|
2012
|
Joel David Hamkins
Justin Palumbo
|
|
+
PDF
Chat
|
THE SET-THEORETIC MULTIVERSE
|
2012
|
Joel David Hamkins
|
|
+
|
Generalizations of the Kunen inconsistency
|
2012
|
Joel David Hamkins
Greg Kirmayer
Norman Lewis Perlmutter
|
|
+
|
Singular cardinals and strong extenders
|
2012
|
Arthur W. Apter
James Cummings
Joel David Hamkins
|
|
+
|
Well-founded Boolean ultrapowers as large cardinal embeddings
|
2012
|
Joel David Hamkins
Daniel Evan Seabold
|
|
+
PDF
Chat
|
The Hierarchy of Equivalence Relations on the Natural Numbers Under Computable Reducibility
|
2012
|
Samuel Coskey
Joel David Hamkins
Russell Miller
|
|
+
PDF
Chat
|
The Mate-in-n Problem of Infinite Chess Is Decidable
|
2012
|
Dan Brumleve
Joel David Hamkins
Philipp Schlicht
|
|
+
|
The mate-in-n problem of infinite chess is decidable
|
2012
|
Dan Brumleve
Joel David Hamkins
Philipp Schlicht
|
|
+
|
Singular cardinals and strong extenders
|
2012
|
Arthur W. Apter
J. R. Cummings
Joel David Hamkins
|
|
+
|
Structural connections between a forcing class and its modal logic
|
2012
|
Joel David Hamkins
George Leibman
Benedikt Löwe
|
|
+
|
A multiverse perspective on the axiom of constructiblity
|
2012
|
Joel David Hamkins
|
|
+
|
Moving up and down in the generic multiverse
|
2012
|
Joel David Hamkins
Benedikt Löwe
|
|
+
PDF
Chat
|
Inner models with large cardinal features usually obtained by forcing
|
2011
|
Arthur W. Apter
Victoria Gitman
Joel David Hamkins
|
|
+
|
Inner models with large cardinal features usually obtained by forcing
|
2011
|
Arthur W. Apter
Victoria Gitman
Joel David Hamkins
|
|
+
|
What is the theory ZFC without power set
|
2011
|
Victoria Gitman
Joel David Hamkins
Thomas A. Johnstone
|
|
+
|
Set-Theoretic Geology
|
2011
|
GĂŒnter Fuchs
Joel David Hamkins
Jonas Reitz
|
|
+
|
The Rigid Relation Principle, a New Weak Choice Principle
|
2011
|
Joel David Hamkins
Justin Palumbo
|
|
+
|
Generalizations of the Kunen Inconsistency
|
2011
|
Joel David Hamkins
Greg Kirmayer
Norman Lewis Perlmutter
|
|
+
|
Pointwise Definable Models of Set Theory
|
2011
|
Joel David Hamkins
David Linetsky
Jonas Reitz
|
|
+
|
A natural model of the multiverse axioms
|
2011
|
Victoria Gitman
Joel David Hamkins
|
|
+
PDF
Chat
|
Infinite Time Decidable Equivalence Relation Theory
|
2011
|
Samuel Coskey
Joel David Hamkins
|
|
+
|
Generalizations of the Kunen Inconsistency
|
2011
|
Joel David Hamkins
Greg Kirmayer
Norman Lewis Perlmutter
|
|
+
|
A natural model of the multiverse axioms
|
2011
|
Victoria Gitman
Joel David Hamkins
|
|
+
|
Pointwise Definable Models of Set Theory
|
2011
|
Joel David Hamkins
David Linetsky
Jonas Reitz
|
|
+
|
What is the theory ZFC without power set?
|
2011
|
Victoria Gitman
Joel David Hamkins
Thomas A. Johnstone
|
|
+
|
Inner models with large cardinal features usually obtained by forcing
|
2011
|
Arthur W. Apter
Victoria Gitman
Joel David Hamkins
|
|
+
|
The Rigid Relation Principle, a New Weak Choice Principle
|
2011
|
Joel David Hamkins
Justin Palumbo
|
|
+
|
Set-Theoretic Geology
|
2011
|
GĂŒnter Fuchs
Joel David Hamkins
Jonas Reitz
|
|
+
PDF
Chat
|
A Natural Model of the Multiverse Axioms
|
2010
|
Victoria Gitman
Joel David Hamkins
|
|
+
|
Indestructible Strong Unfoldability
|
2010
|
Joel David Hamkins
Thomas A. Johnstone
|
|
+
PDF
Chat
|
Degrees of rigidity for Souslin trees
|
2009
|
GĂŒnter Fuchs
Joel David Hamkins
|
|
+
|
The proper and semi-proper forcing axioms for forcing notions that preserve â”â or â”â
|
2008
|
Joel David Hamkins
Thomas Johnstone
|
|
+
|
Tall cardinals
|
2008
|
Joel David Hamkins
|
|
+
PDF
Chat
|
Changing the heights of automorphism towers by forcing with Souslin trees over L
|
2008
|
GĂŒnter Fuchs
Joel David Hamkins
|
|
+
PDF
Chat
|
The ground axiom is consistent with V $\neq $ HOD
|
2008
|
Joel David Hamkins
Jonas Reitz
W. Hugh Woodin
|
|
+
|
Some Second Order Set Theory
|
2008
|
Joel David Hamkins
|
|
+
|
The modal logic of forcing
|
2007
|
Joel David Hamkins
Benedikt Löwe
|
|
+
|
A Survey of Infinite Time Turing Machines
|
2007
|
Joel David Hamkins
|
|
+
|
Large cardinals with few measures
|
2007
|
Arthur W. Apter
James Cummings
Joel David Hamkins
|
|
+
|
Changing the Heights of Automorphism Towers by Forcing with Souslin Trees over L
|
2007
|
GĂŒnter Fuchs
Joel David Hamkins
|
|
+
PDF
Chat
|
The Halting Problem Is Decidable on a Set of Asymptotic Probability One
|
2006
|
Joel David Hamkins
Alexei Miasnikov
|
|
+
|
Diamond (on the regulars) can fail at any strongly unfoldable cardinal
|
2006
|
Mirna DĆŸamonja
Joel David Hamkins
|
|
+
|
Degrees of rigidity for Souslin trees
|
2006
|
Joel David Hamkins
GĂŒnter Fuchs
|
|
+
|
Large cardinals with few measures
|
2006
|
Arthur W. Apter
James Cummings
Joel David Hamkins
|
|
+
|
Degrees of rigidity for Souslin trees
|
2006
|
Joel David Hamkins
GĂŒnter Fuchs
|
|
+
|
Infinite time computable model theory
|
2006
|
Joel David Hamkins
Russell Miller
Daniel Evan Seabold
Steve Warner
|
|
+
PDF
Chat
|
P â NP â© co-NP for Infinite Time Turing Machines
|
2005
|
Vinay Deolalikar
Joel David Hamkins
Ralf Schindler
|
|
+
|
The modal logic of forcing
|
2005
|
Joel David Hamkins
Benedikt Loewe
|
|
+
PDF
Chat
|
The Necessary Maximality Principle for c. c. c. forcing is equiconsistent with a weakly compact cardinal
|
2005
|
Joel David Hamkins
W. Hugh Woodin
|
|
+
|
The halting problem is decidable on a set of asymptotic probability one
|
2005
|
Joel David Hamkins
Alexei Miasnikov
|
|
+
|
The modal logic of forcing
|
2005
|
Joel David Hamkins
Benedikt Loewe
|
|
+
|
The Necessary Maximality Principle for c.c.c. forcing is equiconsistent with a weakly compact cardinal
|
2004
|
Joel David Hamkins
W. Hugh Woodin
|
|
+
|
Diamond (on the regulars) can fail at any strongly unfoldable cardinal
|
2004
|
Joel David Hamkins
Mirna DĆŸamonja
|
|
+
PDF
Chat
|
Pf â NPf for almost all f
|
2003
|
Joel David Hamkins
Philip Welch
|
|
+
PDF
Chat
|
Exactly controlling the non-supercompact strongly compact cardinals
|
2003
|
Arthur W. Apter
Joel David Hamkins
|
|
+
PDF
Chat
|
A simple maximality principle
|
2003
|
Joel David Hamkins
|
|
+
|
P is not equal to NP intersect coNP for Infinite Time Turing Machines
|
2003
|
Vinay Deolalikar
Joel David Hamkins
RalfâDieter Schindler
|
|
+
PDF
Chat
|
Extensions with the approximation and cover properties have no new large cardinals
|
2003
|
Joel David Hamkins
|
|
+
|
Exactly controlling the non-supercompact strongly compact cardinals
|
2003
|
Arthur W. Apter
Joel David Hamkins
|
|
+
PDF
Chat
|
Indestructibility and the level-by-level agreement between strong compactness and supercompactness
|
2002
|
Arthur W. Apter
Joel David Hamkins
|
|
+
|
P^f is not equal to NP^f for almost all f
|
2002
|
Joel David Hamkins
Philip Welch
|
|
+
|
Infinite Time Turing Machines: Supertask Computation
|
2002
|
Joel David Hamkins
|
|
+
|
How tall is the automorphism tower of a group?
|
2002
|
Joel David Hamkins
|
|
+
|
A class of strong diamond principles
|
2002
|
Joel David Hamkins
|
|
+
|
None
|
2002
|
Joel David Hamkins
|
|
+
|
Supertask Computation
|
2002
|
Joel David Hamkins
|
|
+
|
Gap forcing
|
2001
|
Joel David Hamkins
|
|
+
|
Indestructible Weakly Compact Cardinals and the Necessity of Supercompactness for Certain Proof Schemata
|
2001
|
Arthur W. Apter
Joel David Hamkins
|
|
+
PDF
Chat
|
Unfoldable cardinals and the GCH
|
2001
|
Joel David Hamkins
|
|
+
|
Indestructible Weakly Compact Cardinals and the Necessity of Supercompactness for Certain Proof Schemata
|
2001
|
Arthur W. Apter
Joel David Hamkins
|
|
+
PDF
Chat
|
Infinite Time Turing Machines With Only One Tape
|
2001
|
Joel David Hamkins
Daniel Evan Seabold
|
|
+
|
The Wholeness Axioms and V=HOD
|
2001
|
Joel David Hamkins
|
|
+
|
Indestructibility and the level-by-level agreement between strong compactness and supercompactness
|
2001
|
Arthur W. Apter
Joel David Hamkins
|
|
+
PDF
Chat
|
Infinite time Turing machines
|
2000
|
Joel David Hamkins
Andy Lewis
|
|
+
PDF
Chat
|
Small forcing creates neither strong nor Woodin cardinals
|
2000
|
Joel David Hamkins
W. Hugh Woodin
|
|
+
PDF
Chat
|
Changing the heights of automorphism towers
|
2000
|
Joel David Hamkins
Simon Thomas
|
|
+
|
The lottery preparation
|
2000
|
Joel David Hamkins
|
|
+
|
A simple maximality principle
|
2000
|
Joel David Hamkins
|
|
+
PDF
Chat
|
Gap Forcing: Generalizing the LĂ©vy-Solovay Theorem
|
1999
|
Joel David Hamkins
|
|
+
|
Gap forcing: generalizing the Levy-Solovay theorem
|
1999
|
Joel David Hamkins
|
|
+
|
The Wholeness Axioms and V=HOD
|
1999
|
Joel David Hamkins
|
|
+
|
Unfoldable cardinals and the GCH
|
1999
|
Joel David Hamkins
|
|
+
|
Infinite time Turing machines with only one tape
|
1999
|
Joel David Hamkins
Daniel Evan Seabold
|
|
+
|
Indestructible weakly compact cardinals and the necessity of supercompactness for certain proof schemata
|
1999
|
Arthur W. Apter
Joel David Hamkins
|
|
+
|
The Lottery Preparation
|
1998
|
Joel David Hamkins
|
|
+
|
Superdestructibility: A dual to Laver's indestructibility
|
1998
|
Joel David Hamkins
Saharon Shelah
|
|
+
PDF
Chat
|
Small forcing makes any cardinal superdestructible
|
1998
|
Joel David Hamkins
|
|
+
|
Destruction or preservation as you like it
|
1998
|
Joel David Hamkins
|
|
+
PDF
Chat
|
Every group has a terminating transfinite automorphism tower
|
1998
|
Joel David Hamkins
|
|
+
|
Infinite Time Turing Machines
|
1998
|
Joel David Hamkins
Andy Lewis
|
|
+
|
Post's problem for supertasks has both positive and negative solutions
|
1998
|
Joel David Hamkins
Andrew D. Lewis
|
|
+
|
Every group has a terminating transfinite automorphism tower
|
1998
|
Joel David Hamkins
|
|
+
|
Small forcing creates neither strong nor Woodin cardinals
|
1998
|
Joel David Hamkins
W. Hugh Woodin
|
|
+
|
Universal Indestructibility
|
1998
|
Arthur W. Apter
Joel David Hamkins
|
|
+
|
The Lottery Preparation
|
1998
|
Joel David Hamkins
|
|
+
|
How Tall is the Automorphism Tower of a Group?
|
1998
|
Joel David Hamkins
|
|
+
|
Gap Forcing
|
1998
|
Joel David Hamkins
|
|
+
|
Yiannis N. Moschovakis. Notes on set theory. Undergraduate texts in mathematics. Springer-Verlag, New York, Berlin, Heidelberg, etc., 1994, xiv + 272 pp.
|
1997
|
Joel David Hamkins
|
|
+
|
Canonical seeds and Prikry trees
|
1997
|
Joel David Hamkins
|
|
+
|
Changing the heights of automorphism towers
|
1997
|
Joel David Hamkins
Simon Thomas
|
|
+
|
Changing the heights of automorphism towers
|
1997
|
Joel David Hamkins
Thomas Simon
|
|
+
|
Superdestructibility: a dual to Laver indestructibility
|
1996
|
Joel David Hamkins
Saharon Shelah
|
|
+
|
Fragile measurability
|
1994
|
Joel David Hamkins
|