Step by recursive step: Church's analysis of effective calculability
暂无分享,去创建一个
[1] Alonzo Church,et al. Formal definitions in the theory of ordinal numbers , 1937 .
[2] S. Kleene,et al. λ-Definability and Recursiveness. , 1937 .
[3] Anders Martin-Löf,et al. Collected Works I , 1994 .
[4] S. Kleene,et al. The Inconsistency of Certain Formal Logics , 1935 .
[5] Alexander George. Mathematics and mind , 1994 .
[6] Robert I. Soare,et al. Computability and Recursion , 1996, Bulletin of Symbolic Logic.
[7] Alonzo Church,et al. A. M. Turing. On computable numbers, with an application to the Entscheidungs problcm. Proceedings of the London Mathematical Society , 2 s. vol. 42 (1936–1937), pp. 230–265. , 1937, Journal of Symbolic Logic.
[8] S. C. Kleene,et al. Introduction to Metamathematics , 1952 .
[9] Martin D. Davis,et al. Why Gödel Didn't Have Church's Thesis , 1982, Inf. Control..
[10] Alonzo Church,et al. Introduction to Mathematical Logic , 1991 .
[11] György Darvas,et al. Philosophy of mathematics today , 1997 .
[12] Jesudason C.G.,et al. COLLECTED WORKS II. , 1988 .
[13] S. Kleene. General recursive functions of natural numbers , 1936 .
[14] A. Church. Alternatives to Zermelo’s assumption , .
[15] A. Church,et al. Some properties of conversion , 1936 .
[16] S. Kleene. $\lambda$-definability and recursiveness , 1936 .
[17] S. Feferman. Turing in the land of O(z) , 1988 .
[18] Alonzo Church,et al. A note on the Entscheidungsproblem , 1936, Journal of Symbolic Logic.
[19] Wilfried Sieg,et al. Mechanical Procedures and Mathematical Experience , 1991 .
[20] R. Dedekind. Stetigkeit und irrationale Zahlen , 2022 .
[21] Jozef Pepis,et al. Ein Verfahren der mathematischen Logik , 1938, Journal of Symbolic Logic (JSL).
[22] S. C. Kleene,et al. A note on recursive functions , 1936 .
[23] S. Kleene. Proof by Cases in Formal Logic , 1934 .
[24] J. Rosser. A Mathematical Logic Without Variables. I , 1935 .
[25] Alonzo Church,et al. The Richard Paradox , 1934 .
[26] Martin D. Davis,et al. American Logic in the 1920s , 1995, Bulletin of Symbolic Logic.
[27] A. Church. A Set of Postulates for the Foundation of Logic , 1932 .
[28] Emil L. Post. Finite combinatory processes—formulation , 1936, Journal of Symbolic Logic.
[29] J. Barkley Rosser,et al. Highlights of the History of the Lambda-Calculus , 1984, IEEE Ann. Hist. Comput..
[30] Rolf Herken,et al. Retrieved July 19 2004 Universal Turing Machine , 2011 .
[31] Joseph R. Shoenfield,et al. Mathematical logic , 1967 .
[32] John W. Dawson,et al. Logical dilemmas - the life and work of Kurt Gödel , 1996 .
[33] A. Church. An Unsolvable Problem of Elementary Number Theory , 1936 .
[34] A. Church,et al. A Proof of Freedom from Contradiction. , 1935, Proceedings of the National Academy of Sciences of the United States of America.
[35] R. Dedekind,et al. Was sind und was sollen die Zahlen , 1961 .
[36] J. Perl. The Law of the Excluded Middle , 1988 .
[37] S. Kleene. A Theory of Positive Integers in Formal Logic. Part II , 1935 .
[38] A. Church. On the law of excluded middle , .
[39] Alonzo Church,et al. Post Emil L.. Finite combinatory processes—formulation 1. The journal of symbolic logic, vol. 1 (1936), pp. 103–105. , 1937, Journal of Symbolic Logic.
[40] Elliott Mendelson,et al. Second Thoughts about Church's Thesis and Mathematical Proofs , 1990 .
[41] P. Bernays,et al. Grundlagen der Mathematik , 1934 .