Equivalence relations, invariants, and normal forms
SIAM Journal on Computing
Relational queries computable in polynomial time
Information and Control
Languages that capture complexity classes
SIAM Journal on Computing
Relativized alternation and space-bounded computation
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
The method of forced enumeration for nondeterministic automata
Acta Informatica
Nondeterministic space is closed under complementation
SIAM Journal on Computing
On logical descriptions of some concepts in structural complexity theory
CSL '89 Proceedings of the third workshop on Computer science logic
SIAM Journal on Computing
Capturing complexity classes by fragments of second-order logic
Theoretical Computer Science - Special issue on logic and applications to computer science
Methods for proving completeness via logical reductions
Theoretical Computer Science
Using the Hamiltonian path operator to capture NP
Journal of Computer and System Sciences
The expressive power of finitely many generalized quantifiers
Information and Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Second Order Logic and the Weak Exponential Hierarchies
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
A First-Order Isomorphism Theorem
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
CSL '93 Selected Papers from the 7th Workshop on Computer Science Logic
Reduction to NP-complete problems by interpretations
Proceedings of the Symposium "Rekursive Kombinatorik" on Logic and Machines: Decision Problems and Complexity
Logics Capturing Relativized Complexity Classes Uniformly
LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
Maze recognizing automata and nondeterministic tape complexity
Journal of Computer and System Sciences
| Hi-index | 0.00 |
This paper presents a perspective on the relationship between Lindström quantifiers in model theory and oracle computations in complexity theory. We do not study this relationship here in full generality (indeed, there is much more work to do in order to obtain a full appreciation), but instead we examine what amounts to a thread of research in this topic running from the motivating results, concerning logical characterizations of nondeterministic polynomial-time, to the consideration of Lindströom quantifiers as oracles, and through to the study of some naturally arising questions (and subsequent answers). Our presentation follows the chronological progress of the thread and highlights some important techniques and results at the interface between finite model theory and computational complexity theory.