Induction on fields of binary relations

Notre Dame Journal of Formal Logic 13 (2):191-194 (1972)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,045

External links

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

Through your library

Similar books and articles

On induction.Rolf Schock - 1965 - Notre Dame Journal of Formal Logic 6 (3):235-240.
On $n$-equivalence of binary trees.Kees Doets - 1987 - Notre Dame Journal of Formal Logic 28 (2):238-243.
Binary consistent choice on triples.Robert H. Cowen - 1977 - Notre Dame Journal of Formal Logic 18 (2):310-312.
Vector spaces and binary quantifiers.Michał Krynicki, Alistair Lachlan & Jouko Väänänen - 1984 - Notre Dame Journal of Formal Logic 25 (1):72-78.
Career induction for quantifiers.Robert K. Meyer - 1980 - Notre Dame Journal of Formal Logic 21 (3):539-548.
Transitivity, supertransitivity and induction.W. Russell Belding, Richard L. Poss & Paul J. Welsh - 1972 - Notre Dame Journal of Formal Logic 13 (2):177-190.
Russell on the meaning of descriptions.Stephen Croddy - 1976 - Notre Dame Journal of Formal Logic 17 (3):424-428.
A note on: "Transitivity, supertransitivity and induction".W. Russell Belding & Richard L. Poss - 1973 - Notre Dame Journal of Formal Logic 14 (4):565-566.
Binary closure-algebraic operations that are functionally complete.Gerald J. Massey - 1970 - Notre Dame Journal of Formal Logic 11 (3):340-342.

Analytics

Added to PP
2010-08-24

Downloads
12 (#1,094,846)

6 months
7 (#592,005)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references