The number of moduli in $n$-ary relations

Notre Dame Journal of Formal Logic 1 (3):118-121 (1960)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1093956554

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,063

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

Robert E. Clay. A simple proof of functional completeness in many-valued logics based on Łukasiewicz's C and N. Notre Dame journal of formal logic, vol. 3 , pp. 114–117. - Robert E. Clay. Note on Stupecki T-functions. The journal of symbolic logic, vol. 27 no. 1 , pp. 53–54. [REVIEW]Arto Salomaa - 1965 - Journal of Symbolic Logic 30 (1):105.
Robert E. Clay. A standard form for Łukasiewicz many-valued logics. Notre Dame journal of formal logic, vol. 4 , pp. 59–66. [REVIEW]Arto Salomaa - 1965 - Journal of Symbolic Logic 30 (1):105-106.
Leo Simons. A reduction in the number of independent axiom schemata for S4. Notre Dame journal of formal logic, vol. 3 , pp. 256–258. - Bolesław Sobociński. An axiom-system for {K; N}-propositional calculus related to Simons' axiomatization of S3.Notre Dame journal of formal logic, vol. 3 , pp. 206–208. [REVIEW]Naoto Yonemitsu - 1967 - Journal of Symbolic Logic 32 (2):245.
$N$-polar logic of classes.Léon Birnbaum - 1980 - Notre Dame Journal of Formal Logic 21 (2):365-379.
A note on UDE's in an $n$-valued logic.T. C. Wesselkamper - 1974 - Notre Dame Journal of Formal Logic 15 (3):485-486.
Robert R. Tompkins. On Kleene's recursive realizability as an interpretation for intuitionistic elementary number theory. Notre Dame journal of formal logic, vol. 9 no. 4 , pp. 289–293. [REVIEW]R. E. Vesley - 1970 - Journal of Symbolic Logic 35 (3):475.
Formal nonassociative number theory.Dorothy Bollman - 1967 - Notre Dame Journal of Formal Logic 8 (1-2):9-16.
Consistency of $n$-order logics.William J. Thomas - 1976 - Notre Dame Journal of Formal Logic 17 (2):257-262.
On $n$-equivalence of binary trees.Kees Doets - 1987 - Notre Dame Journal of Formal Logic 28 (2):238-243.

Analytics

Added to PP
2010-08-24

Downloads
34 (#655,824)

6 months
10 (#379,980)

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