Mathlib Map

Theorems · Inductive type · logic and foundations

FirstOrder.Language.BoundedFormula.IsQF

{L : FirstOrder.Language} → {α : Type u'} → {n : ℕ} → L.BoundedFormula α n → Prop

A 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.

Cited by49

Results whose statement or proof uses this declaration.