Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T23:28:27.154Z Has data issue: false hasContentIssue false

Slim trees

Part of:Ordered sets

Published online by Cambridge University Press:  09 April 2009

Elliott Evans
Affiliation:
Department of Computer Science, University of Tennessee, Knoxville, Tennessee 37916, U.S.A.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

A semilattice tree T with 0 is slim if there is a chain C with 0 so that the lattices θ (T) and θ(C) of semilattice congruences are isomorphic. This paper establishes elementary consequences of slimness and uses simple constructive techniques to show certain small trees slim. If T is the union of at most countably many branches, each of which has a maximum or a countable cotinal subset, then T is slim. For trees with enough maximals slimness is equivalent with not having any uncountable anti-chains. If a tree T has a countable cofinal subset then T is slim. Thus finitary trees are slim.

MSC classification

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1980