An Asymptotic Formula for the Number of Complete Propositional Connectives

Mathematical Logic Quarterly 8 (1):1-4 (1962)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,571

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

An algebraic approach to intuitionistic connectives.Xavier Caicedo & Roberto Cignoli - 2001 - Journal of Symbolic Logic 66 (4):1620-1636.
Complete Propositional Connectives.Roger F. Wheeler - 1961 - Mathematical Logic Quarterly 7 (11‐14):185-198.
Incompleteness and the Barcan formula.M. J. Cresswell - 1995 - Journal of Philosophical Logic 24 (4):379 - 403.
Counting proofs in propositional logic.René David & Marek Zaionc - 2009 - Archive for Mathematical Logic 48 (2):185-199.
On Combined Connectives.A. Sernadas, C. Sernadas & J. Rasga - 2011 - Logica Universalis 5 (2):205-224.
Arithmetical interpretations of dynamic logic.Petr Hájek - 1983 - Journal of Symbolic Logic 48 (3):704-713.
Definability of types, and pairs of o-minimal structures.Anand Pillay - 1994 - Journal of Symbolic Logic 59 (4):1400-1409.

Analytics

Added to PP
2013-11-24

Downloads
13 (#1,029,095)

6 months
1 (#1,470,413)

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