Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-16T18:53:23.668Z Has data issue: false hasContentIssue false

Trees

Published online by Cambridge University Press:  12 March 2014

Thomas J. Jech*
Affiliation:
Charles University Prague, Czechoslovakia

Extract

This is an attempt to give a survey of recent results concerning trees. The article is an extended version of our talk in Oberwolfach (Schwarzwald) last May; the forests surrounding the Forschungsinstitut turned out to be a good inspiration.

A tree is a partially ordered set T = (T, ≤) such that for every x ∈ T, the set = {y ∈ T: y < x} is well-ordered. The order type of is called the order of x, o(x), and the length of T is sup {o(x) + 1: x ∈ T}; an α-tree (where α is an ordinal) is a tree of length α. The αth level of T is the set Uα of all elements of T whose order is α. T∣α is the union of all Uβ, β < α; its length is α. A tree (T2, ≤2) is called an extension of (T1, ≤1) if ≤1 = ≤2 ∩ (T1 × T1); T2 is on end-extension of (T1 if T1 = T2∣α for some α. A maximal linearly ordered subset of a tree T is called a branch of T; an α-branch is a branch of length α.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1971

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable