Constructive definition of certain analytic sets of numbers
- 12 March 1959
- journal article
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 24 (1) , 37-49
- https://doi.org/10.2307/2964572
Abstract
According to Kleene [8] and Post [13] the definition of recursive relations (or sets) can be given most simply via the definition of recursively enumerable (r.e.) relations. The latter can be defined by finite systems of finite rules for deriving strings of symbols, each rule being of the form each formula or being obtained by juxtaposition from atomic symbols and variables ranging over strings of atomic symbols.Keywords
This publication has 8 references indexed in Scilit:
- Separation principles in the hierarchies of classical and effective descriptive set theoryFundamenta Mathematicae, 1958
- A note on function quantificationProceedings of the American Mathematical Society, 1957
- On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)American Journal of Mathematics, 1955
- Arithmetical predicates and function quantifiersTransactions of the American Mathematical Society, 1955
- Hierarchies of number-theoretic predicatesBulletin of the American Mathematical Society, 1955
- Einführung in die Operative Logik und MathematikPublished by Springer Nature ,1955
- Recursively enumerable sets of positive integers and their decision problemsBulletin of the American Mathematical Society, 1944
- Recursive predicates and quantifiersTransactions of the American Mathematical Society, 1943