:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Schindling, Georg
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science Discrete Mathematics 03C13 F.4.1; G.2.2
Online Access:	https://arxiv.org/abs/2506.19746
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the Computational Power of Extensional ESO
by: Bodirsky, Manuel, et al.
Published: (2025)

Hereditary First-Order Logic: the tractable quantifier prefix classes
by: Bodirsky, Manuel, et al.
Published: (2024)

Notes on CSPs and Polymorphisms
by: Brady, Zarathustra
Published: (2022)

On the Descriptive Complexity of Groups without Abelian Normal Subgroups
by: Grochow, Joshua A., et al.
Published: (2022)

Extension property for partial automorphisms of the $n$-partite and semigeneric tournaments
by: Hubička, Jan, et al.
Published: (2024)

Forbidden cycles in metrically homogeneous graphs
by: Hubička, Jan, et al.
Published: (2018)

Hardness of busy beaver value BB(15)
by: Stérin, Tristan, et al.
Published: (2021)

Three Fixed-Dimension Satisfiability Semantics for Quantum Logic: Implications and an Explicit Separator
by: Higuchi, Joaquim Reizi
Published: (2026)

Complexity Results in Team Semantics: Nonemptiness Is Not So Complex
by: Anttila, Aleksi, et al.
Published: (2025)

GMSNP and Finite Structures
by: Guzmán-Pro, Santiago
Published: (2024)

Local-Order-Invariant Logic on Classes of Bounded Degree
by: Aoki, Derek
Published: (2025)

Conjunctive categorial grammars and Lambek grammars with additives
by: Kuznetsov, Stepan L., et al.
Published: (2024)

Ramsey expansions of metrically homogeneous graphs
by: Aranda, Andrés, et al.
Published: (2017)

The Fluted Fragment with Transitive Relations
by: Pratt-Hartmann, Ian, et al.
Published: (2020)

Deducibility in the full Lambek calculus with weakening is HAck-complete
by: Greati, Vitor, et al.
Published: (2024)

Hypersequent Calculi Have Ackermannian Complexity
by: Balasubramanian, A. R., et al.
Published: (2026)

Big Ramsey degrees using parameter spaces
by: Hubička, Jan
Published: (2020)

Unravelling Abstract Cyclic Proofs into Proofs by Induction
by: Grotenhuis, Lide, et al.
Published: (2026)

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought?
by: Bannach, Max, et al.
Published: (2025)

On Groupoids and Hypergraphs
by: Otto, Martin
Published: (2012)

Measuring well quasi-ordered finitary powersets
by: Abriola, Sergio, et al.
Published: (2023)

Weisfeiler-Leman on graphs of small twin-width
by: Heinrich, Irene, et al.
Published: (2026)

First Order Logic and Twin-Width in Tournaments and Dense Oriented Graphs
by: Geniet, Colin, et al.
Published: (2022)

Formally Verifying the Safety of Pipelined Moonshot Consensus Protocol
by: Praveen, M., et al.
Published: (2024)

A convergence law for continuous logic and continuous structures with finite domains
by: Koponen, Vera
Published: (2025)

On the Satisfaction Probabilities of $k$-CNF Formulas
by: Tantau, Till
Published: (2022)

A Proof-Theoretic Approach to the Semantics of Classical Linear Logic
by: Barroso-Nascimento, Victor, et al.
Published: (2025)

Preservation Theorems Through the Lens of Topology
by: Lopez, Aliaume
Published: (2020)

Network Abstractions for Characterizing Communication Requirements in Asynchronous Distributed Systems
by: Galeana, Hugo Rincon, et al.
Published: (2023)

Characterisation of the big Ramsey degrees of the generic partial order
by: Balko, Martin, et al.
Published: (2023)

A New Ehrenfeucht-Fraïssé Game for Dependence Logic
by: Puljujärvi, Joni, et al.
Published: (2026)

Complexities of Well-Quasi-Ordered Substructural Logics
by: Galatos, Nikolaos, et al.
Published: (2025)

Finite Hilbert systems for Weak Kleene logics
by: Greati, Vitor, et al.
Published: (2024)

Axiomatizing the Logic of Ordinary Discourse
by: Greati, Vitor, et al.
Published: (2024)

Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs
by: de Rezende, Susanna F., et al.
Published: (2019)

When do homomorphism counts help in query algorithms?
by: Cate, Balder ten, et al.
Published: (2023)

Constant time testability of first-order logic with modulo counting on finitary graphs
by: Adler, Isolde, et al.
Published: (2026)

A Complexity Dichotomy in Spatial Reasoning via Ramsey Theory
by: Bodirsky, Manuel, et al.
Published: (2020)

Flip-width: Cops and Robber on dense graphs
by: Toruńczyk, Szymon
Published: (2023)

Thoughts on sub-Turing interactive computability
by: Japaridze, Giorgi
Published: (2024)