Imagen de Portada

Isomorphism Spectra and Computably Composite Structures

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Lakerdas-Gayle, Joey
Formato:	Preprint
Publicado:	2025
Materias:	Logic 03D45, 03C57, 03D28
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

On Cohesive Products of Fields
por: Dimitrov, Rumen, et al.
Publicado: (2026)

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

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

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

Scott sentence complexities of linear orderings
por: Gonzalez, David, et al.
Publicado: (2023)

Computability in infinite Galois theory and algorithmically random algebraic fields
por: Calvert, Wesley, et al.
Publicado: (2023)

Externally definable fsg groups in NIP theories
por: Chernikov, Artem
Publicado: (2025)

Extensions of categoricity relative to a degree
por: Villano, Java Darleen
Publicado: (2025)

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

On the Hausdorff dimension of maximal chains and antichains of Turing and Hyperarithmetic degrees
por: Song, Sirun, et al.
Publicado: (2025)

Martin's Conjecture in the Enumeration Degrees
por: Cordero, Antonio Nakid
Publicado: (2025)

New definitions in the theory of Type 1 computable topological spaces
por: Rauzy, Emmanuel
Publicado: (2023)

A generalization of Markov's approach to the continuity problem for Type 1 computable functions
por: Rauzy, Emmanuel
Publicado: (2023)

A $Π^0_2$ Singleton of Minimal Arithmetic Degree
por: Gerdes, Peter
Publicado: (2023)

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

Analysis of HOD for Admissible Structures
por: Kruschewski, Jan, et al.
Publicado: (2025)

Finitely Bounded Homogeneity Turned Inside-Out
por: Rydval, Jakub
Publicado: (2021)

Finite final segments of the d.c.e. Turing degrees
por: Lempp, Steffen, et al.
Publicado: (2024)

Automatic structures and the problem of natural well-orderings
por: Beklemishev, Lev D., et al.
Publicado: (2024)

Strong reducibilities and set theory
por: Schweber, Noah
Publicado: (2024)

Bi-Isolated d.c.e. Degrees and $Σ_1$ Induction
por: Liu, Yong, et al.
Publicado: (2025)

Isolated d.c.e. degrees and $Σ_1$ induction
por: Liu, Yiqun, et al.
Publicado: (2025)

A Counterexample Regarding C.E. Closed Subsets of [0,1] Under Homeomorphisms
por: Bosserhoff, Volker
Publicado: (2025)

Paths, Ends and The Separation Problem for Infinite Graphs
por: Carrasco-Vargas, Nicanor, et al.
Publicado: (2024)

Comparing the Effective Content of Subshifts
por: Cordero, Antonio Nakid, et al.
Publicado: (2026)

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

Computable Gelfand Duality
por: Burton, Peter, et al.
Publicado: (2024)

On a Conjecture Regarding the Mouse Order for Weasels
por: Kruschewski, Jan, et al.
Publicado: (2022)

Terminal Absoluteness of Collapse Forcings
por: Straffelini, Cesare
Publicado: (2025)

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

Clarifying ordinals
por: Schweber, Noah
Publicado: (2024)

A Computably Enumerable $tt$-Degree Without Computably Enumerable Irreducible $m$-Degrees
por: Cintioli, Patrizio
Publicado: (2026)

On the problem of stability of abstract elementary classes of modules
por: Paolini, Gianluca, et al.
Publicado: (2025)

Separating Maximality Principles
por: Gappo, Takehiko, et al.
Publicado: (2025)

Forcing Axioms, the Uniformization and the Basis Property
por: Hoffelner, Stefan
Publicado: (2020)

Algorithmic correspondence and analytic rules
por: De Domenico, Andrea, et al.
Publicado: (2022)

There is No Composition in the Computable Reducibility Degrees
por: Mourad, Daniel
Publicado: (2024)

The Tree Pulldown Method: McLaughlin's Conjecture and Beyond
por: Harrington, Leo A., et al.
Publicado: (2025)

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