Theorems · Inductive type · logic and foundations
FirstOrder.Language.BoundedFormula.IsQF
{L : FirstOrder.Language} → {α : Type u'} → {n : ℕ} → L.BoundedFormula α n → PropA quantifier-free formula is a formula defined without quantifiers. These are all equivalent to Boolean combinations of atomic formulas.
- Defined in
- Mathlib.ModelTheory.Complexity
- Cited by
- 36 results in Mathlib
- Foundations
- Depth 2 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- FirstOrder.Languagestatement · cited by 1,084
- FirstOrder.Language.BoundedFormulastatement · cited by 207
Cited by49
Results whose statement or proof uses this declaration.
- FirstOrder.Language.BoundedFormula.IsAtomic.isQFstatement · cited by 9
- FirstOrder.Language.BoundedFormula.IsQF.isUniversalstatement · cited by 7
- FirstOrder.Language.BoundedFormula.IsQF.isPrenexstatement · cited by 6
- FirstOrder.Language.BoundedFormula.isQF_botstatement · cited by 6
- FirstOrder.Language.Relations.isQFstatement · cited by 5
- FirstOrder.Language.BoundedFormula.IsPrenex.recOnstatement and proof · cited by 4
- FirstOrder.Language.BoundedFormula.IsQF.notstatement and proof · cited by 4
- FirstOrder.Language.BoundedFormula.IsQF.recOnstatement and proof · cited by 4
- FirstOrder.Language.BoundedFormula.IsQF.liftAtstatement and proof · cited by 3
- FirstOrder.Language.BoundedFormula.IsPrenex.liftAtproof · cited by 2
- FirstOrder.Language.BoundedFormula.IsQF.casesOnstatement and proof · cited by 2
- FirstOrder.Language.BoundedFormula.IsQF.realize_embeddingstatement and proof · cited by 2