Some remarks on pseudotrees

Carlos Alós-Ferrer, Klaus Ritzberger

Research output: Contribution to journalArticlepeer-review


This paper provides new results on pseudotrees. First, it is shown that pseudotrees are precisely those posets for which consistent sets, directed sets, and nonempty chains coincide. Second, we show that chain-complete pseudotrees yield complete meet-semilattices. Third, we prove that pseudotrees are precisely those posets that admit a set representation by sets of appropriate chains. This latter result generalizes results needed for applications in game theory and economics.

Original languageEnglish (US)
Pages (from-to)1-9
Number of pages9
Issue number1
StatePublished - Feb 2005

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Geometry and Topology
  • Computational Theory and Mathematics


Dive into the research topics of 'Some remarks on pseudotrees'. Together they form a unique fingerprint.

Cite this