Mathlib Map

Theorems · Theorem · logic and foundations

FirstOrder.Language.Relations.isQF

∀ {L : FirstOrder.Language} {α : Type u'} {n l : ℕ} (r : L.Relations l) (ts : Fin l → L.Term (α ⊕ Fin n)),
  (r.boundedFormula ts).IsQF
Defined in
Mathlib.ModelTheory.Complexity
Cited by
5 results in Mathlib
Foundations
Depth 6 from the axioms · uses no axioms
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

FirstOrder.Language.Relations.isUniversal_antisymmetric · cited by 0Relations.isUniversal_ant…FirstOrder.Language.Relations.isUniversal_reflexive · cited by 0Relations.isUniversal_ref…FirstOrder.Language.Relations.isUniversal_symmetric · cited by 0Relations.isUniversal_sym…FirstOrder.Language.Relations.isUniversal_total · cited by 0Relations.isUniversal_tot…FirstOrder.Language.Relations.isUniversal_transitive · cited by 0Relations.isUniversal_tra…FirstOrder.Language · cited by 1084FirstOrder.LanguageFirstOrder.Language.Term · cited by 166Language.TermFirstOrder.Language.Relations · cited by 147Language.RelationsFirstOrder.Language.BoundedFormula.IsQF · cited by 36BoundedFormula.IsQFFirstOrder.Language.BoundedFormula.IsAtomic.isQF · cited by 9IsAtomic.isQFFirstOrder.Language.Relations.boundedFormula · cited by 8Relations.boundedFormulaFirstOrder.Language.Relations.isAtomic · cited by 2Relations.isAtomicRelations.isQFCITED BYCITES

Cites7

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by5

Results whose statement or proof uses this declaration.