Documentation

InfinitaryLogic.Scott.Height.Defs

Scott Height: Definition and Core Properties #

The Scott height of a structure M is the least ordinal at which the Scott formula analysis stabilizes for all tuples simultaneously.

Main Definitions #

Main Results #

noncomputable def FirstOrder.Language.scottHeight {L : Language} (M : Type w) [L.Structure M] [Countable M] :

The Scott height of a structure M: the least ordinal at which the Scott formula analysis stabilizes for all tuples simultaneously.

This is defined as the least ordinal α such that for all n and all tuples a : Fin n → M, if a structure N satisfies scottFormula a α, then it also satisfies scottFormula a (α + 1), and vice versa.

Equivalently, this is the least α where BFEquiv α n a b implies BFEquiv (α + 1) n a b for all tuples.

Scott height is related to but may differ from Scott rank. We always have scottHeight ≤ scottRank.

Equations
  • One or more equations did not get rendered due to their size.
Instances For

    At any ordinal ≥ scottHeight, the structure stabilizes completely. Conditional on CountableRefinementHypothesis.

    Scott height is less than ω₁ for countable structures.

    At Scott height, all tuple sizes have stabilized (BFEquiv α ↔ BFEquiv (succ α)).

    Scott height is invariant under L-isomorphism.