A stronger form of the theorem constructing a rigid binary relation on any set

Details A stronger form of the theorem constructing a rigid binary relation on any set A stronger form of the theorem constructing a rigid binary relation on any set

2001-07-02

arxiv.org/abs/math/0107009v4

Aequationes Mathematicae 66 (2003), pp. 257-260

Mathematics

Logic

an enlarged version, 8 pages

Scientific paper

10.1007/s00010-003-2676-8

On every set A there is a rigid binary relation i.e. such a relation R \subseteq A \times A that there is no homomorphism (A,R) \rightarrow (A,R) except the identity (Vop{\v{e}}nka et al. [1965]). We prove that for each infinite cardinal number \kappa if card A \leq 2^\kappa, then there exists a relation R \subseteq A \times A with the following property: \forall (x \in A) \exists ({x} \subseteq A(x) \subseteq A, card A(x) \leq \kappa) \forall (f: A(x) \rightarrow A, f \neq id_A(x)) f is not a homomorphism of R. The above property implies that R is rigid. If a relation R \subseteq A \times A has the above property, then card A \leq 2^\kappa.

Affiliated with

Also associated with

No associations

Rating

A stronger form of the theorem constructing a rigid binary relation on any set does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A stronger form of the theorem constructing a rigid binary relation on any set, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A stronger form of the theorem constructing a rigid binary relation on any set will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-286664