:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Harrison-Trainor, Matthew, Kim, J. Thomas
Format:	Preprint
Published:	2026
Subjects:	Logic
Online Access:	https://arxiv.org/abs/2602.07166
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

Relative to any non-arithmetic set
by: Harrison-Trainor, Matthew
Published: (2025)

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

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

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

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

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

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

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

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

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

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

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

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

Definability and Scott rank in separable Metric structures
by: Bejarano, Diego
Published: (2024)

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

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

Infinite trees
by: Goy, Alexandre
Published: (2025)

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

Computable Gelfand Duality
by: Burton, Peter, et al.
Published: (2024)

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

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

Diamonds on trees
by: Guzmán, Osvaldo, et al.
Published: (2025)

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

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

Partition theorems for expanded trees
by: Shelah, Saharon
Published: (2021)

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

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

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

Topological Dualities for Modal Algebras
by: Collinson, Matthew
Published: (2026)

Topologically valued transition structures
by: Collinson, Matthew
Published: (2026)

Effective Versions of Strong Measure Zero
by: Rayman, Matthew
Published: (2025)

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

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

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

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

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

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