:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Otte, Pim
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science Combinatorics
Online Access:	https://arxiv.org/abs/2504.18146
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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)

Indivisibility and uniform computational strength
by: Gill, Kenneth
Published: (2023)

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)

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

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

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

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

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)

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

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

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

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

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

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

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

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

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

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

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

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

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

A formalization of the Gelfond-Schneider theorem
by: Karatarakis, Michail, et al.
Published: (2026)

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)

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

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

Towards solid abelian groups: A formal proof of Nöbeling's theorem
by: Asgeirsson, Dagur
Published: (2023)

CNFs and DNFs with Exactly $k$ Solutions
by: Chandran, L. Sunil, et al.
Published: (2025)

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)

On merge-models
by: Buffière, Hector, et al.
Published: (2026)

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

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

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

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