Finite Satisfiability of the Two-Variable Guarded Fragment with Transitive Guards and Related Variants

DOI10.1145/3174805zbMath1407.03009arXiv1611.03267OpenAlexW2571435091MaRDI QIDQ4608732

Emanuel Kieroński, Lidia Tendera

Publication date: 22 March 2018

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

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

zbMATH Keywords

computational complexityguarded fragmenttransitive relationequivalence relationtwo-variable logicfinite satisfiability problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Model theory of finite structures (03C13)

Related Items (3)

The fluted fragment with transitive relations ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Finite Satisfiability of the Two-Variable Guarded Fragment with Transitive Guards and Related Variants