On the complexity of the two-variable guarded fragment with transitive guards
type: Item
instance of: scholarly article
title: On the complexity of the two-variable guarded fragment with transitive guards
zbMATH Open document ID: 1115.03021
author: Emanuel Kieroński
published in: Information and Computation
publication date: 2007-01-22T00:00:00Z
Mathematics Subject Classification ID: 03B70
Mathematics Subject Classification ID: 03B44
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 03B10
Mathematics Subject Classification ID: 03B45
zbMATH DE Number: 5117643
zbMATH Keywords: guarded fragment
zbMATH Keywords: transitivity
zbMATH Keywords: computational complexity
zbMATH Keywords: first-order logic
zbMATH Keywords: satisfiability
MaRDI profile type: Publication
full work available at URL: j.ic.2006.08.001
OpenAlex ID: W4256671182
cites work: Modal languages and bounded fragments of predicate logic
cites work: Q3996675
cites work: Alternation
cites work: Tableaux and algorithms for Propositional Dynamic Logic with Converse
cites work: On the Restraining Power of Guards
cites work: On the Decision Problem for Two-Variable First-Order Logic
cites work: Q4736875
cites work: Q4417866
cites work: Computer Science Logic
cites work: Results on the propositional \(\mu\)-calculus
cites work: Complexity results for classes of quantificational formulas
cites work: On languages with two variables
cites work: Decidability of Second-Order Theories and Automata on Infinite Trees
cites work: The guarded fragment with transitive guards
cites work: On the Finite Satisfiability Problem for the Guarded Fragment with Transitivity
cites work: Q4353561
cites work: Q4219045
DOI: 10.1016/J.IC.2006.08.001
description: scientific article; zbMATH DE number 5117643