An Analysis of a Logical Machine Using Parenthesis-Free Notation

Journal of Symbolic Logic 20 (1):70-71 (1955)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,611

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Four simple systems of modal propositional logic.Gerald J. Massey - 1965 - Philosophy of Science 32 (3/4):342-355.
Organization of Addressless Computers Working in Parenthesis Notation.Zdzisław Pawlar - 1963 - Mathematical Logic Quarterly 9 (16‐17):243-249.
Grammatical structures and logical deductions.Wojciech Buszkowski - 1995 - Logic and Logical Philosophy 3:47-86.
New Method of Parenthesis-Free Notations of Formulae.Z. Pawlak - 1966 - Journal of Symbolic Logic 31 (1):115-115.
Peirce's contribution to american cryptography.Yvan Beaulieu - 2008 - Transactions of the Charles S. Peirce Society 44 (2):pp. 263-287.

Analytics

Added to PP
2015-02-05

Downloads
20 (#773,462)

6 months
4 (#799,256)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

From Curry to Haskell.Felice Cardone - 2020 - Philosophy and Technology 34 (1):57-74.

Add more citations

References found in this work

No references found.

Add more references