An “Ehrenfeucht-Fraïssé game” for fixpoint logic and stratified fixpoint logic
- 1 January 1993
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 100-114
- https://doi.org/10.1007/3-540-56992-8_8
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- The expressive power of stratified logic programsInformation and Computation, 1991
- Languages that Capture Complexity ClassesSIAM Journal on Computing, 1987
- Skolem normal forms concerning the least fixpointPublished by Springer Nature ,1987
- Second-order and Inductive Definability on Finite StructuresMathematical Logic Quarterly, 1987
- Fixed-point extensions of first-order logicAnnals of Pure and Applied Logic, 1986
- Relational queries computable in polynomial timeInformation and Control, 1986
- Horn clause queries and generalizationsThe Journal of Logic Programming, 1985
- 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
- On Moschovakis closure ordinalsThe Journal of Symbolic Logic, 1977