On binary relations without non-identical endomorphisms

Simple item page
dc.creatorTyszka, Apoloniusz
dc.date2000-03-28
dc.date2000-05-06
dc.date.accessioned2026-07-07T06:31:30Z
dc.date.available2026-07-07T06:31:30Z
dc.descriptionOn every set A there is a rigid binary relation, i.e. such a relation R that there is no homomorphism (A,R)->(A,R) except the identity (Vopenka et al. [1965]). We state two conjectures which strengthen this theorem. We prove these conjectures for some cardinalities.
dc.description3rd version, minor changes, PostScript, submitted to Aequationes Math
dc.identifierhttps://arxiv.org/abs/math/0003181
dc.identifierhttp://arxiv.org/abs/math/0003181
dc.identifierAequationes Mathematicae 63 (2002), pp. 152-157
dc.identifierdoi:10.1007/s00010-002-8013-9
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/98623
dc.subjectLogic
dc.subjectCombinatorics
dc.subject03E05 (Primary), 08A35 (Primary)
dc.titleOn binary relations without non-identical endomorphisms
dc.typetext

Files

Collections

arXiv