Reconstruction of binary relations from their restrictions of cardinality 2, 3, 4 and (n ‐ 1) I

Mathematical Logic Quarterly 38 (1):27-37 (1992)
  Copy   BIBTEX

Abstract

We shall prove here that any binary relation on a base E with cardinality n > 6 is reconstructible from its restrictions of cardinality 2, 3, 4 and . This proof needs results of part I of this paper where we characterize any pair of relations R, R' which are 2-, 3- and 4-hypomorphic. As a corollary we obtain that any binary relation is -reconstructible

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,337

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2013-12-01

Downloads
22 (#972,197)

6 months
4 (#1,247,585)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references