On Finite Satisfiability of the Guarded Fragment with Equivalence or Transitive Guards

DOI10.1007/978-3-540-75560-9_24zbMath1137.03316OpenAlexW1498542449MaRDI QIDQ3498476

Emanuel Kieroński, Lidia Tendera

Publication date: 15 May 2008

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75560-9_24

Mathematics Subject Classification ID

Logic in computer science (03B70) Model theory of finite structures (03C13)

Related Items (1)

Small substructures and decidability issues for first-order logic with two variables

This page was built for publication: On Finite Satisfiability of the Guarded Fragment with Equivalence or Transitive Guards