Cover Image

Computable Scott Sentences and the Friedman-Stanley embedding

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gonzalez, David, Knight, Julia
Format:	Preprint
Published:	2026
Subjects:	Logic
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

Friedman's $ \mathsf{WD} $ is not parameter-free sequential
by: Murwanashyaka, Juvenal
Published: (2025)

The finite Friedman-Stanley jumps: generic dichotomies for Borel homomorphisms
by: Shani, Assaf
Published: (2024)

A Friedman--Sheard-style Theory for Classical Realisability
by: Hayashi, Daichi, et al.
Published: (2025)

Universal Horn Sentences and the Joint Embedding Property
by: Bodirsky, Manuel, et al.
Published: (2021)

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

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

Torsion-free abelian groups of finite rank and fields of finite transcendence degree
by: Ho, Meng-Che "Turbo", et al.
Published: (2024)

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

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

The uniqueness of elementary embeddings
by: Goldberg, Gabriel
Published: (2021)

On Friedman's Property
by: Jakob, Hannes
Published: (2024)

Generically Computable Linear Orderings
by: Calvert, Wesley, et al.
Published: (2024)

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

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

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

Self-embeddings of models of arithmetic; fixed points, small submodels, and extendability
by: Bahrami, Saeideh
Published: (2022)

An order-reversing embedding of Turing degrees into Arthur-Nimue-Merlin degrees
by: Samra, Jean Abou, et al.
Published: (2026)

Bridging Computational Notions of Depth
by: Bienvenu, Laurent, et al.
Published: (2024)

Bass modules and embeddings into free modules
by: Pillay, Anand, et al.
Published: (2025)

Dynamic Probability Logic: Decidability & Computability
by: Chopoghloo, Somayeh, et al.
Published: (2024)

Fixed Point Theorems in Computability Theory
by: Terwijn, Sebastiaan A.
Published: (2024)

Computing with Infinite Objects: the Gray Code Case
by: Spreen, Dieter, et al.
Published: (2021)

Meta-Mathematics of Computational Complexity Theory
by: Oliveira, Igor C.
Published: (2025)

Computable presentations of randomizations
by: Ovalle, Nicolás Cuervo, et al.
Published: (2025)

Cardinal Characteristics and Computability
by: McDonald, Logan
Published: (2025)

Computability of dimension groups
by: Sabitova, Maria
Published: (2025)

Sentences over Random Groups I: Existential Sentences
by: Massalha, Sobhi
Published: (2024)

Opinion Update in a Subjective Logic Model for Social Networks
by: Alvim, Mário S., et al.
Published: (2024)

A dual characterisation of simple and subdirectly-irreducible temporal Heyting algebras
by: Alvarez, David Quinn
Published: (2025)

Strong Projective Witnesses
by: Fischer, Vera, et al.
Published: (2026)

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

Coanalytic families of functions
by: Millhouse, Julia, et al.
Published: (2025)

Sentences over Random Groups II: Sentences of Minimal Rank
by: Massalha, Sobhi
Published: (2024)

Computable classifications of continuous, transducer, and regular functions
by: Franklin, Johanna N. Y., et al.
Published: (2020)

Computably totally disconnected locally compact groups
by: Melnikov, Alexander, et al.
Published: (2022)

Hybrid Maximal Filter Spaces
by: Gonzalez, David
Published: (2024)

Did Turing prove the undecidability of the halting problem?
by: Hamkins, Joel David, et al.
Published: (2024)