Logical Approaches to Computational Barriers

DOI10.1007/11780342zbMath1145.03313OpenAlexW4255986326WikidataQ55968647 ScholiaQ55968647MaRDI QIDQ5898847

Merlijn Sevenster, Tero Tulenheimo

Publication date: 30 April 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11780342

zbMATH Keywords

Henkin quantifierspartially ordered connectives\textbf{NP} vs. co\textbf{NP}, finite model theory.

Mathematics Subject Classification ID

Logic with extra quantifiers and operators (03C80) Model theory of finite structures (03C13) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Descriptive complexity and finite models (68Q19)

Related Items (2)

Boolean dependence logic and partially-ordered connectives ⋮ Partially ordered connectives and monadic monotone strict NP

This page was built for publication: Logical Approaches to Computational Barriers