Theorems · Definition · logic and foundations
FirstOrder.Language.dlo
(L : FirstOrder.Language) → [L.IsOrdered] → L.Theory
The theory of dense linear orders without endpoints.
- Defined in
- Mathlib.ModelTheory.Order
- Cited by
- 8 results in Mathlib
- Foundations
- Depth 37 from the axioms · uses propext
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- FirstOrder.Languagestatement and proof · cited by 1,084
- FirstOrder.Language.Theorystatement · cited by 154
- FirstOrder.Language.IsOrderedstatement and proof · cited by 19
- FirstOrder.Language.linearOrderTheoryproof · cited by 7
- FirstOrder.Language.denselyOrderedSentenceproof · cited by 5
- FirstOrder.Language.noBotOrderSentenceproof · cited by 5
- FirstOrder.Language.noTopOrderSentenceproof · cited by 5
Cited by8
Results whose statement or proof uses this declaration.
- FirstOrder.Language.isFraisseLimit_of_countable_nonempty_dlostatement and proof · cited by 2
- FirstOrder.Language.aleph0_categorical_dlostatement and proof · cited by 1
- FirstOrder.Language.denselyOrdered_of_dlostatement and proof · cited by 1
- FirstOrder.Language.noBotOrder_of_dlostatement and proof · cited by 1
- FirstOrder.Language.noTopOrder_of_dlostatement and proof · cited by 1
- FirstOrder.Language.dlo_agestatement and proof · cited by 1
- FirstOrder.Language.dlo_isExtensionPairstatement and proof · cited by 1
- FirstOrder.Language.dlo_isCompletestatement and proof · cited by 0