One-Dimensional Logic over Trees
From MaRDI portal
Publication:5111281
DOI10.4230/LIPICS.MFCS.2017.64zbMATH Open1441.68075OpenAlexW2774479070MaRDI QIDQ5111281FDOQ5111281
Authors: Emanuel Kieroński, Antti Kuusisto 
Publication date: 26 May 2020
Full work available at URL: https://dblp.uni-trier.de/db/conf/mfcs/mfcs2017.html#KieronskiK17
Recommendations
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Subsystems of classical logic (including intuitionistic logic) (03B20) Computational aspects of satisfiability (68R07)
Cites Work
- Complexity and expressivity of uniform one-dimensional fragment with equality
- Decidability of weak logics with deterministic transitive closure
- Alternation
- Title not available (Why is that?)
- First-order logic with two variables and unary temporal logic
- Database Theory - ICDT 2005
- On the complexity of the two-variable guarded fragment with transitive guards
- Unary negation
- One-dimensional fragment of first-order logic
- Two-variable logic with counting and a linear order
- Two-variable logic with a between relation
- Complexity of two-variable logic on finite trees
- Extending two-variable logic on trees
- One-dimensional logic over words
- Uniform one-dimensional fragments with one equivalence relation
Cited In (7)
- First-order logic on finite trees
- Complexity and expressivity of uniform one-dimensional fragment with equality
- Uniform guarded fragments
- One-dimensional logic over words
- Uniform one-dimensional fragments with one equivalence relation
- One-dimensional fragment of first-order logic
- One-and-a-halfth-order Logic
This page was built for publication: One-Dimensional Logic over Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111281)
