论文信息 - Logical Thinking Becomes Automatic

Logical Thinking Becomes Automatic

In the first phase of AI research, the search for general problem-solving methods was successful at least in formal logic. A mechanical procedure was given to prove the logical truth of formulas. The procedure could also be carried out by a computer program and introduced automatic proving in computer science.

Klaus Mainzer | K. Mainzer

[1] J. A. Robinson,et al. A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[2] Joseph R. Shoenfield,et al. Mathematical logic , 1967 .

[3] A. Church. The calculi of lambda-conversion , 1941 .

[4] Ulrich Kohlenbach,et al. Applied Proof Theory - Proof Interpretations and their Use in Mathematics , 2008, Springer Monographs in Mathematics.

[5] Gregory J. Chaitin,et al. The Limits of Mathematics , 1995, J. Univers. Comput. Sci..

[6] Klaus Mainzer. The Digital and the Real World:Computational Foundations of Mathematics, Science, Technology, and Philosophy , 2017 .

[7] Helmut Schwichtenberg,et al. Proofs and Computations , 2012, Perspectives in logic.

[8] Richard Statman,et al. Logic for computer scientists , 1989 .

[9] Robert A. Kowalski,et al. Logic for problem solving , 1982, The computer science library : Artificial intelligence series.

[10] Line Jakubiec,et al. Coq and Hardware Verification: A Case Study , 1996, TPHOLs.

[11] Thierry Coquand,et al. The Calculus of Constructions , 1988, Inf. Comput..

[12] Helmut Schwichtenberg,et al. Proof And Computation: Digitization In Mathematics, Computer Science And Philosophy , 2018 .

[13] Sanjeev Arora,et al. Computational Complexity: A Modern Approach , 2009 .