scientific article
From MaRDI portal
Publication:2957894
DOI10.4230/LIPIcs.STACS.2013.317zbMath1354.03007MaRDI QIDQ2957894
Publication date: 30 January 2017
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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 (7)
On the Decidability of Elementary Modal Logics ⋮ 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 ⋮ Regular Graphs and the Spectra of Two-Variable Logic with Counting
This page was built for publication:
