Finite Satisfiability for Guarded Fixpoint Logic
Logic in Computer Science
2012-02-10 v3 Logic
Abstract
The finite satisfiability problem for guarded fixpoint logic is decidable and complete for 2ExpTime (resp. ExpTime for formulas of bounded width).
Cite
@article{arxiv.1104.2262,
title = {Finite Satisfiability for Guarded Fixpoint Logic},
author = {Vince Bárány and Mikołaj Bojańczyk},
journal= {arXiv preprint arXiv:1104.2262},
year = {2012}
}
Related papers
View all related →
Logic in Computer Science · Computer Science
Finite Model Theory of the Triguarded Fragment and Related Logics
Emanuel Kieroński, Sebastian Rudolph
2021-01-26
Logic in Computer Science · Computer Science
Adding Path-Functional Dependencies to the Guarded Two-Variable Fragment with Counting
Georgios Kourtis, Ian Pratt-Hartmann
2023-06-22
Logic in Computer Science · Computer Science
Complexity of the Guarded Two-Variable Fragment with Counting Quantifiers
Ian Pratt-Hartmann
2024-04-19
Logic in Computer Science · Computer Science
The Finite Satisfiability Problem for Two-Variable, First-Order Logic with one Transitive Relation is Decidable
Ian Pratt-Hartmann
2024-04-24
Logic in Computer Science · Computer Science
Guarded Negation Transitive Closure Logic
Diego Figueira, Santiago Figueira, Yoshiki Nakamura
2026-05-20
Logic in Computer Science · Computer Science
Two-Variable Logic with Two Order Relations
Thomas Schwentick, Thomas Zeume
2015-07-01
Logic in Computer Science · Computer Science
Satisfiability for two-variable logic with two successor relations on finite linear orders
Diego Figueira
2015-03-20
Logic in Computer Science · Computer Science
On the satisfiability problem for fragments of the two-variable logic with one transitive relation
Wiesław Szwast, Lidia Tendera
2019-04-10
Logic in Computer Science · Computer Science
Finite Satisfiability of the Two-Variable Guarded Fragment with Transitive Guards and Related Variants
Emanuel Kieronski, Lidia Tendera
2024-04-08
Logic in Computer Science · Computer Science
Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics
Lauri Hella, Antti Kuusisto, Arne Meier, Heribert Vollmer
2017-10-17
Logic in Computer Science · Computer Science
Definability and Interpolation within Decidable Fixpoint Logics
Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
2023-06-22
Logic in Computer Science · Computer Science
Finite Satisfiability of Unary Negation Fragment with Transitivity
Daniel Danielski, Emanuel Kieronski
2019-07-01
Logic in Computer Science · Computer Science
On the Limits of Decision: the Adjacent Fragment of First-Order Logic
Bartosz Bednarczyk, Daumantas Kojelis, Ian Pratt-Hartmann
2023-06-19
Logic in Computer Science · Computer Science
Guarded Fragments Meet Dynamic Logic: The Story of Regular Guards (Extended Version)
Bartosz Bednarczyk, Emanuel Kieroński
2025-09-12
Logic in Computer Science · Computer Science
Complexity of two-variable Dependence Logic and IF-Logic
Juha Kontinen, Antti Kuusisto, Peter Lohmann, Jonni Virtema
2011-04-19
Logic in Computer Science · Computer Science
Conservative Extensions in Guarded and Two-Variable Fragments
Jean Christoph Jung, Carsten Lutz, Mauricio Martel, Thomas Schneider +1
2017-05-30
Logic in Computer Science · Computer Science
The Adjacent Fragment and Quine's Limits of Decision
Bartosz Bednarczyk, Daumantas Kojelis, Ian Pratt-Hartmann
2024-09-04
Logic in Computer Science · Computer Science
Two-variable Logic with Counting and a Linear Order
Witold Charatonik, Piotr Witkowski
2019-03-14
Logic in Computer Science · Computer Science
Finite LTL Synthesis is EXPTIME-complete
Jorge A. Baier, Alberto Camacho, Christian Muise, Sheila A. McIlraith
2016-11-18
Logic in Computer Science · Computer Science
A Short Note on Two-Variable Logic with a Linear Order Successor and a Preorder Successor
Amaldev Manuel, Thomas Schwentick, Thomas Zeume
2013-06-17
Computational Complexity · Computer Science
How hard is it to verify flat affine counter systems with the finite monoid property ?
Radu Iosif, Arnaud Sangnier
2016-05-20
Logic in Computer Science · Computer Science
A Definability Dichotomy for Finite Valued CSPs
Anuj Dawar, Pengming Wang
2015-04-15
Logic in Computer Science · Computer Science
Two-Variable Logic for Hierarchically Partitioned and Ordered Data
Oskar Fiuk, Emanuel Kieronski, Vincent Michielini
2025-12-11
Logic in Computer Science · Computer Science
Bounded Reachability for Temporal Logic over Constraint Systems
Marcello M. Bersani, Achille Frigeri, Angelo Morzenti, Matteo Pradella +2
2010-04-21
Logic in Computer Science · Computer Science
Satisfiability of the Two-Variable Fragment of First-Order Logic over Trees
Witold Charatonik, Emanuel Kieroński, Filip Mazowiecki
2014-10-22