Imagen de Portada

Optimal Syntactic Definitions of Back-and-Forth Types

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Chen, Ruiyuan, Gonzalez, David, Harrison-Trainor, Matthew
Formato:	Preprint
Publicado:	2025
Materias:	Logic
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Scott Spectral Gaps are Bounded for Linear Orderings
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)

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

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

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

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

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

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

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

Unifying Sequent Systems for Gödel-Löb Provability Logic via Syntactic Transformations
por: Lyon, Tim S.
Publicado: (2024)

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

Normalisation for Negative Free Logics without and with Definite Descriptions
por: Kürbis, Nils
Publicado: (2024)

Syntactic Effectful Realizability in Higher-Order Logic
por: Cohen, Liron, et al.
Publicado: (2025)

Structurable equivalence relations and $\mathcal{L}_{ω_1ω}$ interpretations
por: Banerjee, Rishi, et al.
Publicado: (2024)

A Syntactic Approach to Computing Complete and Sound Abstraction in the Situation Calculus
por: Fang, Liangda, et al.
Publicado: (2024)

A Cut-free, Sound and Complete Russellian Theory of Definite Descriptions
por: Indrzejczak, Andrzej, et al.
Publicado: (2024)

On Syntactical Simplification of Temporal Operators in Negation-free MTL
por: van Noort, Mathijs, et al.
Publicado: (2025)

Componentwise Polish groupoids and equivalence relations
por: Chen, Ruiyuan
Publicado: (2025)

Decidability in First-Order Modal Logic with Non-Rigid Constants and Definite Descriptions
por: Artale, Alessandro, et al.
Publicado: (2025)

Definiteness properties of first-order schemes
por: Gruza, Piotr, et al.
Publicado: (2025)

Hilbert spaces admit no finitary discrete imaginaries
por: Chen, Ruiyuan, et al.
Publicado: (2025)

Normal Nested Answer Set Programs: Syntactics, Semantics and Logical Calculi
por: Imaz, Gonzalo E.
Publicado: (2024)

Syntactic Cut-Elimination for Provability Logic GL via Nested Sequents
por: Maniwa, Akinori, et al.
Publicado: (2024)

A universal characterization of standard Borel spaces
por: Chen, Ruiyuan
Publicado: (2019)

Definite Descriptions and Hybrid Tense Logic
por: Indrzejczak, Andrzej, et al.
Publicado: (2024)

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

On Small Types in Univalent Foundations
por: de Jong, Tom, et al.
Publicado: (2021)

A Gelfand duality for continuous lattices
por: Chen, Ruiyuan
Publicado: (2023)

Structural, point-free, non-Hausdorff topological realization of Borel groupoid actions
por: Chen, Ruiyuan
Publicado: (2022)

Hybrid Modal Operators for Definite Descriptions
por: Wałęga, Przemysław Andrzej, et al.
Publicado: (2024)

Primitive Recursive Dependent Type Theory
por: Buchholtz, Ulrik, et al.
Publicado: (2024)

Basis-Sensitive Quantum Typing via Realisability
por: Díaz-Caro, Alejandro, et al.
Publicado: (2025)

An Analysis of Tennenbaum's Theorem in Constructive Type Theory
por: Hermes, Marc, et al.
Publicado: (2023)

A Naive Encoding of Russell's Paradox in Type Theory
por: Qu, Zhuoyuan
Publicado: (2025)

Non-Derivability Results in Polymorphic Dependent Type Theory
por: Geuvers, Herman
Publicado: (2026)

Clones of Borel Boolean Functions
por: Chen, Ruiyuan, et al.
Publicado: (2024)