Equivalence closure in the two-variable guarded fragment

DOI10.1093/LOGCOM/EXV075MaRDI QIDQ3133154zbMATH OpenOpenAlexFDO

Authors Emanuel Kieroński, Ian Pratt-Hartmann, Lidia Tendera

Publication date 13 February 2018

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1093/logcom/exv075

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Model theory of finite structures (03C13) Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70)

Recommendations

• Computer Science Logic
• Conservative extensions in guarded and two-variable fragments
• On the complexity of the two-variable guarded fragment with transitive guards
• On Finite Satisfiability of the Guarded Fragment with Equivalence or Transitive Guards
• Finite satisfiability of the two-variable guarded fragment with transitive guards and related variants
• Decidability of the Guarded Fragment with the Transitive Closure
• Complexity of the Guarded Two-variable Fragment with Counting Quantifiers
• scientific article; zbMATH DE number 2086420
• Two-variable first-order logic with equivalence closure
• Two-variable first-order logic with equivalence closure

Cited in

(5)

• Finite satisfiability of the two-variable guarded fragment with transitive guards and related variants
• Living without Beth and Craig: Definitions and Interpolants in Description and Modal Logics with Nominals and Role Inclusions
• Two-variable first-order logic with equivalence closure
• Two-variable first-order logic with equivalence closure
• Computer Science Logic

This page was built for publication: Equivalence closure in the two-variable guarded fragment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3133154)