Henkin quantifiers and complete problems
- 31 December 1986
- journal article
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 32, 1-16
- https://doi.org/10.1016/0168-0072(86)90040-0
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Toward logic tailored for computational complexityLecture Notes in Mathematics, 1984
- Characterizing Second Order Logic with First Order QuantifiersMathematical Logic Quarterly, 1979
- New problems complete for nondeterministic log spaceTheory of Computing Systems, 1976
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- Finite partially-ordered quantificationThe Journal of Symbolic Logic, 1970
- Finite Partially‐Ordered QuantifiersMathematical Logic Quarterly, 1970