Relational queries computable in polynomial time
Information and Control
Languages that capture complexity classes
SIAM Journal on Computing
Some relationships between logics of programs and complexity theory
Theoretical Computer Science
Descriptive characterizations of computational complexity
Journal of Computer and System Sciences
Generic Computation and its complexity
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Computing with first-order logic
Selected papers of the 23rd annual ACM symposium on Theory of computing
Evolving algebras 1993: Lipari guide
Specification and validation methods
Fixpoint logics, relational machines, and computational complexity
Journal of the ACM (JACM)
A restricted second order logic for finite structures
Information and Computation
Positive versions of polynomial time
Information and Computation
Even Simple Programs Are Hard To Analyze
Journal of the ACM (JACM)
Universality of data retrieval languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Program schemes, arrays, Lindström quantifiers and zero-one laws
Theoretical Computer Science
Syntax vs. Semantics on Finite Structures
Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
Reduction to NP-complete problems by interpretations
Proceedings of the Symposium "Rekursive Kombinatorik" on Logic and Machines: Decision Problems and Complexity
Generalized Quantifiers and 0-1 Laws
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
An Infinite Hierarchy in a Class of Polynomial-Time Program Schemes
Theory of Computing Systems
Finite Model Theory and Its Applications (Texts in Theoretical Computer Science. An EATCS Series)
Finite Model Theory and Its Applications (Texts in Theoretical Computer Science. An EATCS Series)
Record of the Project MAC conference on concurrent systems and parallel computation
Logical and Complexity-theoretic Aspects of Models of Computation with Restricted Access to Arrays
Journal of Logic and Computation
Hi-index | 0.00 |
We prove that a very basic class of program schemes augmented with access to a queue and an additional numeric universe within which counting is permitted, so that the resulting class is denoted NPSQ$_+$(1), is such that the class of problems accepted by these program schemes is exactly the class of recursively enumerable problems. The class of problems accepted by the program schemes of the class NPSQ(1) where only access to a queue, and not the additional numeric universe, is allowed is exactly the class of recursively enumerable problems that are closed under extensions. We define an infinite hierarchy of classes of program schemes for which NPSQ(1) is the first class and the union of the classes of which is the class NPSQ.We show that the class of problems accepted by the program schemes of NPSQ is the union of the classes of problems defined by the sentences of all vectorized Lindström logics formed using operators whose corresponding problems are recursively enumerable and closed under extensions, and, as a result, has a zero-one law. Moreover, we also show that this class of problems can be realized as the class of problems defined by the sentences of a particular vectorized Lindström logic. Finally, we show how our results can be applied to yield logical characterizations of complexity classes and provide logical analogues to a number of inequalities and hypotheses from computational complexity theory involving (non-deterministic) complexity classes ranging from NP through to ELEMENTARY.