Complexity and Expressivity of Uniform One-Dimensional Fragment with Equality

DOI10.1007/978-3-662-44522-8_31zbMath1426.03015arXiv1409.0731OpenAlexW313985849MaRDI QIDQ2922030

Antti Kuusisto, Emanuel Kieroński

Publication date: 14 October 2014

Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)

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

zbMATH Keywords

complexityexpressivitytwo-variable logics

Mathematics Subject Classification ID

Logic in computer science (03B70) Decidability of theories and sets of sentences (03B25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (4)

Uniform guarded fragments ⋮ Unnamed Item ⋮ One-Dimensional Logic over Trees ⋮ Existential second-order logic and modal logic with quantified accessibility relations

This page was built for publication: Complexity and Expressivity of Uniform One-Dimensional Fragment with Equality