Abstract

We characterize trees as median algebras and semilattices by relaxing conservativeness. Moreover, we describe median homomorphisms between products of median algebras and show that Arrow type impossibility theorems for mappings from a product A1×⋯×An\mathbf{A}_1\times \cdots \times \mathbf{A}_n of median algebras to a median algebra B\mathbf{B} are possible if and only if B\mathbf{B} is a tree, when thought of as an ordered structure.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.