On the satisfiability problem for fragments of two-variable logic with one transitive relation

DOI10.1093/logcom/exz012zbMath1444.03011arXiv1804.09447OpenAlexW2964843467MaRDI QIDQ5212557

Lidia Tendera, Wiesław Szwast

Publication date: 29 January 2020

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.09447

zbMATH Keywords

computational complexitydecidabilitytransitivitysatisfiability problemtwo-variable first-order logic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (2)

The fluted fragment with transitive relations ⋮ The Fluted Fragment with Transitivity

This page was built for publication: On the satisfiability problem for fragments of two-variable logic with one transitive relation