η
© 2025 Ian Hornik
η
Foundations of Mathematics

Logic

Foundations of Mathematics

Estimated reading time: 3 min

Statements

To avoid ambiguity when expressing mathematical statements in various languages, which arises before even including slang, modern mathematicatians have moved to using an artifical, formalised language to express theories. This starts by specifying what a statement even is. Considering that a goal is to classify them into statements that are either true or false, we can say that a statement is a combination of natural and formal language that can be assigned a truthiness value of \top (true) and \bot (false).

If AA is a statement we write w(A)w(A) for the truthiness value of AA. For example for the statement A1=A_1 = “An ape is a fish” we would have w(A1)=w(A_1) = \bot, while the statement A2=A_2 = “A rose is a plant” would yield w(A2)=w(A_2) = \top.

The truthiness value of simple-looking statements often cannot be simply determined: One need only consider open, unsolved problems in mathematics:

A=e+π is rational",w(A)= ?A = \textrm{``}e + \pi \textrm{ is rational"}, \qquad w(A) = \ ?

Note that not any “sentence” results in a statement, since we may not be able to assign a (sensible) truthiness value, for example with “The number 3 is larger” and “If not yellow then red”.

Statements A,BA, B can also be composed together, via a few “elementary” operations:

  • ¬A\lnot A is the statement “not AA”, which is true if and only if AA is false.
  • ABA \lor B is the statement ”AA or BB”, which is true if and only if either AA or BB is true (or both).
  • ABA \land B is the statement ”AA and BB”, which is true if and only if both AA and BB are true.
  • A    BA \implies B is the statement ”AA implies BB”, which is true if and only if BB is always true if AA is also true.

Tautologies and Conclusions

Quantifiers

Proofs