Definability with bounded number of bound variables
- 1 November 1989
- journal article
- Published by Elsevier in Information and Computation
- Vol. 83 (2), 121-139
- https://doi.org/10.1016/0890-5401(89)90055-2
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Preservation of expressive completeness in temporal modelsInformation and Computation, 1987
- Unbounded program memory adds to the expressive power of first-order programming logicInformation and Control, 1984
- Deux ou trois choses que je sais de LnThe Journal of Symbolic Logic, 1982
- Upper and lower bounds for first order expressibilityJournal of Computer and System Sciences, 1982
- Definability in dynamic logicJournal of Computer and System Sciences, 1981
- Complexity of Boolean algebrasTheoretical Computer Science, 1980
- On Moschovakis closure ordinalsThe Journal of Symbolic Logic, 1977
- An application of games to the completeness problem for formalized theoriesFundamenta Mathematicae, 1960