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

&
Mathematical Logic Quarterly 38 (1):157-168 (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

Categories

Keywords

Reprint years

DOI

10.1002/malq.19920380111

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,611

External links

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

Through your library

My notes

Similar books and articles

Reconstruction of binary relations from their restrictions of cardinality 2, 3, 4 and (n ‐ 1) I.Gérard Lopez & Claire Rauzy - 1992 - Mathematical Logic Quarterly 38 (1):27-37.
Positive fragments of relevance logic and algebras of binary relations.Robin Hirsch & Szabolcs Mikulás - 2011 - Review of Symbolic Logic 4 (1):81-105.
On Some Generalizations of the Concept of Partition.Marek Nowak - 2014 - Studia Logica 102 (1):93-116.
Monadic second order definable relations on the binary tree.Hans Läuchli & Christian Savioz - 1987 - Journal of Symbolic Logic 52 (1):219-226.
La reconstruction Des tournois sans diamant.Cyprien Gnanvo & Pierre Ille - 1992 - Mathematical Logic Quarterly 38 (1):283-291.
Relevance logic and the calculus of relations.Roger D. Maddux - 2010 - Review of Symbolic Logic 3 (1):41-70.
Binary Relations: Finite Characterizations and Computational Complexity. [REVIEW]Vicki Knoblauch - 2008 - Theory and Decision 65 (1):27-44.
Groups and algebras of binary relations.Steven Givant & Hajnal Andréka - 2002 - Bulletin of Symbolic Logic 8 (1):38-64.
Undecidability of representability as binary relations.Robin Hirsch & Marcel Jackson - 2012 - Journal of Symbolic Logic 77 (4):1211-1244.
Representability of Ordinal Relations on a Set of Conditional Events.Giulianella Coletti & Barbara Vantaggi - 2006 - Theory and Decision 60 (2-3):137-174.
Does recoding from binary to octal improve the perception of binary patterns?E. T. Klemmer - 1964 - Journal of Experimental Psychology 67 (1):19.
On transitive subrelations of binary relations.Christopher S. Hardin - 2011 - Journal of Symbolic Logic 76 (4):1429-1440.
Dynamic relation logic is the logic of DPL-Relations.Albert Visser - 1997 - Journal of Logic, Language and Information 6 (4):441-452.
Modal logics for reasoning about infinite unions and intersections of binary relations.Natasha Alechina, Philippe Balbiani & Dmitry Shkatov - 2012 - Journal of Applied Non-Classical Logics 22 (4):275 - 294.
Bicartesian coherence.Kosta Došen & Zoran Petrić - 2002 - Studia Logica 71 (3):331 - 353.

Analytics

Added to PP
2013-12-01

Downloads
17 (#875,159)

6 months
4 (#799,256)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

No references found.

Add more references