Reflective Relational Machines
- 1 June 1998
- journal article
- Published by Elsevier in Information and Computation
- Vol. 143 (2) , 110-136
- https://doi.org/10.1006/inco.1998.2701
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Fixpoint logics, relational machines, and computational complexityJournal of the ACM, 1997
- Computing with infinitary logicTheoretical Computer Science, 1995
- Computing with First-Order LogicJournal of Computer and System Sciences, 1995
- Expressibility and Parallel ComplexitySIAM Journal on Computing, 1989
- Languages that Capture Complexity ClassesSIAM Journal on Computing, 1987
- Relational queries computable in polynomial timeInformation and Control, 1986
- Structure and complexity of relational queriesJournal of Computer and System Sciences, 1982
- Upper and lower bounds for first order expressibilityJournal of Computer and System Sciences, 1982
- AlternationJournal of the ACM, 1981
- On Moschovakis closure ordinalsThe Journal of Symbolic Logic, 1977