Imagen de Portada

Additive systems for $\mathbb{Z}$ are undecidable

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Zabolotskii, Andrei
Formato:	Preprint
Publicado:	2025
Materias:	Combinatorics Logic in Computer Science
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Local structure of idempotent algebras II
por: Bulatov, Andrei A.
Publicado: (2020)

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

Decomposing graphs into stable and ordered parts
por: Buffière, Hector, et al.
Publicado: (2025)

Monadic Second-Order Logic of Permutations
por: Jelínek, Vít, et al.
Publicado: (2025)

Indivisibility and uniform computational strength
por: Gill, Kenneth
Publicado: (2023)

Decidability for Sturmian words
por: Hieronymi, Philipp, et al.
Publicado: (2021)

More on the indivisibility of $\mathbb{Q}$
por: Pauly, Arno
Publicado: (2024)

Kleene algebra with commutativity conditions is undecidable
por: de Amorim, Arthur Azevedo, et al.
Publicado: (2024)

A very sharp threshold for first order logic distinguishability of random graphs
por: Benjamini, Itai, et al.
Publicado: (2022)

Tutte's theorem as an educational formalization project
por: Otte, Pim
Publicado: (2025)

Convergence Laws for Extensions of First-Order Logic with Averaging
por: Adam-Day, Sam, et al.
Publicado: (2025)

Further Comments on Yablo's Construction
por: Schlechta, Karl
Publicado: (2025)

Transductions of Graph Classes Admitting Product Structure
por: Hliněný, Petr, et al.
Publicado: (2025)

Composition Direction of Seymour's Theorem for Regular Matroids -- Formally Verified
por: Dvorak, Martin, et al.
Publicado: (2025)

Two variable logic with ultimately periodic counting
por: Benedikt, Michael, et al.
Publicado: (2020)

On Planarity of Graphs in Homotopy Type Theory
por: Prieto-Cubides, Jonathan, et al.
Publicado: (2021)

Bijections between planar maps and planar linear normal $λ$-terms with connectivity condition
por: Fang, Wenjie
Publicado: (2022)

A Formal Proof of R(4,5)=25
por: Gauthier, Thibault, et al.
Publicado: (2024)

Separability Properties of Monadically Dependent Graph Classes
por: Bonnet, Édouard, et al.
Publicado: (2025)

Epsilon-saturation for stable graphs and Littlestone classes
por: Malliaris, Maryanthe, et al.
Publicado: (2025)

Forbidden Induced Subgraphs for Bounded Shrub-Depth and the Expressive Power of MSO
por: Mählmann, Nikolas
Publicado: (2025)

Advances in Algorithmic Meta Theorems
por: Siebertz, Sebastian, et al.
Publicado: (2024)

Existential Positive Transductions of Sparse Graphs
por: Mählmann, Nikolas, et al.
Publicado: (2026)

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

Decomposition horizons and a characterization of stable hereditary classes of graphs
por: Braunfeld, Samuel, et al.
Publicado: (2022)

On first-order transductions of classes of graphs
por: Braunfeld, Samuel, et al.
Publicado: (2022)

Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes
por: Dreier, Jan, et al.
Publicado: (2024)

Undecidability of Polynomial Inequalities in Subset Densities and Additive Energies
por: Li, Yaqiao
Publicado: (2025)

First order complexity of finite random structures
por: Demin, Danila, et al.
Publicado: (2024)

k-Planar and Fan-Crossing Drawings and Transductions of Embeddable Graphs
por: Hliněný, Petr, et al.
Publicado: (2025)

Happy Ending: An Empty Hexagon in Every Set of 30 Points
por: Heule, Marijn J. H., et al.
Publicado: (2024)

Wildest $\mathrm{SL}_2$-tilings
por: Zabolotskii, Andrei
Publicado: (2025)

The unstable formula theorem revisited via algorithms
por: Malliaris, Maryanthe, et al.
Publicado: (2022)

Agnostic Online Learning and Excellent Sets
por: Malliaris, Maryanthe, et al.
Publicado: (2021)

The domino problem is decidable for robust tilesets
por: Aubrun, Nathalie, et al.
Publicado: (2024)

Enumerating tame friezes over $\mathbb{Z}/n\mathbb{Z}$
por: Benzaira, Sammy, et al.
Publicado: (2024)

On Godel's treatment of the undecidable in 1931
por: Cattabriga, Paola
Publicado: (2024)

First-order transducibility among classes of sparse graphs
por: Gajarský, Jakub, et al.
Publicado: (2025)

An order-theoretic circuit syntax and characterisation of the concept lattice
por: van der Lugt, Tein
Publicado: (2025)

North-East Lattice Paths Avoiding $k$ Collinear Points via Satisfiability
por: Barnoff, Aaron, et al.
Publicado: (2025)