Bounded-arity hierarchies in fixed-point logics
- 6 March 2006
- book chapter
- Published by Springer Nature
- p. 150-164
- https://doi.org/10.1007/bfb0049330
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Expressibility of bounded-arity fixed-point query hierarchiesPublished by Association for Computing Machinery (ACM) ,1989
- Expressiveness of restricted recursive queriesPublished by Association for Computing Machinery (ACM) ,1989
- Procedural and declarative database update languagesPublished by Association for Computing Machinery (ACM) ,1988
- Languages that Capture Complexity ClassesSIAM Journal on Computing, 1987
- Existential fixed-point logicPublished by Springer Nature ,1987
- Toward logic tailored for computational complexityLecture Notes in Mathematics, 1984
- Structure and complexity of relational queriesJournal of Computer and System Sciences, 1982
- Asymptotic 0–1 laws in combinatoricsPublished by Springer Nature ,1982