Difference between revisions of "First-order language"
Jump to navigation
Jump to search
(added more links, bit more explanation.) |
DavidB4-bot (talk | contribs) (→top: clean up & uniformity) |
||
| (One intermediate revision by one other user not shown) | |||
| Line 11: | Line 11: | ||
First-order languages are used to describe [[mathematics]] in [[mathematical notation]] with [[mathematical formula]]e. | First-order languages are used to describe [[mathematics]] in [[mathematical notation]] with [[mathematical formula]]e. | ||
| − | [[ | + | [[Category:Language]] |
| − | [[ | + | [[Category:Logic]] |
| − | [[ | + | [[Category:Mathematics]] |
Latest revision as of 13:00, July 13, 2016
A First-order language in Zermelo-Fraenkel set theory consists of the following symbols:
- A set of constants, such as A, B, C, ...
- A set of n-ary relations such as >(x, y).
- A set of n-ary functions such as +(x, y).
- An infinite set of variables such as x, y, z,...
- The connectives <math>\neg</math>, <math>\wedge</math>.
- quantifiers: <math>\forall</math>, <math>\exists</math>.
- parenthesis: <math>(</math>, <math>)</math>.
- The equality symbol <math>=</math>.
First-order languages are used to describe mathematics in mathematical notation with mathematical formulae.