La théorie des fonctions récursives et ses applications. (Exposé d'information générale)

 Access to full text

 Full (PDF)

1. [1] ACKERMANN (WILHELM). — Solvable cases of the decision problem. — Amsterdam, North-Holland publishing Company, 1954 (Studies in Logic and the Foundations of Mathematics). Zbl0056.24505
2. [2] ADDISON (JOHN W.). — Separation principles in the hierarchies of classical and effective descriptive set theory, Fund. Math., t. 46, 1958, p. 123-135. Zbl0091.05201MR24 #A1209
3. [3] BROWN (EDGAR H.). — Finite computability of Postnikov complexes, Annals of Math., Series 2, t. 65, 1957, p. 1-20. Zbl0077.16804MR18,753a
4. [4] CHURCH (ALONZO). — On the concept of a random sequence, Bull. Amer. math. Soc., t. 46, 1940, p. 130-135. Zbl0022.36904MR1,149aJFM66.0601.01
5. [5] DAVIS (MARTIN). — Computability and unsolvability. — New-York, Mc Graw-Hill Book Company, 1958 (Mc Graw-Hill Series in Information Processing and Computers). Zbl0080.00902
6. [6] FRIEDBERG (RICHARD M.). — 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. Zbl0080.24302
7. [7] FRIEDBERG (RICHARD M.). — 4-quantifier completeness : a Banach-Mazur functional not uniformly partial recursive, Bull. Acad. polon. Sc., t. 6, 1958, p. 1-5. Zbl0084.24902MR20 #3071
8. [8] GILMORE (C.). — A proof method for quantification theory : its justification and realization, I. M. B. J. of Research and Development, t. 4, 1960, p. 28-35. Zbl0097.00301MR23 #B3113
9. [9] GRZEGORCZYK (ANDRZEJ). — 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). Zbl0088.01701
10. [10] KLEENE (S. C.). — Finite axiomatizability of theories in the predicate calculus using additional predicate symbols, Memoirs Am. math. Soc., n° 10, 1952, p. 27-68. Zbl0047.25001MR14,439d
11. [11] KLEENE (S. C.). — Introduction to metamathematics. — Amsterdam, North-Holland publishing Company; Groningen, Noordhoff, 1952 (Bibliotheca Mathematica, 1). Zbl0047.00703MR14,525m
12. [12] KLEENE (S. C.). — Hierarchies of number-theoretic predicates, Bull. Amer. math. Soc., t. 61, 1955, p. 193-213. Zbl0066.25901MR17,4f
13. [13] KLEENE (S. C.). — Recursive functionals and quantifiers of finite type I, Trans. Amer. math. Soc., t. 91, 1959, p. 1-52. Zbl0088.01301MR21 #1273
14. [14] KLEENE (S. C.). — 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). Zbl0100.24901
15. [15] KLEENE (S. C.). — Mathematical Logic : constructive and non-constructive operations, Proc. Intern. Congr. Math. [1958. Edinburgh] ; p. 137-153. — Cambridge, at the University Press, 1960. Zbl0126.01903
16. [16] KREISEL (Georg). — Mathematical significance of consistency proofs, J. of symb. Logic, t. 23, 1958, p. 155-182. Zbl0088.01502MR22 #6710
17. [17] KREISEL (Georg). — 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). Zbl0134.01001
18. [18] KREISEL (Georg). — La prédicativité, Bull. Soc. math. France, t. 88, 1960, p. 371-391. Zbl0131.00604MR23 #A800
19. [19] KREISEL (Georg). — 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. Zbl0199.01401
20. [20] KREISEL (G.) et LACOMBE (D.). — Ensembles récursivement mesurables et ensembles récursivement ouverts ou fermés, C. R. Acad. Sc. Paris, t. 245, 1957, p. 1106-1109. Zbl0079.00901MR22 #3680
21. [21] KREISEL (G.), LACOMBE (D.) and SHOENFIELD (J. R.). — 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). Zbl0178.32201
22. [22] LACOMBE (Daniel). — Quelques propriétés d'analyse récursive, C. R. Acad. Sc. Paris, 244, 1957, p. 996-997. Zbl0077.01601
23. [23] LACOMBE (Daniel). — 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. Zbl0078.00703
24. [24] LACOMBE (Daniel). — 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). Zbl0089.00701
25. [25] MARKOV (A. A.). — The problem of homeomorphy [en russe], Proc. Intern. Congr. Math. [1958. Edinburgh] ; p. 300-306. — Cambridge, at the University Press, 1960. Zbl0119.25201
26. [26] MYHILL (J.) and DEKKER (J. C. E.). — Recursive equivalence types. — Berkeley, University of California (à paraître). Zbl0249.02021
27. [27] MYHILL (J.) and SHEPHERDSON (J. C.). — Effective operations on partial recursive functions, Z. für math. Logik und Grundl. der Math., t. 1, 1955, p. 310-317. Zbl0068.24706MR17,1039b
28. [28] NOVIKOV (P. S.). — Sur l'insolubilité algorithmique du problème des mots [en russe], Trudy Mat. Inst. Steklov, t. 44, 1955, p. 143. Zbl0068.01301MR17,706b
29. [29] PORTE (Jean). — 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. [30] PORTE (Jean), — Systèmes de Post et algorithmes de Markov, Cybernetica, n° 2 (1958), 1959. Zbl0173.00902
31. [31] PUTNAM (Hilary). — An unsolvable problem in number theory, J. of symb. Logic (à paraître). Zbl0108.00701
32. [32] QUINE (W. V.). — Concatenation as a basis for arithmetic, J. of symb. Logic, t. 11, 1946, p. 105-114. Zbl0063.06362MR8,307b
33. [33] RABIN (Michael O.). — Recursive unsolvability of group theoric problems, Annals of Math., Series 2, t. 67, 1958, p. 172-194. Zbl0079.24802
34. [34] RABIN (Michael O.). — On recursively enumerable and arithmetic models of set theory, J. of symb. Logic, t. 23, 1958, p. 408-416. Zbl0095.24601MR22 #10908
35. [35] RABIN (Michael O.) and SCOTT (Dana). — Finite automata and their decision problems, I.B.M.J. of Research and Development, t. 3, 1959, p. 114-125. Zbl0158.25404MR21 #2559
36. [36] ROGERS (Hartley, Jr). — Gödel numberings of partial recursive functions, J. of symb. Logic, t. 23, 1958, p. 331-341. Zbl0088.01602
37. [37] SHEPHERDSON (J. C.). — Representability of recursively enumerable sets in formal theories, Archiv für math. Logik und Grundlagenforschung (à paraître). Zbl0113.24305
38. [38] SPECTOR (Clifford). — On degrees of recursive unsolvability, Annals of Math., Series 2, t. 64, 1956, p. 581-592. Zbl0074.01302MR18,552d
39. [39] TARSKI (A.), MOSTOWSKI (A.) and ROBINSON (R. M.). — Undecidable theories. Amsterdam, North-Holland publishing Company, 1953 (Studies in Logic and the Foundations of Mathematics). Zbl0053.00401
40. [40] TENNENBAUM (S.). — Non-archimedean models for arithmetic, Notices Amer. math. Soc., t. 6, 1959, p. 270. 

1. Jean-Pierre Azra, Relations diophantiennes et la solution négative du 10e problème de Hilbert
2. Daniel Lacombe, Théorèmes de non-décidabilité