@article{BSMF_1960__88__393_0, author = {Lacombe, D.}, title = {La th\'eorie des fonctions r\'ecursives et ses applications. {(Expos\'e} d'information g\'en\'erale)}, journal = {Bulletin de la Soci\'et\'e Math\'ematique de France}, pages = {393--468}, publisher = {Soci\'et\'e math\'ematique de France}, volume = {88}, year = {1960}, doi = {10.24033/bsmf.1555}, mrnumber = {23 #A60}, zbl = {0156.25201}, language = {fr}, url = {http://www.numdam.org/articles/10.24033/bsmf.1555/} }
TY - JOUR AU - Lacombe, D. TI - La théorie des fonctions récursives et ses applications. (Exposé d'information générale) JO - Bulletin de la Société Mathématique de France PY - 1960 SP - 393 EP - 468 VL - 88 PB - Société mathématique de France UR - http://www.numdam.org/articles/10.24033/bsmf.1555/ DO - 10.24033/bsmf.1555 LA - fr ID - BSMF_1960__88__393_0 ER -
%0 Journal Article %A Lacombe, D. %T La théorie des fonctions récursives et ses applications. (Exposé d'information générale) %J Bulletin de la Société Mathématique de France %D 1960 %P 393-468 %V 88 %I Société mathématique de France %U http://www.numdam.org/articles/10.24033/bsmf.1555/ %R 10.24033/bsmf.1555 %G fr %F BSMF_1960__88__393_0
Lacombe, D. La théorie des fonctions récursives et ses applications. (Exposé d'information générale). Bulletin de la Société Mathématique de France, Volume 88 (1960), pp. 393-468. doi : 10.24033/bsmf.1555. http://www.numdam.org/articles/10.24033/bsmf.1555/
[1] Solvable cases of the decision problem. - Amsterdam, North-Holland publishing Company, 1954 (Studies in Logic and the Foundations of Mathematics). | Zbl
. -[2] Separation principles in the hierarchies of classical and effective descriptive set theory, Fund. Math., t. 46, 1958, p. 123-135. | MR | Zbl
. -[3] Finite computability of Postnikov complexes, Annals of Math., Series 2, t. 65, 1957, p. 1-20. | MR | Zbl
. -[4] On the concept of a random sequence, Bull. Amer. math. Soc., t. 46, 1940, p. 130-135. | JFM | MR | Zbl
. -[5] Computability and unsolvability. - New-York, Mc Graw-Hill Book Company, 1958 (Mc Graw-Hill Series in Information Processing and Computers). | Zbl
. -[6] Two recursively enumerable sets of incomparable degrees of unsolvability (solution of Post's problem, 1944), Proc. Nat. Acad. Sc. U.S.A., t. 43, 1957, p. 236-238. | Zbl
. -[7] 4-quantifier completeness : a Banach-Mazur functional not uniformly partial recursive, Bull. Acad. polon. Sc., t. 6, 1958, p. 1-5. | MR | Zbl
. -[8] A proof method for quantification theory : its justification and realization, I. M. B. J. of Research and Development, t. 4, 1960, p. 28-35. | MR | Zbl
. -[9] Some approaches to constructive analysis, Constructivity in mathematics, Proc. Coll. Amsterdam, 1957, p. 43-61. - Amsterdam, North-Holland publishing Company, 1959 (Studies in Logic and the Foundations of Mathematics). | Zbl
. -[10] Finite axiomatizability of theories in the predicate calculus using additional predicate symbols, Memoirs Am. math. Soc., n° 10, 1952, p. 27-68. | MR | Zbl
. -[11] Introduction to metamathematics. - Amsterdam, North-Holland publishing Company; Groningen, Noordhoff, 1952 (Bibliotheca Mathematica, 1). | MR | Zbl
. -[12] Hierarchies of number-theoretic predicates, Bull. Amer. math. Soc., t. 61, 1955, p. 193-213. | MR | Zbl
. -[13] Recursive functionals and quantifiers of finite type I, Trans. Amer. math. Soc., t. 91, 1959, p. 1-52. | MR | Zbl
. -[14] Countable functionals, Constructivity in mathematics, Proc. Coll. Amsterdam 1957 ; p. 81-100. - Amsterdam, North-Holland publishing Company, 1959 (Studies in Logic and the Foundations of Mathematics). | Zbl
. -[15] Mathematical Logic : constructive and non-constructive operations, Proc. Intern. Congr. Math. [1958. Edinburgh] ; p. 137-153. - Cambridge, at the University Press, 1960. | Zbl
. -[16] Mathematical significance of consistency proofs, J. of symb. Logic, t. 23, 1958, p. 155-182. | MR | Zbl
. -[17] Interpretation of analysis by means of constructive functionals of finite type, Constructivity in mathematics, Proc. Coll. Amsterdam, 1957 ; p. 101-128. - Amsterdam, North-Holland publishing Company, 1959. (Studies in Logic and the Foundations of Mathematics). | Zbl
. -[18] La prédicativité, Bull. Soc. math. France, t. 88, 1960, p. 371-391. | Numdam | MR | Zbl
. -[19] Set theoric problems suggested by the notion of potentiel totality, Proceedings of the Symposium on infinitistic methods in the foundations of mathematics [1959. Warszawa] ; p. 103-140. - Warszawa, 1960. | Zbl
. -[20] Ensembles récursivement mesurables et ensembles récursivement ouverts ou fermés, C. R. Acad. Sc. Paris, t. 245, 1957, p. 1106-1109. | MR | Zbl
et . -[21] Partial recursive functionals and effective operations, Constructivity in mathematics, Proc. Coll. Amsterdam 1957 ; p. 290-297. - Amsterdam, North-Holland publishing Company, 1959 (Studies in Logic and the Foundations of Mathematics). | Zbl
, and . -[22] Quelques propriétés d'analyse récursive, C. R. Acad. Sc. Paris, 244, 1957, p. 996-997. | Zbl
. -[23] Les ensembles récursivement ouverts ou fermés et leurs applications à l'analyse récursive, C. R. Acad. Sc. Paris, t. 245, 1957, p. 1040-1043. | Zbl
. -[24] Quelques procédés de définition en topologie récursive, Constructivity in mathematics, Proc. Coll. Amsterdam 1957 ; p. 129-158. Amsterdam, North-Holland publishing Company, 1959 (Studies in Logic and the Foundations of Mathematics). | Zbl
. -[25] The problem of homeomorphy [en russe], Proc. Intern. Congr. Math. [1958. Edinburgh] ; p. 300-306. - Cambridge, at the University Press, 1960. | Zbl
. -[26] Recursive equivalence types. - Berkeley, University of California (à paraître). | Zbl
and . -[27] Effective operations on partial recursive functions, Z. für math. Logik und Grundl. der Math., t. 1, 1955, p. 310-317. | MR | Zbl
and . -[28] Sur l'insolubilité algorithmique du problème des mots [en russe], Trudy Mat. Inst. Steklov, t. 44, 1955, p. 143. | MR | Zbl
. -[29] Une simplification de la théorie de Turing, Actes du 1er Congrès international de Cybernétique [1956. Namur] ; p. 251-280. - Paris, Gauthier-Villars ; Namur, Association internationale de Cybernétique, 1958.
. -[30] Systèmes de Post et algorithmes de Markov, Cybernetica, n° 2 (1958), 1959.
, -[31] An unsolvable problem in number theory, J. of symb. Logic (à paraître).
. -[32] Concatenation as a basis for arithmetic, J. of symb. Logic, t. 11, 1946, p. 105-114. | MR | Zbl
. -[33] Recursive unsolvability of group theoric problems, Annals of Math., Series 2, t. 67, 1958, p. 172-194. | Zbl
. -[34] On recursively enumerable and arithmetic models of set theory, J. of symb. Logic, t. 23, 1958, p. 408-416. | MR | Zbl
. -[35] Finite automata and their decision problems, I.B.M.J. of Research and Development, t. 3, 1959, p. 114-125. | MR | Zbl
and . -[36] Gödel numberings of partial recursive functions, J. of symb. Logic, t. 23, 1958, p. 331-341. | Zbl
. -[37] Representability of recursively enumerable sets in formal theories, Archiv für math. Logik und Grundlagenforschung (à paraître). | Zbl
. -[38] On degrees of recursive unsolvability, Annals of Math., Series 2, t. 64, 1956, p. 581-592. | MR | Zbl
. -[39] Undecidable theories. Amsterdam, North-Holland publishing Company, 1953 (Studies in Logic and the Foundations of Mathematics). | Zbl
, and . -[40] Non-archimedean models for arithmetic, Notices Amer. math. Soc., t. 6, 1959, p. 270.
. -Cited by Sources: