Theorems · Theorem · logic and foundations
FirstOrder.Language.isFraisse_finite_linear_order
FirstOrder.Language.IsFraisse {M | Finite ↑M ∧ ↑M ⊨ FirstOrder.Language.order.linearOrderTheory}The class of finite models of the theory of linear orders is Fraïssé.
- Defined in
- Mathlib.ModelTheory.Order
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 109 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites12
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Set.ofPredstatement and proof · cited by 6,101
- Finitestatement and proof · cited by 3,029
- FirstOrder.Language.Structurestatement and proof · cited by 775
- CategoryTheory.Bundled.αstatement and proof · cited by 736
- FirstOrder.Language.Theory.Modelstatement and proof · cited by 67
- CategoryTheory.Bundledstatement and proof · cited by 42
- FirstOrder.Language.orderstatement and proof · cited by 14
- FirstOrder.Language.IsFraissestatement · cited by 11
- FirstOrder.Language.linearOrderTheorystatement and proof · cited by 7
- FirstOrder.Language.isFraisseLimit_of_countable_nonempty_dloproof · cited by 2
- FirstOrder.Language.IsFraisseLimit.isFraisseproof · cited by 2
- FirstOrder.Language.orderStructureproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.