Image de couverture de livre

Learning Foundations Beneath the Stars

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Cardone, Felice, Paolini, Luca
Format:	Preprint
Publié:	2026
Sujets:	Logic in Computer Science Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Note on Constructive Canonical Splitter Strategies in Nowhere Dense Graph Classes
par: Fuchser, Janne, et autres
Publié: (2025)

Nested Sequents for Intuitionistic Grammar Logics via Structural Refinement
par: Lyon, Tim S.
Publié: (2022)

Logic-based analogical proportions
par: Antić, Christian
Publié: (2024)

Foundations for an Abstract Proof Theory in the Context of Horn Rules
par: Lyon, Tim S., et autres
Publié: (2023)

Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth
par: Adler, Isolde, et autres
Publié: (2025)

Existential Positive Transductions of Sparse Graphs
par: Mählmann, Nikolas, et autres
Publié: (2026)

Characterizations of monadically dependent tree-ordered weakly sparse structures
par: Buffière, Hector, et autres
Publié: (2026)

Advances in Algorithmic Meta Theorems
par: Siebertz, Sebastian, et autres
Publié: (2024)

Separability Properties of Monadically Dependent Graph Classes
par: Bonnet, Édouard, et autres
Publié: (2025)

Decomposition horizons and a characterization of stable hereditary classes of graphs
par: Braunfeld, Samuel, et autres
Publié: (2022)

Epsilon-saturation for stable graphs and Littlestone classes
par: Malliaris, Maryanthe, et autres
Publié: (2025)

On first-order transductions of classes of graphs
par: Braunfeld, Samuel, et autres
Publié: (2022)

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

Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes
par: Dreier, Jan, et autres
Publié: (2024)

On the Subspace Orbit Problem and the Simultaneous Skolem Problem
par: Bacik, Piotr, et autres
Publié: (2026)

Efficient reversal of transductions of sparse graph classes
par: Dreier, Jan, et autres
Publié: (2026)

Home Spaces and Invariants to Analyze Parameterized Petri Nets
par: Memmi, Gerard
Publié: (2024)

SAT-Solving the Poset Cover Problem
par: Yuan, Chih-Cheng Rex, et autres
Publié: (2025)

Continuous Petri Nets Faithfully Fluidify Most Permissive Boolean Networks
par: Haar, Stefan, et autres
Publié: (2025)

Verifying Sampling Algorithms via Distributional Invariants
par: Zilken, Daniel, et autres
Publié: (2025)

On the number of asynchronous attractors in AND-NOT Boolean networks
par: Trinh, Van-Giang, et autres
Publié: (2025)

Hypergraph rewriting and Causal structure of $λ-$calculus
par: Bajaj, Utkarsh
Publié: (2024)

Incremental SAT-Based Enumeration of Solutions to the Yang-Baxter Equation
par: Van Caudenberg, Daimy, et autres
Publié: (2025)

Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes
par: Dreier, Jan
Publié: (2021)

Agnostic Online Learning and Excellent Sets
par: Malliaris, Maryanthe, et autres
Publié: (2021)

Analogical proportions II
par: Antić, Christian
Publié: (2024)

First order complexity of finite random structures
par: Demin, Danila, et autres
Publié: (2024)

Distinguishing Graphs by Counting Homomorphisms from Sparse Graphs
par: Neuen, Daniel, et autres
Publié: (2026)

Super-linear Lower Bounds for CSP Non-Redundancy via Shrinking Instances
par: Brakensiek, Joshua, et autres
Publié: (2026)

Transducing Linear Decompositions of Tournaments
par: Geniet, Colin, et autres
Publié: (2026)

First-order transducibility among classes of sparse graphs
par: Gajarský, Jakub, et autres
Publié: (2025)

First order distinguishability of sparse random graphs
par: Hershko, Tal, et autres
Publié: (2024)

Twin-width and permutations
par: Bonnet, Édouard, et autres
Publié: (2021)

An Upper Bound on the Weisfeiler-Leman Dimension
par: Schneider, Thomas, et autres
Publié: (2024)

North-East Lattice Paths Avoiding $k$ Collinear Points via Satisfiability
par: Barnoff, Aaron, et autres
Publié: (2025)

On the generalized coloring numbers
par: Siebertz, Sebastian
Publié: (2025)

3D-grids are not transducible from planar graphs
par: Gajarský, Jakub, et autres
Publié: (2025)

First-order logic axiomatization of metric graph theory
par: Chalopin, Jérémie, et autres
Publié: (2022)

First-Order Logic and Twin-Width for Some Geometric Graphs
par: Geniet, Colin, et autres
Publié: (2025)

Some remarks on the uncolored versions of the original CFI-graphs
par: Chen, Yijia, et autres
Publié: (2025)