Image de couverture de livre

Relative to any non-arithmetic set

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Harrison-Trainor, Matthew
Format:	Preprint
Publié:	2025
Sujets:	Logic
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Relation on ${(ω, <)}$ of Intermediate Degree Spectrum on a Cone
par: Damaj, Jad, et autres
Publié: (2024)

Characterizing relative decidability in terms of model completeness
par: Harrison-Trainor, Matthew, et autres
Publié: (2026)

Measuring the complexity of characterizing $[0, 1]$, $S^1$, and $\mathbb{R}$ up to homeomorphism
par: Harrison-Trainor, Matthew, et autres
Publié: (2024)

Scott Spectral Gaps are Bounded for Linear Orderings
par: Gonzalez, David, et autres
Publié: (2024)

Scott spectral gaps for trees are bounded
par: Harrison-Trainor, Matthew, et autres
Publié: (2026)

Computable learning of natural hypothesis classes
par: Harrison-Trainor, Matthew, et autres
Publié: (2024)

Back-and-forth equivalent group von Neumann algebras
par: Goldbring, Isaac, et autres
Publié: (2024)

Optimal Syntactic Definitions of Back-and-Forth Types
par: Chen, Ruiyuan, et autres
Publié: (2025)

On the computability of optimal Scott sentences
par: Alvir, Rachael, et autres
Publié: (2025)

The Logic of Cardinality Comparison Without the Axiom of Choice
par: Harrison-Trainor, Matthew, et autres
Publié: (2022)

Scott analysis, linear orders and almost periodic functions
par: Gonzalez, David, et autres
Publié: (2024)

Definable sets in Skolem arithmetic
par: Kamiński, Łukasz
Publié: (2025)

Iterated Priority Arguments in Descriptive Set Theory
par: Day, Adam, et autres
Publié: (2022)

Infinitary Logic Has No Expressive Efficiency Over Finitary Logic
par: Harrison-Trainor, Matthew, et autres
Publié: (2022)

A non-sequential arithmetical theory with pairing
par: Murwanashyaka, Juvenal
Publié: (2025)

Every countable model of arithmetic or set theory has a pointwise-definable end extension
par: Hamkins, Joel David
Publié: (2022)

On matrix rank function over bounded arithmetics
par: Ken, Eitetsu, et autres
Publié: (2023)

On Presburger arithmetic extended with non-unary counting quantifiers
par: Habermehl, Peter, et autres
Publié: (2022)

Axiomatization of Büchi arithmetic
par: Kovalyov, Konstantin
Publié: (2024)

Two results on complexities of decision problems of groups
par: Andrews, Uri, et autres
Publié: (2024)

Graphings of arithmetical equivalence relations
par: Arant, Tyler
Publié: (2025)

Iterating reflection over intuitionistic arithmetic
par: Frittaion, Emanuele
Publié: (2024)

Finite sets, mappings, cardinals, and arithmetic in intuitionistic NF
par: Beeson, Michael
Publié: (2021)

The modal logic of arithmetic potentialism and the universal algorithm
par: Hamkins, Joel David
Publié: (2018)

Searching problems above arithmetical transfinite recursion
par: Suzuki, Yudai, et autres
Publié: (2023)

There are more non-Cantorian sets than are Cantorian
par: Al-Johar, Zuhair
Publié: (2025)

A closed subset of Baire space not Medvedev equivalent to any closed set of Cantor space
par: Cole, Joshua
Publié: (2024)

An efficient quantifier elimination procedure for Presburger arithmetic
par: Haase, Christoph, et autres
Publié: (2024)

Analysis of logics with arithmetic
par: Benedikt, Michael, et autres
Publié: (2025)

Completeness theorems for modal logic in second-order arithmetic
par: Shimomichi, Sho, et autres
Publié: (2025)

Pathwise-random trees and models of second-order arithmetic
par: Barmpalias, George, et autres
Publié: (2021)

On the representation of C-recursive integer sequences by arithmetic terms
par: Prunescu, Mihai, et autres
Publié: (2024)

Quasi-Polish spaces and spaces of filters in second-order arithmetic
par: Kaneko, Yuzuki, et autres
Publié: (2026)

Higher-order generalizations of stability and arithmetic regularity
par: Terry, C., et autres
Publié: (2021)

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

Models of true arithmetic are integer parts of nice real closed fields
par: Carl, Merlin
Publié: (2013)

Higher arithmetic on the ordinals
par: Ducourtial, Adrian
Publié: (2025)

The complexity of Presburger arithmetic with power or powers
par: Benedikt, Michael, et autres
Publié: (2023)

The automorphism group of countable recursively saturated models of Peano arithmetic and strong cuts
par: Bahrami, Saeideh
Publié: (2026)

Low-like basis theorems for Ramsey's theorem for pairs in first-order arithmetic
par: Ikari, Hiroyuki, et autres
Publié: (2026)