Hereditarily-finite sets, data bases and polynomial-time computability
- 11 October 1993
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 119 (1) , 187-214
- https://doi.org/10.1016/0304-3975(93)90345-t
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Languages that Capture Complexity ClassesSIAM Journal on Computing, 1987
- Fixed-point extensions of first-order logicAnnals of Pure and Applied Logic, 1986
- Relational queries computable in polynomial timeInformation and Control, 1986
- Structure and complexity of relational queriesJournal of Computer and System Sciences, 1982
- Computable queries for relational data basesJournal of Computer and System Sciences, 1980
- Concerning A Problem of H. ScholzPublished by Elsevier ,1979
- Turing machines and the spectra of first-order formulasThe Journal of Symbolic Logic, 1974
- Set-theoretic functions for elementary syntaxPublished by American Mathematical Society (AMS) ,1974
- Existence and feasibility in arithmeticThe Journal of Symbolic Logic, 1971
- Concerning a problem of H. ScholzMathematical Logic Quarterly, 1956