Sign inSign in
ConceptMathematics

Weak embedding

A weak embedding T≤∗T′T \le^* T' is a function from TT to T′T' that preserves the tree order relation.
as Mirna Džamonja defines itUniversity of East Anglia
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.

Tree2Ordinal height1Partial order1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1

    Connections

    4

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

    Concepts3

    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.