Some theorems about the sentential calculi of Lewis and Heyting

&
Journal of Symbolic Logic 13 (1):1-15 (1948)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2268135

Other Versions

reprint Mckinsey, J. C. C.; Tarski, Alfred (1948) "Some Theorems About the Sentential Calculi of Lewis and Heyting". Journal of Symbolic Logic 13(3):171-172

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 104,143

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

McKinsey J. C. C. and Tarski Alfred. Some theorems about the sentential calculi of Lewis and Heyting. [REVIEW]Leon Henkin - 1948 - Journal of Symbolic Logic 13 (3):171-172.
Review: J. C. C. McKinsey, On the Number of Complete Extensions of the Lewis Systems of Sentential Calculus. [REVIEW]Frederic B. Fitch - 1944 - Journal of Symbolic Logic 9 (4):96-96.
McKinsey J. C. C. and Tarski Alfred. The algebra of topology. Annals of mathematics, ser. 2 vol. 45 , pp. 141–191.H. E. Vaughan - 1944 - Journal of Symbolic Logic 9 (4):96-97.
McKinsey J. C. C. and Tarski Alfred. On closed elements in closure algebras. Annals of mathematics, ser. 2 vol. 47 , pp. 122–162. [REVIEW]Albert A. Bennett - 1946 - Journal of Symbolic Logic 11 (3):83-84.
Tarski Alfred. A decision method for elementary algebra and geometry. Prepared for publication with the assistance of J. C. C. McKinsey. Second edition, revised. Lithoprinted. University of California Press, Berkeley and Los Angeles 1951, iii + 63 pp. [REVIEW]Leon Henkin - 1952 - Journal of Symbolic Logic 17 (3):207-207.
Tarski Alfred. A decision method for elementary algebra and geometry. U. S. Air Force Project Rand, R-109. Prepared for publication by J. C. C. McKinsey. Litho-printed. The Rand Corporation, Santa Monica, California, 1948, iii + 60 pp. [REVIEW]Leon Henkin - 1949 - Journal of Symbolic Logic 14 (3):188-188.
Review: J. C. C. McKinsey, A Solution of the Decision Problem for the Lewis Systems S2 and S4, With an Application to Topology. [REVIEW]W. T. Parry - 1942 - Journal of Symbolic Logic 7 (3):118-119.
McKinsey J. C. C.. On the generation of the functions Cpq and Np of Lukasiewicz and Tarski by means of a single binary operation. Bulletin of the American Mathematical Society, vol. 42 , pp. 849–851. [REVIEW]W. V. Quine - 1937 - Journal of Symbolic Logic 2 (1):59-59.
McKinsey J. C. C.. The decision problem for some classes of sentences without quantifiers. [REVIEW]P. Lagerström - 1944 - Journal of Symbolic Logic 9 (1):30-31.

Analytics

Added to PP
2009-01-28

Downloads
193 (#132,591)

6 months
15 (#201,895)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Explicit provability and constructive semantics.Sergei N. Artemov - 2001 - Bulletin of Symbolic Logic 7 (1):1-36.
The Orthologic of Epistemic Modals.Wesley H. Holliday & Matthew Mandelkern - 2024 - Journal of Philosophical Logic 53 (4):831-907.
The genesis of possible worlds semantics.B. Jack Copeland - 2002 - Journal of Philosophical Logic 31 (2):99-137.
Ideological innocence.Daniel Rubio - 2022 - Synthese 200 (5):1-22.
Modal Logics Between S 4 and S 5.M. A. E. Dummett & E. J. Lemmon - 1959 - Mathematical Logic Quarterly 5 (14-24):250-264.

View all 147 citations / Add more citations

References found in this work

Symbolic Logic.C. I. Lewis & C. H. Langford - 1932 - Erkenntnis 4 (1):65-66.

Add more references