The theory of quaternality

Journal of Symbolic Logic 18 (3):193-196 (1953)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2267401

Other Versions

reprint Gottschalk, W. H. (1954) "The Theory of Quaternality". Journal of Symbolic Logic 19(3):229-230

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,388

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

Gottschalk W. H.. The theory of quaternality.Alan Ross Anderson - 1954 - Journal of Symbolic Logic 19 (3):229-230.
Reviews. Robert R. Stoll. Set theory and logic. W. H. Freeman and Company, San Francisco and London 1963, xiv + 474 pp. [REVIEW]G. T. Kneebone - 1964 - Journal of Symbolic Logic 29 (1):40-41.
ΠGarey Michael R. and Johnson David S.. Computers and intractability. A guide to the theory of NP-completeness. W. H. Freeman and Company, San Francisco 1979, x + 338 pp. [REVIEW]Harry R. Lewis - 1983 - Journal of Symbolic Logic 48 (2):498-500.
Robert W. Robinson. Simplicity of recursively enumerable sets.The journal of symbolic logic, vol. 32 , pp. 162–172. - Robert W. Robinson. Two theorems on hyperhypersimple sets. Transactions of the American Mathematical Society, vol. 128 , pp. 531–538. - A. H. Lachlan. On the lattice of recursively enumerable sets.Transactions of the American Mathematical Society, vol. 130 , pp. 1–37. - A. H. Lachlan. The elementary theory of recursively enumerable sets. Duke mathematical journal, vol. 35 , pp. 123–146. [REVIEW]James C. Owings - 1970 - Journal of Symbolic Logic 35 (1):153-155.
H. Jerome Keisler. Finite approximations of infinitely long formulas. The theory of models, Proceedings of the 1963 International Symposium at Berkeley, edited by J. W. Addison, Leon Henkin, and Alfred Tarski, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam1965, pp. 158–169. - H. Jerome Keisler. Some applications of infinitely long formulas. The journal of symbolic logic, vol. 30 , pp. 339–349. [REVIEW]Carol Karp - 1969 - Journal of Symbolic Logic 34 (1):129-130.
Burks Arthur W., McNaughton Robert, Pollmar Carl H., Warren Don W., and Wright Jesse B.. Complete decoding nets: general theory and minimality. Journal of the Society for Industrial and Applied Mathematics, vol. 2 , pp. 201–243. [REVIEW]Raymond J. Nelson - 1956 - Journal of Symbolic Logic 21 (2):210-210.
Review: George D. W. Berry, Philip P. Wiener, Frederic H. Young, Peirce's Contribution to the Logic of Statements and Quantifiers. [REVIEW]Rulon Wells - 1959 - Journal of Symbolic Logic 24 (3):209-211.

Analytics

Added to PP
2009-01-28

Downloads
54 (#418,521)

6 months
14 (#181,413)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The power of the hexagon.Jean-Yves Béziau - 2012 - Logica Universalis 6 (1-2):1-43.
Questions and Answers about Oppositions.Fabien Schang - 2011 - In Jean-Yves Beziau & Gillman Payette, The Square of Opposition: A General Framework for Cognition. Peter Lang. pp. 289-319.
Metalogical Decorations of Logical Diagrams.Lorenz Demey & Hans Smessaert - 2016 - Logica Universalis 10 (2-3):233-292.

View all 38 citations / Add more citations

References found in this work

No references found.

Add more references