Sign inSign in
ConceptMathematics

Satisfaction class

A binary relation on a model of PA whose slices represent sets of formulas, agree with standard truth predicates on standard indices, and satisfy PA in the expanded language.
as Corey Switzer defines itUniversity of Oxford
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Aronszajn tree1Forcing1Formal syntax in logic1Induction schema1Kaufmann model1Model1Model theory1Models of Peano arithmetic1

Lecturers

1

    Connections

    3

    The lectures that define it or assume it, and the concepts next to it.

    Concepts2

    Lecture1

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.