Tang Tsao-Chen. The theorem “p⊰q. =.pq = p” and Huntington's relation between Lewis's strict implication and Boolean algebra. Bulletin of the American Mathematical Society, vol. 42 (1936), pp. 743–746 [Book Review]

Journal of Symbolic Logic 2 (1):58-58 (1937)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2268849

Links

PhilArchive



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

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

Review: J. C. C. McKinsey, On Boolean Functions of many Variables. [REVIEW]Paul Henle - 1937 - Journal of Symbolic Logic 2 (1):58-59.
Optimal Synthesis of the Boolean Functions of Four Variables with Majority Logic.Joel Howard Cyprus - 1964
On the Number of Symmetry Types of Boolean Functions of n Variables.David Slepian - 1955 - Journal of Symbolic Logic 20 (1):70-70.
Review: U. L. Vasil'ev, Minimal Switching Circuits for Boolean Functions of Four Variables. [REVIEW]Andrzej Harland - 1965 - Journal of Symbolic Logic 30 (2):246-247.
Review: David Slepian, On the Number of Symmetry Types of Boolean Functions of $n$ Variables. [REVIEW]Raymond J. Nelson - 1955 - Journal of Symbolic Logic 20 (1):70-70.
Boolean-Valued Second-Order Logic.Daisuke Ikegami & Jouko Väänänen - 2015 - Notre Dame Journal of Formal Logic 56 (1):167-190.
Special subalgebras of Boolean algebras.J. Donald Monk - 2010 - Mathematical Logic Quarterly 56 (2):148-158.
Effectivity functions and efficient coalitions in Boolean games.Elise Bonzon, Marie-Christine Lagasquie-Schiex & Jérôme Lang - 2012 - Synthese 187 (S1):73-103.
Review: F.I. Andon, Ob odnom podhode k minimizacii sistem buleoyh funkcij (On One Approach to the Minimization of Systems of Boolean Functions); F. I. Andon, Algoritm uproscenia d.n.f. bulevyh funckij (A Simplification Alogorithm of a Disjunctive Normal Form of the Boolean Functions). [REVIEW]A. Adam - 1970 - Journal of Symbolic Logic 35 (2):330-330.
Existence of Finite Total Equivalence Systems for Certain Closed Classes of 3-Valued Logic Functions.Ilya Makarov - 2015 - Logica Universalis 9 (1):1-26.
J. C. C. McKinsey. Boolean functions and points. Duke mathematical journal, vol. 2 (1936), pp. 465–471.J. C. C. Mckinsey - 1937 - Journal of Symbolic Logic 2 (1):41-41.
Reducible Boolean Functions.J. C. C. Mckinsey - 1936 - Journal of Symbolic Logic 1 (2):69-69.
Minimum‐sized Infinite Partitions of Boolean Algebras.J. Donald Monk - 1996 - Mathematical Logic Quarterly 42 (1):537-550.
On variables in mathematics and in natural science.Karl Menger - 1954 - British Journal for the Philosophy of Science 5 (18):134-142.
Review: J. C. C. McKinsey, Reducible Boolean Functions. [REVIEW]Alonzo Church - 1936 - Journal of Symbolic Logic 1 (2):69-69.

Analytics

Added to PP
2015-02-05

Downloads
8 (#1,310,468)

6 months
5 (#627,481)

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