Quantifiers and Logical Reductions
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 307-338
- https://doi.org/10.1007/3-540-28788-4_12
Abstract
No abstract availableThis publication has 107 references indexed in Scilit:
- On logics with two variablesTheoretical Computer Science, 1999
- Succinctness as a source of complexity in logical formalismsAnnals of Pure and Applied Logic, 1999
- A double arity hierarchy theorem for transitive closure logicArchive for Mathematical Logic, 1996
- An optimal lower bound on the number of variables for graph identificationCombinatorica, 1992
- Using the Hamiltonian path operator to capture NPJournal of Computer and System Sciences, 1992
- Fixed-point extensions of first-order logicAnnals of Pure and Applied Logic, 1986
- Horn clause queries and generalizationsThe Journal of Logic Programming, 1985
- Structure and complexity of relational queriesJournal of Computer and System Sciences, 1982
- Probabilities on finite modelsThe Journal of Symbolic Logic, 1976
- Range and degree of realizability of formulas in the restricted predicate calculusCybernetics and Systems Analysis, 1972