When is arithmetic possible?
- 1 November 1990
- journal article
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 50 (1) , 29-51
- https://doi.org/10.1016/0168-0072(90)90053-5
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Parametrization over inductive relations of a bounded number of variablesAnnals of Pure and Applied Logic, 1990
- Relational queries computable in polynomial timeInformation and Control, 1986
- A zero-one law for logic with a fixed-point operatorInformation and Control, 1985
- Upper and lower bounds for first order expressibilityJournal of Computer and System Sciences, 1982
- On Moschovakis closure ordinalsThe Journal of Symbolic Logic, 1977
- On the computational complexity of algorithmsTransactions of the American Mathematical Society, 1965
- Some applications of the notions of forcing and generic setsFundamenta Mathematicae, 1964
- An application of games to the completeness problem for formalized theoriesFundamenta Mathematicae, 1960