Computable Quantifiers and Logics over Finite Structures
- 1 January 1995
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Reachability is harder for directed than for undirected finite graphsThe Journal of Symbolic Logic, 1990
- Relativized alternation and space-bounded computationJournal of Computer and System Sciences, 1988
- Problems complete for deterministic logarithmic spaceJournal of Algorithms, 1987
- Second-order and Inductive Definability on Finite StructuresMathematical Logic Quarterly, 1987
- Structure and complexity of relational queriesJournal of Computer and System Sciences, 1982
- AlternationJournal of the ACM, 1981
- Computable queries for relational data basesJournal of Computer and System Sciences, 1980
- A Combinatorial Problem Which Is Complete in Polynomial SpaceJournal of the ACM, 1976
- Monadic generalized spectraMathematical Logic Quarterly, 1975
- Weak Second‐Order Arithmetic and Finite AutomataMathematical Logic Quarterly, 1960