The Complexity of Positive First-Order Logic without Equality II: The Four-Element Case

DOI10.1007/978-3-642-15205-4_33zbMath1287.68065OpenAlexW1830641757MaRDI QIDQ3586057

Barnaby Martin, Jos Martin

Publication date: 3 September 2010

Published in: Computer Science Logic (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2010/2367/

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Subsystems of classical logic (including intuitionistic logic) (03B20) Descriptive complexity and finite models (68Q19)

Related Items (1)

On the Complexity of the Model Checking Problem

This page was built for publication: The Complexity of Positive First-Order Logic without Equality II: The Four-Element Case