Formal Mathematical Logic

A Formal Mathematical Logic is a formal logic for mathematical statements.

• • …
• Counter-Example(s):
  • Philosophical Logic.
• See: Mathematical, Logic, Formal System, Mathematical Proof System, Mathematics, Metamathematics, Statistical Logic, Theoretical Computer Science.

---

---

References

2014a

• (Wikipedia, 2014) ⇒ http://en.wikipedia.org/wiki/Mathematical_logic Retrieved:2014-4-10.
  • Mathematical logic is a subfield of mathematics exploring the applications of formal logic to mathematics. Topically, mathematical logic bears close connections to metamathematics, the foundations of mathematics, and theoretical computer science. The unifying themes in mathematical logic include the study of the expressive power of formal systems and the deductive power of formal proof systems.

    Mathematical logic is often divided into the fields of set theory, model theory, recursion theory, and proof theory. These areas share basic results on logic, particularly first-order logic, and definability. In computer science (particularly in the ACM Classification) mathematical logic encompasses additional topics not detailed in this article; see logic in computer science for those.

    Since its inception, mathematical logic has both contributed to, and has been motivated by, the study of foundations of mathematics. This study began in the late 19th century with the development of axiomatic frameworks for geometry, arithmetic, and analysis. In the early 20th century it was shaped by David Hilbert's program to prove the consistency of foundational theories. Results of Kurt Gödel, Gerhard Gentzen, and others provided partial resolution to the program, and clarified the issues involved in proving consistency. Work in set theory showed that almost all ordinary mathematics can be formalized in terms of sets, although there are some theorems that cannot be proven in common axiom systems for set theory. Contemporary work in the foundations of mathematics often focuses on establishing which parts of mathematics can be formalized in particular formal systems (as in reverse mathematics) rather than trying to find theories in which all of mathematics can be developed.

2014b

• (Avigad & Harrison, 2014) ⇒ Jeremy Avigad, and John Harrison. (2014). “Formally Verified Mathematics.” In: Communications of the ACM Journal, 57(4).In: Communications of the ACM Journal, 57(4). doi:10.1145/2591012

2002

• (Boolos et al., 2002) ⇒ George Boolos, John Burgess, and Richard Jeffrey. (2002). “Computability and Logic (4th ed.)" Cambridge University Press. ISBN:9780521007580

2001

• Herbert Enderton. (2001). “A Mathematical Introduction to Logic (2nd ed.).” Academic Press, ISBN:978-0-12-238452-3 .
• Joseph R. Shoenfield. (2001). “Mathematical Logic (2nd ed.)" A K Peters. ISBN:978-1-56881-135-2

1997

• (Mendelson, 1997) ⇒ Elliott Mendelson. (1997). “Introduction to Mathematical Logic (4th ed.)" Chapman & Hall. ISBN:978-0-412-80830-2 .

1967

• (Shoenfield, 1967 => Joseph R. Shoenfield (1967). “Mathematical Logic (1st ed.).” Addison-Wesley. ISBN:0201070286

---