Mathematical logic and foundations Example
Herbrand universe
Builds on Absolutely free algebraTerm algebraHerbrand's theorem
Example
Let be a first-order language with at least one constant symbol; if it has none, one constant is added. The Herbrand universe is the set of ground terms of , the terms that contain no variables. It is the smallest set that contains every constant symbol of and contains whenever is an -ary function symbol and .
With the function symbols acting by the term , the set is the term algebra on the empty set of variables. So it is the absolutely free algebra on no generators. Check: every map from the empty set extends uniquely. Indeed, a homomorphism to any algebra must send each ground term to its value in .
For with one constant and one unary symbol , the universe is , a copy of . For with one constant and one binary symbol , it contains , , , , and so on. There is one element for each binary tree.
Reading path
To understand this page from the ground up, read these 8 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Absolutely free algebra concept
- Satisfiability concept
- Signature concept
- Skolem normal form concept
- Term concept
- Term algebra concept
- Herbrand's theorem statement
- Herbrand universe example
Further reading
About this page
| Tag | 2BVB7YDEV4 |
|---|---|
| URI | m2://2BVB7YDEV4 |
| Kind | example |
| Writing | W0 stub |
| MSC | 03B10, 08B20 |
| Instance of | Absolutely free algebra |
| Uses | Absolutely free algebra, Term algebra, Herbrand's theorem |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.