The Complexity of the Core Model
Logic
2016-09-06 v1
Authors:
William J. Mitchell
Abstract
We use the Sigma^1_3 absoluteness theorem to show that the complexity of the statement "(omega,E)isisomorphictoaninitialsegmentofthecoremodel"isPi41,andthatthecomplexityofthestatement"(omega,E) is isomorphic to a member of the core model" is Delta^1_5.
Cite
@article{arxiv.math/9210202,
title = {The Complexity of the Core Model},
author = {William J. Mitchell},
journal= {arXiv preprint arXiv:math/9210202},
year = {2016}
}
Related papers
View all related →
Logic in Computer Science · Computer Science
Cores of Countably Categorical Structures
Manuel Bodirsky
2017-01-11
Logic · Mathematics
The complexity of the index sets of $\aleph_0$-categorical theories and of Ehrenfeucht theories
Steffen Lempp, Theodore A. Slaman
2007-05-23
Logic · Mathematics
Two results on complexities of decision problems of groups
Uri Andrews, Matthew Harrison-Trainor, Meng-Che "Turbo" Ho
2024-03-06
Logic · Mathematics
The isomorphism problem for classes of computable fields
Wesley Calvert
2007-05-23
Logic · Mathematics
End-extensions of models of weak arithmetic from complexity-theoretic containments
Leszek Aleksander Kołodziejczyk
2014-11-26
Logic · Mathematics
The Borel complexity of the class of models of first-order theories
Uri Andrews, David Gonzalez, Steffen Lempp, Dino Rossegger +1
2025-03-17
Logic in Computer Science · Computer Science
On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction
Barnaby Martin, Manuel Bodirsky, Martin Hils
2015-07-01
Logic · Mathematics
Model completeness and relative decidability
Jennifer Chubb, Russell Miller, Reed Solomon
2019-03-05
Logic · Mathematics
Amoeba-absoluteness and projective measurability
Jörg Brendle
2009-09-25
Logic · Mathematics
Isomorphism relations on classes of c.e. algebras
Meng-Che "Turbo" Ho, Martin Ritter, Luca San Mauro
2026-01-21
Logic · Mathematics
Degrees of categoricity on a cone
Barbara Csima, Matthew Harrison-Trainor
2015-06-10
Logic · Mathematics
Complexity of equivalence relations and preorders from computability theory
Egor Ianovski, Keng Meng Ng, Russell Miller, Andre Nies
2018-02-12
Logic in Computer Science · Computer Science
The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems
Libor Barto, Michael Pinsker
2016-02-16
Functional Analysis · Mathematics
An isomorphism between the completion of an Algebra and its Caratheodory Extension
Jun Tanaka
2008-03-13
Geometric Topology · Mathematics
Computational Complexity of Enumerative 3-Manifold Invariants
Eric Samperton
2018-05-24
Logic in Computer Science · Computer Science
Topological Complexity of omega-Powers : Extended Abstract
Olivier Finkel, Dominique Lecomte
2008-09-11
Logic · Mathematics
Taking model-complete cores
Manuel Bodirsky, Bertalan Bodor, Paolo Marimon
2025-12-25
Logic · Mathematics
A topological $L_{\omega_1,\omega}$-invariant
Boris Zilber
2023-05-11
Logic · Mathematics
Iterations of V and the core model
Ralf Schindler
2007-05-23
Group Theory · Mathematics
Constructive homomorphisms for classical groups
Scott H. Murray, Colva M. Roney-Dougal
2010-09-10
Symplectic Geometry · Mathematics
On finiteness and rigidity of J-holomorphic curves in symplectic three-folds
Eaman Eftekhary
2012-10-03
Logic · Mathematics
The Complexity of Orbits of Computably Enumerable Sets
Peter A. Cholak, Rod Downey, Leo Harrington
2015-05-13
Logic · Mathematics
Constructing many atomic models in $\aleph_1$
John T. Baldwin, Michael C. Laskowski, Saharon Shelah
2015-03-03
Complex Variables · Mathematics
Complex dimensions of real manifolds, attached analytic discs and parametric argument principle
Mark Agranovsky
2007-09-05
Combinatorics · Mathematics
On Subword Complexity of Morphic Sequences
Rostislav Devyatov
2015-02-23