An Asymptotic Formula for the Number of Complete Propositional Connectives

Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 8 (1):1-4 (1962)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19620080102

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,069

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

An Asymptotic Formula for the Number of Complete Propositional Connectives.Roger F. Wheeler - 1962 - Mathematical Logic Quarterly 8 (1):1-4.
Cuninghame-Green R. A.. Single primitive ternary connectives for the 2-valued prepositional calculus. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 5 , pp. 206–207.Wheeler Roger F.. Complete prepositional connectives. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 7 , pp. 185–198.Wheeler Roger F.. An asymptotic formula for the number of complete prepositional connectives. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 8 , pp. 1–4.Wheeler Roger F.. Complete connectives for the 3-vaIued prepositional calculus. Proceedings of the London Mathematical Society, ser. 3 vol. 16 , pp. 167–191. [REVIEW]Arto Salomaa - 1968 - Journal of Symbolic Logic 33 (1):127-128.
Single Primitive Ternary Connectives for the 2-Valued Propositional Calculus.R. A. Cuninghame-Green - 1959 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 5 (7-13):206-207.
Self-Dual Sets of Unary and Binary Connectives for the 3-Valued Propositional Calculus.Vivien Leigh - 1972 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 18 (13-15):201-204.
A Strongly Complete Formalisation of a 5-Valued Propositional Calculus.Alan Rose† - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (3):243-244.
The Complete Axiomatisation of any Many-Valued Propositional Logic.John Williamson - 1976 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 22 (1):299-306.
On Number of Lindenbaum's Oversystems of Propositional and Predicate Calculi.Teodor Stepień - 1985 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 31 (21-23):333-344.
Modal logics withn-ary connectives.S. Ghilardi & G. C. Meloni - 1990 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 36 (3):193-215.
Common Logic of 2-Valued Semigroup Connectives.Wolfgang Rautenberg - 1991 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 37 (9-12):187-192.
Relatively Complete Theories.D. W. H. Gillam - 1976 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 22 (1):245-250.

Analytics

Added to PP
2016-02-04

Downloads
24 (#678,992)

6 months
1 (#1,516,021)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On n-valued functionally complete truth functions.R. L. Graham - 1967 - Journal of Symbolic Logic 32 (2):190-195.

Add more citations

References found in this work

No references found.

Add more references