:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Harrison-Trainor, Matthew, Kim, J. Thomas
Formato:	Preprint
Publicado:	2026
Materias:	Logic
Acceso en línea:	https://arxiv.org/abs/2602.07166
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Scott Spectral Gaps are Bounded for Linear Orderings
por: Gonzalez, David, et al.
Publicado: (2024)

On the computability of optimal Scott sentences
por: Alvir, Rachael, et al.
Publicado: (2025)

Scott analysis, linear orders and almost periodic functions
por: Gonzalez, David, et al.
Publicado: (2024)

Relative to any non-arithmetic set
por: Harrison-Trainor, Matthew
Publicado: (2025)

Characterizing relative decidability in terms of model completeness
por: Harrison-Trainor, Matthew, et al.
Publicado: (2026)

A Relation on ${(ω, <)}$ of Intermediate Degree Spectrum on a Cone
por: Damaj, Jad, et al.
Publicado: (2024)

Measuring the complexity of characterizing $[0, 1]$, $S^1$, and $\mathbb{R}$ up to homeomorphism
por: Harrison-Trainor, Matthew, et al.
Publicado: (2024)

Computable learning of natural hypothesis classes
por: Harrison-Trainor, Matthew, et al.
Publicado: (2024)

Back-and-forth equivalent group von Neumann algebras
por: Goldbring, Isaac, et al.
Publicado: (2024)

The Logic of Cardinality Comparison Without the Axiom of Choice
por: Harrison-Trainor, Matthew, et al.
Publicado: (2022)

Optimal Syntactic Definitions of Back-and-Forth Types
por: Chen, Ruiyuan, et al.
Publicado: (2025)

Infinitary Logic Has No Expressive Efficiency Over Finitary Logic
por: Harrison-Trainor, Matthew, et al.
Publicado: (2022)

Iterated Priority Arguments in Descriptive Set Theory
por: Day, Adam, et al.
Publicado: (2022)

Two results on complexities of decision problems of groups
por: Andrews, Uri, et al.
Publicado: (2024)

Domain theory in univalent foundations I: Directed complete posets and Scott's $D_\infty$
por: de Jong, Tom
Publicado: (2024)

Computable Scott Sentences and the Friedman-Stanley embedding
por: Gonzalez, David, et al.
Publicado: (2026)

Definability and Scott rank in separable Metric structures
por: Bejarano, Diego
Publicado: (2024)

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

Scott-Karp analysis without sentences
por: Brunner, Andreas, et al.
Publicado: (2026)

Infinite trees
por: Goy, Alexandre
Publicado: (2025)

On matrix rank function over bounded arithmetics
por: Ken, Eitetsu, et al.
Publicado: (2023)

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

On the consistency of stronger lower bounds for NEXP
por: Thapen, Neil
Publicado: (2025)

Bi-intermediate logics of trees and co-trees
por: Bezhanishvili, N., et al.
Publicado: (2022)

Diamonds on trees
por: Guzmán, Osvaldo, et al.
Publicado: (2025)

A tree rewriting system for the Reflection Calculus
por: Santiago-Fernández, Sofía, et al.
Publicado: (2024)

On classes of bounded tree rank, their interpretations, and efficient sparsification
por: Gajarský, Jakub, et al.
Publicado: (2024)

Partition theorems for expanded trees
por: Shelah, Saharon
Publicado: (2021)

Characterizations of monadically dependent tree-ordered weakly sparse structures
por: Buffière, Hector, et al.
Publicado: (2026)

Measures on bounded perfect PAC fields
por: Chatzidakis, Zoé, et al.
Publicado: (2025)

Ultrafilter extensions of bounded graphs are elementary
por: Molnár, Zalán
Publicado: (2024)

Topological Dualities for Modal Algebras
por: Collinson, Matthew
Publicado: (2026)

Topologically valued transition structures
por: Collinson, Matthew
Publicado: (2026)

Effective Versions of Strong Measure Zero
por: Rayman, Matthew
Publicado: (2025)

On ideals related to Laver and Miller trees
por: Cieślak, Aleksander, et al.
Publicado: (2023)

Snakes can be fooled into thinking they live in a tree
por: Bartholdi, Laurent, et al.
Publicado: (2024)

On describing trees and quasi-trees from their leaves
por: Courcelle, Bruno
Publicado: (2025)

Generalized fluctuation bounds for stochastic algorithms in the presence of compactness
por: Neri, Morenikeji, et al.
Publicado: (2026)

Computable Scott sentences and the weak Whitehead problem for finitely presented groups
por: Paolini, Gianluca
Publicado: (2023)

Ultrapowers of determinacy models as iteration trees on HOD
por: Goldberg, Gabriel, et al.
Publicado: (2026)