On n-valued functionally complete truth functions

Journal of Symbolic Logic 32 (2):190-195 (1967)
Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2271656
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,300
Through your library
References found in this work BETA
Complete Propositional Connectives.Roger F. Wheeler - 1961 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 7 (11-14):185-198.
An Asymptotic Formula for the Number of Complete Propositional Connectives.Roger F. Wheeler - 1962 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 8 (1):1-4.
Complete Propositional Connectives.Roger F. Wheeler - 1961 - Mathematical Logic Quarterly 7 (11‐14):185-198.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles
Added to PP index
2009-01-28

Total downloads
11 ( #412,243 of 2,193,222 )

Recent downloads (6 months)
1 ( #290,278 of 2,193,222 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature