Complete Propositional Connectives

Mathematical Logic Quarterly 7 (11-14):185-198 (1961)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19610071106

Other Versions

No versions found

Links

PhilArchive



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

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.
Simple characterization of functionally complete one‐element sets of propositional connectives.Petar Maksimović & Predrag Janičić - 2006 - Mathematical Logic Quarterly 52 (5):498-504.
Single Primitive Ternary Connectives for the 2‐Valued Propositional Calculus.R. A. Cuninghame-Green - 1959 - Mathematical Logic Quarterly 5 (7‐13):206-207.
Self‐Dual Sets of Unary and Binary Connectives for the 3‐Valued Propositional Calculus.Vivien Leigh - 1972 - Mathematical Logic Quarterly 18 (13‐15):201-204.
The Complete Axiomatisation of any Many‐Valued Propositional Logic.John Williamson - 1976 - Mathematical Logic Quarterly 22 (1):299-306.
On the polynomial-space completeness of intuitionistic propositional logic.Vítězslav Švejdar - 2003 - Archive for Mathematical Logic 42 (7):711-716.
A Strongly Complete Formalisation of a 5‐Valued Propositional Calculus.Alan Rose† - 1987 - Mathematical Logic Quarterly 33 (3):243-244.
Cn-definitions of propositional connectives.Witold A. Pogorzelski & Piotr Wojtylak - 2001 - Studia Logica 67 (1):1-26.

Analytics

Added to PP
2013-11-24

Downloads
40 (#559,342)

6 months
5 (#1,035,700)

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