Gerald J. Massey. Binary closure-algebraic operations that are functionally complete. Notre Dame journal of formal logic, vol. 11 , pp. 340–342 [Book Review]

Journal of Symbolic Logic 36 (4):691 (1971)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272521

Links

PhilArchive



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

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

Binary closure-algebraic operations that are functionally complete.Gerald J. Massey - 1970 - Notre Dame Journal of Formal Logic 11 (3):340-342.
Review: Gerald J. Massey, Binary Closure-Algebraic Operations that are Functionally Complete. [REVIEW]R. A. Bull - 1971 - Journal of Symbolic Logic 36 (4):691-691.
Note on G. J. Massey's closure-algebraic operation.Bolesław Sobociński - 1970 - Notre Dame Journal of Formal Logic 11 (3):343-346.
Errata: ``Note on G. J. Massey's closure-algebraic operation''.Bolesław Sobociński - 1973 - Notre Dame Journal of Formal Logic 14 (4):584-584.
Binary connectives functionally complete by themselves in s5 modal logic.Gerald J. Massey - 1967 - Journal of Symbolic Logic 32 (1):91-92.
An extension of Venn diagrams.Gerald J. Massey - 1966 - Notre Dame Journal of Formal Logic 7 (3):239-250.
Note on Copi's system.Gerald J. Massey - 1963 - Notre Dame Journal of Formal Logic 4 (2):140-141.
Concerning an alleged Sheffer function.Gerald J. Massey - 1975 - Notre Dame Journal of Formal Logic 16 (4):549-550.
Gerald J. Massey. The theory of truth tabular connectives, both truth functional and modal. The journal of symbolic logic, vol. 31 , pp. 593–608. - Gerald J. Massey. Binary connectives functionally complete by themselves in S5 modal logic. The journal of symbolic logic, vol. 32 , pp. 91–92. [REVIEW]M. K. Rennie - 1972 - Journal of Symbolic Logic 37 (1):183-184.
Every functionally complete $m$-valued logic has a Post-complete axiomatization.Nuel D. Belnap & Storrs McCall - 1970 - Notre Dame Journal of Formal Logic 11 (1):106-106.
Negation, material equivalence, and conditioned nonconjunction: completeness and duality.Gerald J. Massey - 1977 - Notre Dame Journal of Formal Logic 18 (1):140-144.
The modal structure of the Prior-Rescher family of infinite product systems.Gerald J. Massey - 1972 - Notre Dame Journal of Formal Logic 13 (2):219-223.
Finite axiomatizability and theories with trivial algebraic closure.Dugald Macpherson - 1991 - Notre Dame Journal of Formal Logic 32 (2):188-192.
Desmond Paul Henry. The truncation of truth-functional calculation. Notre Dame journal of formal logic, vol. 2 , pp. 193–205. [REVIEW]Gerald J. Massey & Carl J. Posy - 1974 - Journal of Symbolic Logic 39 (1):174.
Complementation in Representable Theories of Region-Based Space.Torsten Hahmann & Michael Grüninger - 2013 - Notre Dame Journal of Formal Logic 54 (2):177-214.

Analytics

Added to PP
2016-06-30

Downloads
31 (#486,401)

6 months
2 (#1,136,865)

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