On asymptotic probabilities of inductive queries and their decision problem
- 1 January 1985
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 153-166
- https://doi.org/10.1007/3-540-15648-8_13
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- A programming language for the inductive sets, and applicationsInformation and Control, 1984
- Complexity of the first-order theory of almost all finite structuresInformation and Control, 1983
- 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
- Relational queries computable in polynomial time (Extended Abstract)Published by Association for Computing Machinery (ACM) ,1982
- Universality of data retrieval languagesPublished by Association for Computing Machinery (ACM) ,1979
- On Moschovakis closure ordinalsThe Journal of Symbolic Logic, 1977
- Probabilities on finite modelsThe Journal of Symbolic Logic, 1976
- Second-order Ehrenfeucht games and the deciability of the second-order theory of an equivalence relationJournal of the Australian Mathematical Society, 1975