RECORD
Pairs of partial orders and the amalgamation property
Logic · Submitted 10 Mar 2023
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim We show that the theories of partially ordered sets, lattices, semilattices, Boolean algebras, Heyting algebras with a further coarser partial order, or a linearization, or an auxiliary relation have the strong amalgamation property, Fra\"\i ss\'e limits and, in many cases, an $ \omega$-categorical model completion with quantifier elimination.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
We show that the theories of partially ordered sets, lattices, semilattices, Boolean algebras, Heyting algebras with a further coarser partial order, or a linearization, or an auxiliary relation have the strong amalgamation property, Fra\"\i ss\'e limits and, in many cases, an $ \omega$-categorical model completion with quantifier elimination. The same applies to Kronheimer and Penrose's causal spaces. On the other hand, Urquhart doubly ordered sets do not have the amalgamation property. Our main tool is the superamalgamation property (the strong amalgamation property is not enough), thus we provide further arguments suggesting the usefulness of the superamalgamation property also in pure model theory, not only in algebraic logic.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | We show that the theories of partially ordered sets, lattices, semilattices, Boolean algebras, Heyting algebras with a further coarser partial order, or a linearization, or an auxiliary relation have the strong amalgamation property, Fra\"\i ss\'e limits and, in many cases, an $ \omega$-categorical model completion with quantifier elimination. | result 0.89 | 0.93 | 0.79 | asserted 1.00 |
| s1 | The same applies to Kronheimer and Penrose's causal spaces. | result 0.97 | 0.54 | 0.06 | asserted 1.00 |
| s2 | On the other hand, Urquhart doubly ordered sets do not have the amalgamation property. | result 0.91 | 0.59 | 0.07 | asserted 1.00 |
| s3 | Our main tool is the superamalgamation property (the strong amalgamation property is not enough), thus we provide further arguments suggesting the usefulness of the superamalgamation property also in pure model theory, not only in algebraic logic. | method 0.64 | 0.87 | 0.23 | hedged possibility 0.70 |
What was examined, and what was not
- arXiv listing abstract v2
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
We show that the theories of partially ordered sets, lattices, semilattices, Boolean algebras, Heyting algebras with a further coarser partial order, or a linearization, or an auxiliary relation have the strong amalgamation property, Fra\"\i ss\'e limits and, in many cases, an $ \omega$-categorical model completion with quantifier elimination. The same applies to Kronheimer and Penrose's causal spaces. On the other hand, Urquhart doubly ordered sets do not have the amalgamation property. Our main tool is the superamalgamation property (the strong amalgamation property is not enough), thus we provide further arguments suggesting the usefulness of the superamalgamation property also in pure model theory, not only in algebraic logic.
Human review
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.