Skip to main content
Springer Nature Link
Log in

What Is Mathematical Logic? A Survey

  • Chapter
  • First Online:
Proof, Computation and Agency

Part of the book series: Synthese Library ((SYLI,volume 352))

Abstract

What is mathematical logic? Mathematical logic is the application of mathematical techniques to logic. What is logic? I believe I am following the ancient Greek philosopher Aristotle when I say that logic is the (correct) rearranging of facts to find the information that we want. Logic has two aspects: formal and informal. In a sense logic belongs to everyone although we often accuse others of being illogical. Informal logic exists whenever we have a language. In particular Indian Logic has been known for a very long time. Formal (often called, “mathematical”) logic has its origins in ancient Greece in the West with Aristotle. Mathematical logic has two sides: syntax and semantics. Syntax is how we say things; semantics is what we mean.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    A list of the symbols used is included in the appendix.

  2. 2.

    Some people avoid using negation, ¬. They employ a constant ⊥ for the false formula. Then they use the formula \((A\rightarrow \perp)\) instead of ¬A.

  3. 3.

    The phrase “x is free/not free in [some formula]” is a technical condition that avoids misunderstandings.

  4. 4.

    Some people take this as the definition of a sub-group but other examples can be given, see [21] or [5].

  5. 5.

    But not as much by computer scientists.

  6. 6.

    This is not a question of the rule being right or wrong, it is a question of what one can say about what computers do. There are certainly problems which a compute cannot decide (see below, Section 1.5, so the computer does not necessarily “know” whether A is true or ¬A is true.

  7. 7.

    In fact he even showed that there is no finite complete system of axiom schemes for formal arithmetic.

  8. 8.

    To be precise, attention actually focussed on partial functions, those that may not be defined for all arguments.

  9. 9.

    At least as far as we can tell. It seems obvious that John von Neumann used Turing’s ideas but there is no record of him admitting to that! See Martin Davis [11].

  10. 10.

    The Continuum Hypothesis says that there are no infinite cardinal numbers between the smallest infinite cardinal number, that of the set of natural numbers and the cardinal number of the set of all subsets of the natural numbers.

  11. 11.

    The square brackets indicate that A can be discharged, i.e. is not needed for the proof of B, though it is for the proof of B, of course.

  12. 12.

    In fact he only needed transfinite induction up to ε 0, see Section 1.6, in order to prove his result.

References

  1. Barwise J., editor. Handbook of Mathematical Logic, North-Holland Pub. Co., Amsterdam, 1977.

    Google Scholar 

  2. Blackburn P., van Benthem J., and Wolter F., editors. Handbook of Modal Logic, 3, (Studies in Logic and Practical Reasoning), vol. 3. Elsevier, Amsterdam, 2006.

    Google Scholar 

  3. Cantor G. Über einen die trigonometrischen Reihen betreffenden Lehrsatz, Journal f.reine und angew. Math., 72: 130–138, 1870.

    Article  Google Scholar 

  4. Cantor G. Über die Ausdehnung eines Satzes aus der Theorie der trigonometrischen Reihen, Math. Annalen, 5: 123–132, 1872.

    Article  Google Scholar 

  5. Chang C. C., and Keisler H. J. Model Theory, 3rd ed., North-Holland Pub. Co., Amsterdam 1973, 1990.

    Google Scholar 

  6. Cohen P. J. The independence of the continuum hypothesis, Proc. Nat. Acad. Sci. USA, 50: 1143–1148, 1963.

    Article  Google Scholar 

  7. Cohen P. J. The independence of the continuum hypothesis, II, Proc. Nat. Acad. Sci. USA, 51: 105–110, 1964.

    Article  Google Scholar 

  8. Cresswell M. J., and Hughes, G. E. A New Introduction to Modal Logic, Taylor & Francis Inc., London, 1996.

    Google Scholar 

  9. Crossley J. N. What is the difference between proofs and programs? Lecture at the First International Conference on Logic and and its application to other disciplines, IIT Bombay, 2005, submitted for publication.

    Google Scholar 

  10. Crossley J. N., Brickhill C., Ash(†) C. J., Stillwell J. C., and Williams N. H. What is Mathematical Logic? Oxford University Press, New York, NY, 1972, Latest edition, Dover, 1990.

    Google Scholar 

  11. Davis M. Engines of Logic: Mathematicians and the Origin of the Computer, W.W. Norton, New York, NY, 2001.

    Google Scholar 

  12. Davis M. D., Sigal R., and Weyuker E. J. Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science, Academic Press, Harcourt, Brace, Boston, MA, 2nd edition, 1994.

    Google Scholar 

  13. Dedekind R. The nature and meaning of numbers. In Essays on Theory of Numbers, Dover, New York, NY, 1963. Originally published in 1901. Translation of Was sind und was sollen die Zahlen?

    Google Scholar 

  14. Gödel K. The Consistency of the Continuum Hypothesis, Princeton University Press, Princeton, NJ, 1940.

    Google Scholar 

  15. van Heijenoort J., editor. From Frege to Gödel, Harvard University Press, Cambridge, MA, 1967.

    Google Scholar 

  16. Howard W. The formulae-as-types notion of construction. In J. Roger Hindley and J. Seldin, editors, To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism, pages 479–490. Academic Press, New York, NY, 1969.

    Google Scholar 

  17. Kreisel G. Mathematical logic. In T. L. Saaty, editor, Lectures on Modern Mathematics, vol. 3, pages 95–195. Wiley, New York, NY, 1965.

    Google Scholar 

  18. Kripke S. A completeness theorem in modal logic, J. Symb. Logic, 24: 1–14, 1959.

    Article  Google Scholar 

  19. Kripke S. Semantical analysis of intuitionistic logic I. In J. N. Crossley and M. A. E. Dummett, editors, Formal Systems and Recurive Functions. North-Holland, Amsterdam, 1965.

    Google Scholar 

  20. Lemmon E. J. Beginning Logic, Nelson, London, 1971.

    Google Scholar 

  21. Lyndon R. C. Properties preserved under homomorphism, Pacific J. Math., 9: 143–154, 1959.

    Article  Google Scholar 

  22. Mendelson E. Introduction to Mathematical Logic, 4th ed., Chapman & Hall, 1997.

    Google Scholar 

  23. Robinson A. Non-Standard Analysis, North-Holland Pub. Co., Amsterdam, 1966.

    Google Scholar 

  24. Russell B. A. W. Introduction to Mathematical Philosophy, G. Allen and Unwin, London, 1970. First published in 1919, thirteenth impression, 1970.

    Google Scholar 

  25. Shepherdson J. C., and Sturgis H. E. Computability of recursive functions, J. Assoc. Comput. Mach., 10: 217–255, 1963.

    Article  Google Scholar 

  26. Szabo M. E., editor. The Collected Papers of Gerhard Gentzen, North-Holland Pub. Co., Amsterdam, 1969.

    Google Scholar 

  27. Turing A. M. Computability and lambda-definability, J. Symb. Logic, 2:153–163, 1937.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Technology, Monash University, Clayton, VIC, 3800, Australia

    John N. Crossley

Authors
  1. John N. Crossley
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to John N. Crossley .

Editor information

Editors and Affiliations

  1. , Institute for Logic, Language and, University of Amsterdam, Science Park 904, Amsterdam, 1098 XH, Netherlands

    Johan van Benthem

  2. Adi Shankaracharya Marg, Powai, Mumbai, 400076, India

    Amitabha Gupta

  3. Graduate Center, Department of Computer and, City University of New York, Fifth Avenue 365, New York, 10016, New York, USA

    Rohit Parikh

Appendix: A Brief Guide to the Symbols

Appendix: A Brief Guide to the Symbols

Symbol

Read

∀

forall

→

implies

\(\frac{A\hspace* {5mm} (A \rightarrow B)} {B}\)

From A and \((A \rightarrow B)\) infer B

∧

and

T

True

F

False

∨

or

¬

not

∃

there exists

(→-E)

→-elimination

(∨-E)

∨-elimination

(∧-E)

∧-elimination

(∃-E)

∃-elimination

(∀-E)

∀-elimination

(→-I)

→-introduction

(∨-I)

∨-introduction

(∧-I)

∧-introduction

(∃-I)

∃-introduction

(∀-I)

∀-introduction

⊥

False(the false proposition)

□

necessarily

◇

possibly

∈

is a member of

∉

is not a member of

a proof of A

a proof of B from A

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media B.V.

About this chapter

Cite this chapter

Crossley, J.N. (2011). What Is Mathematical Logic? A Survey. In: van Benthem, J., Gupta, A., Parikh, R. (eds) Proof, Computation and Agency. Synthese Library, vol 352. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-0080-2_1

Download citation

Publish with us

Policies and ethics