Joel David Hamkins

Math. Log. Q., November, 2023

2022

The Modal Logic of Set-Theoretic Potentialism and the Potentialist Maximality Principles.

[BibT_eX]

[DOI]

Øystein Linnebo

Rev. Symb. Log., 2022

Choiceless large cardinals and set-theoretic potentialism.

[BibT_eX]

[DOI]

Raffaella Cutolo

Math. Log. Q., 2022

The σ1-Definable Universal finite sequence.

[BibT_eX]

[DOI]

Kameryn J. Williams

J. Symb. Log., 2022

Infinite Hex is a draw.

[BibT_eX]

[DOI]

Davide Leonessi

CoRR, 2022

2021

Bi-Interpretation in Weak Set Theories.

[BibT_eX]

[DOI]

Alfredo Roque Freire

J. Symb. Log., 2021

Transfinite game values in infinite draughts.

[BibT_eX]

[DOI]

Davide Leonessi

CoRR, 2021

2020

Inner-Model Reflection Principles.

[BibT_eX]

[DOI]

Neil Barton

Andrés Eduardo Caicedo

Stud Logica, 2020

The exact strength of the class forcing Theorem.

[BibT_eX]

[DOI]

J. Symb. Log., 2020

2019

When does every definable nonempty set have a definable element?

[BibT_eX]

[DOI]

François G. Dorais

Math. Log. Q., 2019

The Implicitly Constructible Universe.

[BibT_eX]

[DOI]

Marcia J. Groszek

J. Symb. Log., 2019

Set-theoretic blockchains.

[BibT_eX]

[DOI]

Miha E. Habic

Lukas Daniel Klausner

Jonathan Verner

Kameryn J. Williams

Arch. Math. Log., 2019

A model of the generic Vopěnka principle in which the ordinals are not Mahlo.

[BibT_eX]

[DOI]

Arch. Math. Log., 2019

2018

Ehrenfeucht's Lemma in Set Theory.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 2018

Zfc Proves that the class of Ordinals is not Weakly Compact for Definable Classes.

[BibT_eX]

[DOI]

Ali Enayat

J. Symb. Log., 2018

2017

Incomparable ω1-like models of set theory.

[BibT_eX]

[DOI]

Math. Log. Q., 2017

A Position in Infinite Chess With Game Value ω4.

[BibT_eX]

[DOI]

C. D. A. Evans

Norman Lewis Perlmutter

Integers, 2017

Strongly uplifting cardinals and the boldface resurrection axioms.

[BibT_eX]

[DOI]

Michal Tomasz Godziszewski

Arch. Math. Log., 2017

Computable Quotient Presentations of Models of Arithmetic and Set Theory.

[BibT_eX]

[DOI]

Proceedings of the Logic, Language, Information, and Computation, 2017

2016

Algebraicity and Implicit Definability in Set Theory.

[BibT_eX]

[DOI]

Cole Leahy

Notre Dame J. Formal Log., 2016

What is the theory without power set?

[BibT_eX]

[DOI]

Math. Log. Q., 2016

Superstrong and other large cardinals are never Laver indestructible.

[BibT_eX]

[DOI]

Joan Bagaria

Konstantinos Tsaprounis

Toshimichi Usuba

Arch. Math. Log., 2016

2015

Is the Dream Solution of the Continuum Hypothesis Attainable?

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 2015

Set-theoretic geology.

[BibT_eX]

[DOI]

Jonas Reitz

Ann. Pure Appl. Log., 2015

Large cardinals need not be large in HOD.

[BibT_eX]

[DOI]

Yong Cheng

Sy-David Friedman

Ann. Pure Appl. Log., 2015

The least weakly compact cardinal can be unfoldable, weakly measurable and nearly θ-supercompact.

[BibT_eX]

[DOI]

Arch. Math. Log., 2015

2014

Transfinite Game Values in Infinite Chess.

[BibT_eX]

[DOI]

C. D. A. Evans

Integers, 2014

Resurrection axioms and uplifting cardinals.

[BibT_eX]

[DOI]

Arch. Math. Log., 2014

2013

Pointwise definable models of set theory.

[BibT_eX]

[DOI]

David Linetsky

Jonas Reitz

J. Symb. Log., 2013

Every Countable Model of Set Theory embeds into its Own Constructible Universe.

[BibT_eX]

[DOI]

J. Math. Log., 2013

Moving Up and Down in the Generic Multiverse.

[BibT_eX]

[DOI]

Benedikt Löwe

Proceedings of the Logic and Its Applications, 5th Indian Conference, 2013

2012

The Set-Theoretic Multiverse.

[BibT_eX]

[DOI]

Rev. Symb. Log., 2012

The rigid relation principle, a new weak choice principle.

[BibT_eX]

[DOI]

Justin Palumbo

Math. Log. Q., 2012

The Hierarchy of Equivalence Relations on the Natural Numbers Under Computable Reducibility.

[BibT_eX]

[DOI]

Samuel Coskey

Comput., 2012

Generalizations of the Kunen inconsistency.

[BibT_eX]

[DOI]

Greg Kirmayer

Norman Lewis Perlmutter

