Complexity of Two-Variable Logic on Finite Trees
From MaRDI portal
Publication:5327424
DOI10.1007/978-3-642-39212-2_10zbMath1335.68132OpenAlexW6480589MaRDI QIDQ5327424
Witold Charatonik, Saguy Benaim, Emanuel Kieroński, Rastislav Lenhardt, Filip Mazowiecki, Michael Benedikt, James Worrell
Publication date: 7 August 2013
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://ora.ox.ac.uk/objects/uuid:4a8207dd-6dad-4a13-a4cf-82ad51f6e822
Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (5)
Two-Variable Logic with Counting and Trees ⋮ Complexity of Two-Variable Logic on Finite Trees ⋮ A double team semantics for generalized quantifiers ⋮ Two-Variable Separation Logic and Its Inner Circle ⋮ Finite satisfiability for two‐variable, first‐order logic with one transitive relation is decidable
This page was built for publication: Complexity of Two-Variable Logic on Finite Trees
