Some remarks on pseudotrees

DOI10.1007/S11083-005-9001-1MaRDI QIDQ2490419zbMATH OpenOpenAlexFDO

Authors Carlos Alós-Ferrer, Klaus Ritzberger

Publication date 2 May 2006

Published in Order (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11083-005-9001-1

zbMATH Keywords

chainconsistent setdirected setmaximal chainpseudotreeset representation

Mathematics Subject Classification ID

Partial orders, general (06A06)

Review text

A pseudotree is a poset such that every of its principal order ideals is a chain. The authors characterize pseudotrees as posets in which subchains, directed subsets and consistent subsets coincide. Further, they describe pseudotrees as posets that admit some set representation by means of sets of chains.

Recommendations

• Topologies on pseudo-trees and applications
• Pseudo-trees and Boolean algebras
• Publication:3495389
• Some characterizations of pseudo-chains in pseudo-ordered sets
• Pseudo treealgebras

Cites work

• A course in game theory.
• Cardinal functions on initial chain algebras on pseudotrees
• Chain-complete posets and directed sets with applications
• scientific article; zbMATH DE number 3078991 (Why is no real title available?)
• scientific article; zbMATH DE number 3103212 (Why is no real title available?)
• Initial chain algebras on pseudotrees
• Minimally generated Boolean algebras
• Pseudo-trees and Boolean algebras
• Trees and decisions

Cited in

(9)

• Pseudo-trees and Boolean algebras
• Large extensive form games
• A revelation principle for obviously strategy-proof implementation
• Retractions to Pseudoforests
• Topologies on pseudo-trees and applications
• scientific article; zbMATH DE number 4168727 (Why is no real title available?)
• Embeddings into outer models
• On pseudosimilarity in trees
• Trees and extensive forms

This page was built for publication: Some remarks on pseudotrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2490419)