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

DOI10.24033/bsmf.1555zbMath0156.25201MaRDI QIDQ5536266

Daniel Lacombe

Publication date: 1960

Published in: Bulletin de la Société mathématique de France (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=BSMF_1960__88__393_0

zbMATH Keywords

mathematical logic

Related Items

Kolmogorov Complexity in Perspective Part I: Information Theory and Randomness, Hilbert's tenth problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On degrees of recursive unsolvability
• Finite computability of Postnikov complexes
• Recursive unsolvability of group theoretic problems
• Undecidable theories
• Solvable cases of the decision problem
• Hierarchies of number-theoretic predicates
• Effective operations on partial recursive functions
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• Recursive Functionals and Quantifiers of Finite Types I
• Mathematical significance of consistency proofs
• Gödel numberings of partial recursive functions
• Separation principles in the hierarchies of classical and effective descriptive set theory
• On recursively enumerable and arithmetic models of set theory
• A Proof Method for Quantification Theory: Its Justification and Realization
• Solution to a problem of Gandy's
• La prédicativité
• Representability of recursively enumerable sets in formal theories
• On the concept of a random sequence
• Concatenation as a basis for arithmetic