:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Bodirsky, Manuel, Kozik, Marcin, Madelaine, Florent, Martin, Barnaby, Wrona, Michal
Format:	Preprint
Published:	2024
Subjects:	Logic in Computer Science
Online Access:	https://arxiv.org/abs/2408.13840
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The complete classification for quantified equality constraints
by: Zhuk, Dmitriy, et al.
Published: (2021)

Quasi Directed Jonsson Operations Imply Bounded Width (For fo-expansions of symmetric binary cores with free amalgamation)
by: Wrona, Michal
Published: (2024)

Network Satisfaction Problems Solved by k-Consistency
by: Bodirsky, Manuel, et al.
Published: (2023)

Universal Horn Sentences and the Joint Embedding Property
by: Bodirsky, Manuel, et al.
Published: (2021)

On guarded extensions of MMSNP
by: Barsukov, Alexey, et al.
Published: (2023)

Complexity Classification Transfer for CSPs via Algebraic Products
by: Bodirsky, Manuel, et al.
Published: (2022)

The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems
by: Brunar, Johanna, et al.
Published: (2025)

Symmetric Linear Arc Monadic Datalog and Gadget Reductions
by: Bodirsky, Manuel, et al.
Published: (2024)

Wider systems for linear logic with fixed points: proof theory and complexity
by: Das, Anupam, et al.
Published: (2026)

Identifying Tractable Quantified Temporal Constraints within Ord-Horn
by: Rydval, Jakub, et al.
Published: (2024)

Model checking with temporal graphs and their derivative
by: Bui-Xuan, Binh-Minh, et al.
Published: (2026)

Towards the verification of a generic interlocking logic: Dafny meets parameterized model checking
by: Cimatti, Alessandro, et al.
Published: (2024)

Datalog-Expressibility for Monadic and Guarded Second-Order Logic
by: Bodirsky, Manuel, et al.
Published: (2020)

Restricted CSPs and F-free Digraph Algorithmics
by: Guzmán-Pro, Santiago, et al.
Published: (2025)

Unifying the Three Algebraic Approaches to the CSP via Minimal Taylor Algebras
by: Barto, Libor, et al.
Published: (2021)

FO logic on cellular automata orbits equals MSO logic
by: Theyssier, Guillaume
Published: (2024)

Collapsing the bounded width hierarchy for infinite-domain CSPs: when symmetries are enough
by: Mottet, Antoine, et al.
Published: (2021)

Tabular intermediate logics comparison
by: Rzążewski, Paweł, et al.
Published: (2025)

Automating proof search when equality is a logical connective
by: Chaudhuri, Kaustuv, et al.
Published: (2026)

Modelling of logical systems by means of their fragments
by: Rybakov, Mikhail
Published: (2025)

On the logical structure of some maximality and well-foundedness principles equivalent to choice principles
by: Herbelin, Hugo
Published: (2024)

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

On the expressive power of inquisitive team logic and inquisitive first-order logic
by: Kontinen, Juha, et al.
Published: (2026)

A uniform cut-elimination theorem for linear logics with fixed points and super exponentials
by: Bauer, Esaïe, et al.
Published: (2025)

Quantum modal logic
by: Tokuo, Kenji
Published: (2025)

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

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

Model checking strategy-controlled systems in rewriting logic
by: Rubio, Rubén, et al.
Published: (2024)

Structures preserved by primitive actions of $S_ω$
by: Bodirsky, Manuel, et al.
Published: (2025)

Graph Homomorphisms and Universal Algebra
by: Bodirsky, Manuel
Published: (2026)

Intuitionistic modal logics: a minimal setting
by: Balbiani, Philippe, et al.
Published: (2025)

Complexity of the Model Checking problem for inquisitive propositional and modal logic
by: Grilletti, Gianluca, et al.
Published: (2024)

On the logical structure of choice and bar induction principles
by: Brede, Nuria, et al.
Published: (2021)

Tableau methodology for propositional logics
by: Jarmuzek, T., et al.
Published: (2025)

First-order Logic with Being a Thesis Modal Operator
by: Łyczak, Marcin
Published: (2024)

Extended multi-adjoint logic programming
by: Cornejo, M. Eugenia, et al.
Published: (2024)

A logic for default deontic reasoning
by: Piazza, Mario, et al.
Published: (2025)

Modal definability in Euclidean modal logics
by: Balbiani, Philippe, et al.
Published: (2025)

Filling in the semantics for intuitionistic conditional logic
by: Dufty, Brendan, et al.
Published: (2025)

Non-commutative linear logic fragments with sub-context-free complexity
by: Nishimiya, Yusaku, et al.
Published: (2025)