The Complexity of Positive First-Order Logic without Equality
From MaRDI portal
Publication:2946653
DOI10.1145/2071368.2071373zbMath1351.68119arXiv1003.0802OpenAlexW2113995039MaRDI QIDQ2946653
Florent R. Madelaine, Barnaby Martin
Publication date: 17 September 2015
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1003.0802
Analysis of algorithms and problem complexity (68Q25) Subsystems of classical logic (including intuitionistic logic) (03B20)
Related Items
On the Complexity of the Model Checking Problem, The lattice and semigroup structure of multipermutations, On the complexity of existential positive queries, The Complexity of Quantified Constraints Using the Algebraic Formulation, The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation