On elementary theories of semilattices of partial orders on sets (Q1272003)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On elementary theories of semilattices of partial orders on sets |
scientific article; zbMATH DE number 1225834
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On elementary theories of semilattices of partial orders on sets |
scientific article; zbMATH DE number 1225834 |
Statements
On elementary theories of semilattices of partial orders on sets (English)
0 references
22 November 1998
0 references
In Algebra Univers. 28, No. 3, 324-338 (1991; Zbl 0743.03026), \textit{C. Naturman} and \textit{H. Rose} asked whether the model \(\langle A; \text{Ord} A; P^{3}\rangle\), with two basic sets, is interpretable in the semilattice \(O(A)=\langle \text{Ord} A; \cap\rangle\). Here \(\text{Ord} A\) is the collection of all partial orders on a set \(A\) and, for \(a,b,c, \in A\cup\text{Ord} A\), the predicate \(P^{3}\) is realized by the triple \(\langle a,b,c\rangle\) if and only if \(a,b\in A\), \(c\in\text{Ord} A\), and \(\langle a,b\rangle\in c\). The author gives a positive answer to the question. As a consequence, it is proven that, for arbitrary sets \(A\) and \(B\), the semilattices \(O(A)\) and \(O(B)\) are elementarily equivalent if and only if the theories of \(A\) and \(B\) (in the empty language) coincide in the complete second-order logic. A similar result is also proven for semilattices of quasiorders.
0 references
partial order
0 references
semilattice
0 references
interpretation
0 references
elementarily equivalent semilattices
0 references
complete second-order logic
0 references
0.9245455
0 references
0.92015004
0 references
0.9154311
0 references
0 references