Advertisement

Language, Logic and Computations

  • Pavel Pudlák
Chapter
  • 2.5k Downloads
Part of the Springer Monographs in Mathematics book series (SMM)

Abstract

In this chapter we present the main concepts of mathematical logic. We describe the formal language used in mathematical logic, which is a formalization of the language used in mathematics. We explain how this language is applied to mathematical structures, which are called models in this context. We show how proofs, the main product of mathematical research, are formalized. We also present the main concepts of the theory of computations. Finally, we consider an important formal system, the λ-calculus, which can be used to formalize logical reasoning and computations at the same time.

Keywords

Turing Machine Recursive Function Computable Function Atomic Formula Intuitionistic Logic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 42.
    Church, A.: A set of postulates for the foundation of logic (1). Ann. Math. 33, 346–366 (1932) MathSciNetCrossRefGoogle Scholar
  2. 43.
    Church, A.: An unsolvable problem of elementary number theory. Am. J. Math. 58, 345–363 (1936) MathSciNetCrossRefGoogle Scholar
  3. 44.
    Church, A.: A formulation of the simple theory of types. J. Symb. Log. 5, 56–68 (1940) MathSciNetzbMATHCrossRefGoogle Scholar
  4. 56.
    Davis, M., Putnam, H.: A computing procedure for quantification theory. J. ACM 7(3), 201–215 (1960) MathSciNetzbMATHCrossRefGoogle Scholar
  5. 58.
    Dawson, J.W. Jr.: The reception of Gödel’s incompleteness theorems. In: Drucker, T. (ed.) Perspectives on the History of Mathematical Logic, pp. 84–100. Birkhäuser, Boston (1991) Google Scholar
  6. 77.
    Frege, G.: Begriffsschrift: eine der arithmetischen nachgebildete Formelsprache des reinen Denkens. Halle (1879) Google Scholar
  7. 91.
    Gentzen, G.: Die Widerspruchsfreiheit der reinen Zahlentheorie. Math. Ann. 112, 493–565 (1936) MathSciNetCrossRefGoogle Scholar
  8. 92.
    Gentzen, G.: Neue fassung des widerspruchsfreiheitsbeweises für die reine Zahlentheorie. Forsch. Logik Grundlegung exakten Wiss. 4, 19–44 (1938) Google Scholar
  9. 93.
    Girard, J.-Y.: Proof Theory and Logical Complexity. Bibliopolis, Naples (1987) zbMATHGoogle Scholar
  10. 95.
    Gödel, K.: Die Vollständigkeit der Axiome des logischen Funktionenkalküls. Monatshefte Math. Phys. 37, 349–360 (1930) zbMATHCrossRefGoogle Scholar
  11. 96.
    Gödel, K.: Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme, I. Monatshefte Math. Phys. 38, 173–198 (1931) CrossRefGoogle Scholar
  12. 106.
    Gonthier, G.: Formal proof–the four-color theorem. Not. Am. Math. Soc. 55(11), 1382–1393 (2008) MathSciNetzbMATHGoogle Scholar
  13. 110.
    Grzegorczyk, A.: An Outline of Mathematical Logic: Fundamental Results and Notions Explained with all Details. Reidel, Dordrecht (1974) zbMATHCrossRefGoogle Scholar
  14. 119.
    Henkin, L., Monk, J.D., Tarski, A.: Cylindric Algebras I. North-Holland, Amsterdam (1975) Google Scholar
  15. 120.
    Henkin, L., Monk, J.D., Tarski, A.: Cylindric Algebras II. North-Holland, Amsterdam (1985) zbMATHGoogle Scholar
  16. 153.
    Kleene, S.C.: General recursive functions of natural numbers. Math. Ann. 112, 727–742 (1936) MathSciNetCrossRefGoogle Scholar
  17. 158.
    Kohlenbach, U.: Applied Proof Theory: Proof Interpretations and Their Use in Mathematics. Springer, Berlin (2008) zbMATHGoogle Scholar
  18. 170.
    Kripke, S.A.: A completeness theorem in modal logic. J. Symb. Log. 24(1), 1–14 (1959) MathSciNetzbMATHCrossRefGoogle Scholar
  19. 178.
    Lakatos, I.: Proofs and Refutations. Cambridge University Press, Cambridge (1976) zbMATHCrossRefGoogle Scholar
  20. 186.
    Löwenheim, L.: Über Möglichkeiten im Relativkalkül. Math. Ann. 76(4), 447–470 (1915) MathSciNetCrossRefGoogle Scholar
  21. 187.
    Luckhardt, H.: Herbrand-Analysen Zweier Beweise Des Satzes von Roth: Polynomiale Anzahlschranken. J. Symb. Log. 54(1) (1989) Google Scholar
  22. 197.
    McCune, W.: Solution of the Robbins problem. J. Autom. Reason. 19(3), 263–276 (1997) MathSciNetzbMATHCrossRefGoogle Scholar
  23. 206.
    Németi, I., Dávid, Gy.: Relativistic computers and the Turing barrier. Appl. Math. Comput. 178, 118–142 (2006) MathSciNetzbMATHCrossRefGoogle Scholar
  24. 216.
    Peano, G.: Arithmetices Principia, Nova Methodo Exposita. Fratres Bocca, Torino (1889) Google Scholar
  25. 217.
    Peano, G., Cassina, U.: Formulario Matematico. Fratres Bocca, Torino (1908) Google Scholar
  26. 220.
    Poincaré, H.: The Foundations of Science. The Science Press, New York (1908) Google Scholar
  27. 221.
    Post, E.: Finite combinatory processes—formulation 1. J. Symb. Log. 1(3), 103–105 (1936) zbMATHCrossRefGoogle Scholar
  28. 248.
    Robinson, J.A.: A machine-oriented logic based on the resolution principle. J. ACM 12(1), 23–41 (1965) zbMATHCrossRefGoogle Scholar
  29. 261.
    Scott, D.: Continuous Lattices. Oxford Univ. Computing Lab. Technical Monograph PRG-7 (1971) Google Scholar
  30. 270.
    Skolem, T.: Logisch-kombinatorische Untersuchungen über die Erfüllbarkeit oder Beweisbarkeit mathematischer Sätze nebst einem Theoreme über dichte Mengen. Videnskapsselskapet Skrifter, I. Mat.-Naturvidensk. Kl. 6, 1–36 (1920) Google Scholar
  31. 271.
    Skolem, T.: Einige Bemerkungen zur axiomatischen Begründung der Mengenlehre. In: Fünften Kongress der Skandinavischen Mathematiker in Helsingfors 1922. Helsingfors, pp. 217–232 (1923) Google Scholar
  32. 293.
    Turing, A.M.: On computable numbers, with an application to the Entscheidungsproblem. Proc. Lond. Math. Soc. (2) 42, 230–265 2(1937) MathSciNetCrossRefGoogle Scholar
  33. 303.
    Wang, H.: Toward mechanical mathematics. IBM J. Res. Dev. 4(1), 2–22 (1960) zbMATHCrossRefGoogle Scholar
  34. 313.
    Whitehead, A.N., Russell, B.: Principia Mathematica, I. Cambridge University Press, Cambridge (1910) Google Scholar
  35. 314.
    Whitehead, A.N., Russell, B.: Principia Mathematica, II. Cambridge University Press, Cambridge (1912) Google Scholar
  36. 315.
    Whitehead, A.N., Russell, B.: Principia Mathematica, III. Cambridge University Press, Cambridge (1913) Google Scholar

Copyright information

© Springer International Publishing Switzerland 2013

Authors and Affiliations

  • Pavel Pudlák
    • 1
  1. 1.ASCRPragueCzech Republic

Personalised recommendations