Cover Image

Scott sentence complexities of linear orderings

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gonzalez, David, Rossegger, Dino
Format:	Preprint
Published:	2023
Subjects:	Logic 03C57, 03D45, 03C70, 03E15
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Algorithmic aspects of left-orderings of solvable Baumslag--Solitar groups via its dynamical realization
by: Ho, Meng-Che "Turbo", et al.
Published: (2024)

The Borel complexity of the class of models of first-order theories
by: Andrews, Uri, et al.
Published: (2024)

Classifying the complexity of models of arithmetic
by: Gonzalez, David, et al.
Published: (2025)

Feferman's completeness theorem
by: Pakhomov, Fedor, et al.
Published: (2024)

Learning Families of Algebraic Structures from Text
by: Bazhenov, Nikolay, et al.
Published: (2024)

Online and feasible presentability: from trees to modal algebras
by: Bazhenov, Nikolay, et al.
Published: (2025)

The generalized continuous model theory, Borel complexity and stability
by: Ivanov, Aleksander
Published: (2026)

On Cohesive Products of Fields
by: Dimitrov, Rumen, et al.
Published: (2026)

Isomorphism Spectra and Computably Composite Structures
by: Lakerdas-Gayle, Joey
Published: (2025)

Forcing Axioms, the Uniformization and the Basis Property
by: Hoffelner, Stefan
Published: (2020)

Scott Complexity of Reduced Abelian $p$-Groups
by: Alvir, Rachael, et al.
Published: (2024)

On Borel subsets of generalized Baire spaces
by: Hyttinen, Tapani, et al.
Published: (2025)

A Lopez-Escobar Theorem for Continuous Domains
by: Bazhenov, Nikolay, et al.
Published: (2023)

On $\boldsymbolΣ^1_3$- and $Σ^1_4$-uniformization
by: Hoffelner, Stefan
Published: (2026)

Dichotomy results for classes of countable graphs
by: Cipriani, Vittorio, et al.
Published: (2025)

A non-computable c.e. closed subset of $[0,1]$
by: Badaev, Serikzhan, et al.
Published: (2025)

Computability for tree presentations of continuum-size structures
by: Block, Jason, et al.
Published: (2025)

On the computability of cofinal Fraïssé limits
by: Ackerman, Nathanael, et al.
Published: (2026)

Effective Completeness for S4.3.1-Theories with Respect to Discrete Linear Models
by: Nichols, David
Published: (2017)

Computable vs Descriptive Combinatorics of Local Problems on Trees
by: Weilacher, Felix
Published: (2022)

Terminal Absoluteness of Collapse Forcings
by: Straffelini, Cesare
Published: (2025)

Twins: non-isomorphic models forced to be isomorphic. Part I
by: Shelah, Saharon
Published: (2025)

No universal group in a cardinal
by: Shelah, Saharon
Published: (2013)

The number of countable models of first-order theories
by: Pillay, Anand, et al.
Published: (2025)

Separating Maximality Principles
by: Gappo, Takehiko, et al.
Published: (2025)

Large cardinals, structural reflection, and the HOD Conjecture
by: Aguilera, Juan P., et al.
Published: (2024)

A metric lifting theorem
by: De Bondt, Ben, et al.
Published: (2024)

Large cardinals beyond HOD
by: Aguilera, Juan Pablo, et al.
Published: (2025)

Building complicated index models and Boolean algebras
by: Shelah, Saharon
Published: (2024)

Club guessing and the universal models
by: Džamonja, Mirna
Published: (2006)

Flatness and Nonforking without the Continuum Hypothesis
by: Majozi, Philani Rodney
Published: (2025)

A complicated family of trees with omega + 1 levels
by: Shelah, Saharon
Published: (2014)

Learning Equivalence Relations on Polish Spaces
by: Rossegger, Dino, et al.
Published: (2024)

Borel complexity of families of finite equivalence relations via large cardinals
by: Laskowski, Michael C., et al.
Published: (2024)

Generic Absoluteness Revisited
by: Fuchino, Sakaé, et al.
Published: (2024)

Reflection and Recurrence
by: Fuchino, Sakaé
Published: (2024)

Forcing Axioms and the Definabilty of the Nonstationary Ideal on $ω_1$
by: Hoffelner, Stefan, et al.
Published: (2022)

Extendible cardinals, and Laver-generic large cardinal axioms for extendibility
by: Fuchino, Sakaé
Published: (2025)

On Recurrence Axioms
by: Fuchino, Sakaé, et al.
Published: (2024)

On the learning power of Friedman-Stanley jumps
by: Cipriani, Vittorio, et al.
Published: (2025)