:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Alvir, Rachael, Csima, Barbara, Harrison-Trainor, Matthew
Format:	Preprint
Published:	2025
Subjects:	Logic
Online Access:	https://arxiv.org/abs/2504.09626
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

Scott spectral gaps for trees are bounded
by: Harrison-Trainor, Matthew, et al.
Published: (2026)

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)

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

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)

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

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

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

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

Frege on the reference of sentences
by: Rodrigues, Abilio
Published: (2024)

Doubly partially conservative sentences
by: Kogure, Haruka, et al.
Published: (2025)

Certified $Σ_1$-sentences
by: Kurahashi, Taishi, et al.
Published: (2023)

A variety of partially conservative sentences
by: Kogure, Haruka, et al.
Published: (2024)

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

First-order sentences in random groups I: universal sentences
by: Kharlampovich, O., et al.
Published: (2021)

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)

A note on computable étale spaces
by: de Brecht, Matthew
Published: (2026)

Incompleteness for stably computable formal systems
by: Savelyev, Yasha
Published: (2022)

Speedability of computably approximable reals and their approximations
by: Barmpalias, George, et al.
Published: (2026)

Indivisibility and uniform computational strength
by: Gill, Kenneth
Published: (2023)

Countability constraints in order-theoretic approaches to computability
by: Hack, Pedro, et al.
Published: (2022)

Strong negation in the theory of computable functionals TCF
by: Köpp, Nils, et al.
Published: (2022)

Rethinking the notion of oracle: A prequel to Lawvere-Tierney topologies for computability theorists
by: Kihara, Takayuki
Published: (2022)

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

Abstract computation over first-order structures. Part IIa: Moschovakis' operator and other non-determinisms
by: Gaßner, Christine
Published: (2025)

Abstract computation over first-order structures. Part IIb: Moschovakis' operator and other non-determinisms
by: Gaßner, Christine
Published: (2025)

Abstract computation over first-order structures. Part I: Deterministic and non-deterministic BSS RAMs
by: Gaßner, Christine
Published: (2025)

Relating homotopy equivalences to conservativity in dependent type theories with computation axioms
by: Spadetto, Matteo
Published: (2023)

Oscillating subalgebras of the atomless countable Boolean algebra
by: Bartošová, Dana, et al.
Published: (2025)