Ann. Pure Appl. Log., 2012

Inner models with large cardinal features usually obtained by forcing.

[BibT_eX]

[DOI]

Arch. Math. Log., 2012

The Mate-in-n Problem of Infinite Chess Is Decidable.

[BibT_eX]

[DOI]

Dan Brumleve

Philipp Schlicht

Proceedings of the How the World Computes, 2012

2011

Infinite Time Decidable Equivalence Relation Theory.

[BibT_eX]

[DOI]

Samuel Coskey

Notre Dame J. Formal Log., 2011

2010

Indestructible Strong Unfoldability.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 2010

A Natural Model of the Multiverse Axioms.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 2010

2009

Tall cardinals.

[BibT_eX]

[DOI]

Math. Log. Q., 2009

Degrees of rigidity for Souslin trees.

[BibT_eX]

[DOI]

J. Symb. Log., 2009

Post's Problem for ordinal register machines: An explicit approach.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2009

Some Second Order Set Theory.

[BibT_eX]

[DOI]

Proceedings of the Logic and Its Applications, Third Indian Conference, 2009

2008

Changing the heights of automorphism towers by forcing with Souslin trees over L.

[BibT_eX]

[DOI]

J. Symb. Log., 2008

2007

A Survey of Infinite Time Turing Machines.

[BibT_eX]

[DOI]

Proceedings of the Machines, Computations, and Universality, 5th International Conference, 2007

Post's Problem for Ordinal Register Machines.

[BibT_eX]

[DOI]

Proceedings of the Computation and Logic in the Real World, 2007

The Complexity of Quickly ORM-Decidable Sets.

[BibT_eX]

[DOI]

David Linetsky

Proceedings of the Computation and Logic in the Real World, 2007

2006

The Halting Problem Is Decidable on a Set of Asymptotic Probability One.

[BibT_eX]

[DOI]

Alexei Miasnikov

Notre Dame J. Formal Log., 2006

Diamond (on the regulars) can fail at any strongly unfoldable cardinal.

[BibT_eX]

[DOI]

Mirna Dzamonja

Ann. Pure Appl. Log., 2006

2005

The Necessary Maximality Principle for c. c. c. forcing is equiconsistent with a weakly compact cardinal.

[BibT_eX]

[DOI]

W. Hugh Woodin

Math. Log. Q., 2005

P != NP cap co-NP for Infinite Time Turing Machines.

[BibT_eX]

[DOI]

Vinay Deolalikar

Ralf Schindler

J. Log. Comput., 2005

Infinitary Computability with Infinite Time Turing Machines.

[BibT_eX]

[DOI]

Proceedings of the New Computational Paradigms, 2005

2003

Pf != NPf for almost all f.

[BibT_eX]

[DOI]

Philip D. Welch

Math. Log. Q., 2003

A simple maximality principle.

[BibT_eX]

[DOI]

J. Symb. Log., 2003

Exactly controlling the non-supercompact strongly compact cardinals.

[BibT_eX]

[DOI]

J. Symb. Log., 2003

2002

Infinite Time Turing Machines.

[BibT_eX]

[DOI]

Minds Mach., 2002

Indestructibility and The Level-By-Level Agreement Between Strong Compactness and Supercompactness.

[BibT_eX]

[DOI]

J. Symb. Log., 2002

Post's problem for supertasks has both positive and negative solutions.

[BibT_eX]

[DOI]

Andrew Lewis

Arch. Math. Log., 2002

2001

Infinite Time Turing Machines With Only One Tape.

[BibT_eX]

[DOI]

Daniel Evan Seabold

Math. Log. Q., 2001

Indestructible Weakly Compact Cardinals and the Necessity of Supercompactness for Certain Proof Schemata.

[BibT_eX]

[DOI]

Math. Log. Q., 2001

Unfoldable Cardinals and The GCH.

[BibT_eX]

[DOI]

J. Symb. Log., 2001

The Wholeness Axioms and V=HOD.

[BibT_eX]

[DOI]

Arch. Math. Log., 2001

Supertask computation.

[BibT_eX]

[DOI]

Proceedings of the Classical and New Paradigms of Computation and their Complexity Hierarchies, 2001

2000

Infinite Time Turing Machines.

[BibT_eX]

[DOI]

Andy Lewis

J. Symb. Log., 2000

Changing the Heights of Automorphism Towers.

[BibT_eX]

[DOI]

Simon Thomas

Ann. Pure Appl. Log., 2000

The Lottery Preparation.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2000

1999

Gap forcing: Generalizing the Lévy-Solovay theorem.

[BibT_eX]

[DOI]

Bull. Symb. Log., 1999

1998

Superdestructibility: A Dual to Laver's Indestructibility.

[BibT_eX]

[DOI]

Saharon Shelah

J. Symb. Log., 1998

Small Forcing Makes Any Cardinal Superdestructable.

[BibT_eX]

[DOI]

J. Symb. Log., 1998

Destruction or Preservation as You Like It.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1998

1997

Canonical Seeds and Prikiry Trees.

[BibT_eX]

[DOI]

J. Symb. Log., 1997

1994

Fragile Measurability.

[BibT_eX]

[DOI]