Cover Image

Indivisibility and uniform computational strength

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Gill, Kenneth
Format:	Preprint
Published:	2023
Subjects:	Logic Logic in Computer Science Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

Decidability for Sturmian words
by: Hieronymi, Philipp, et al.
Published: (2021)

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

Advances in Algorithmic Meta Theorems
by: Siebertz, Sebastian, et al.
Published: (2024)

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

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

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

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

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

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

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

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

The strength of Ramsey Theorem for coloring relatively large sets
by: Carlucci, Lorenzo, et al.
Published: (2012)

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

The strength of the dominance rule
by: Kołodziejczyk, Leszek Aleksander, et al.
Published: (2024)

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

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

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

Further Comments on Yablo's Construction
by: Schlechta, Karl
Published: (2025)

Local structure of idempotent algebras II
by: Bulatov, Andrei A.
Published: (2020)

Additive systems for $\mathbb{Z}$ are undecidable
by: Zabolotskii, Andrei
Published: (2025)

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

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

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

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

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

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

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

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

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)

On P=NP Either False or Independent of ZFC
by: Williamson, S Gill
Published: (2024)

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)

New bounds on the strength of some restrictions of Hindman's Theorem
by: Carlucci, Lorenzo, et al.
Published: (2017)

Finite combinatorics and computability theory
by: Dzhafarov, Damir D., et al.
Published: (2026)

Flipper games for monadically stable graph classes
by: Gajarský, Jakub, et al.
Published: (2023)

Elementary first-order model checking for sparse graphs
by: Gajarský, Jakub, et al.
Published: (2024)

On the cartesian product of well-orderings
by: Vialard, Isa
Published: (2022)