Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Next revision Both sides next revision | ||
|
sav08:predicate_logic_informally [2008/02/20 15:41] vkuncak |
sav08:predicate_logic_informally [2008/02/20 15:46] vkuncak |
||
|---|---|---|---|
| Line 48: | Line 48: | ||
| * if $t_1,\ldots,t_n$ are terms and $f$ is a function symbol that takes $n$ arguments, then $f(t_1,\ldots,t_n)$ is also a term. | * if $t_1,\ldots,t_n$ are terms and $f$ is a function symbol that takes $n$ arguments, then $f(t_1,\ldots,t_n)$ is also a term. | ||
| Example of constants are numerals for natural numbers, such as $0, 1, 2, \ldots$. Examples of function symbols are operations such as $+, -, /$. | Example of constants are numerals for natural numbers, such as $0, 1, 2, \ldots$. Examples of function symbols are operations such as $+, -, /$. | ||
| + | |||
| + | From above we see that the set of formulas depends on the set of predicate and function symbols. This set is is called //vocabulary// or //language//. | ||
| ==== Bounded Quantifiers ==== | ==== Bounded Quantifiers ==== | ||