Two-Variable First-Order Logic with Equivalence Closure

DOI10.1109/LICS.2012.53zbMath1362.68107OpenAlexW2008070102MaRDI QIDQ5892437

Lidia Tendera, Ian Pratt-Hartmann, Emanuel Kieroński, Jakub Michaliszyn

Publication date: 16 May 2017

Published in: 2012 27th Annual IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/lics.2012.53

zbMATH Keywords

computational complexitydecidability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items

On the Decidability of Elementary Modal Logics ⋮ Two-Variable Logic with Counting and Trees ⋮ A double team semantics for generalized quantifiers ⋮ Metric propositional neighborhood logic with an equivalence relation ⋮ Two-Variable Separation Logic and Its Inner Circle ⋮ Regular Graphs and the Spectra of Two-Variable Logic with Counting