Formalisation of Parenthesis-Free Languages

Mathematical Logic Quarterly 12 (1):177-186 (1966)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19660120113

Links

PhilArchive



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

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: Seymour Ginsburg, The Mathematical Theory of Context Free Languages. [REVIEW]Andrzej Blikle - 1968 - Journal of Symbolic Logic 33 (2):300-301.
New Method of Parenthesis-Free Notations of Formulae.Z. Pawlak - 1966 - Journal of Symbolic Logic 31 (1):115-115.
Four simple systems of modal propositional logic.Gerald J. Massey - 1965 - Philosophy of Science 32 (3/4):342-355.
On isomorphic formalisations.Routen Tom - 1996 - Artificial Intelligence and Law 4 (2):113-132.
Review: Z. Pawlak, New Method of Parenthesis-Free Notations of Formulae. [REVIEW]Frederic B. Fitch - 1966 - Journal of Symbolic Logic 31 (1):115-115.
An Analysis of a Logical Machine Using Parenthesis-Free Notation.Arthur W. Burks, Don W. Warren & Jesse B. Wright - 1955 - Journal of Symbolic Logic 20 (1):70-71.
Some Properties of Iterated Languages.Shane Steinert-Threlkeld - 2016 - Journal of Logic, Language and Information 25 (2):191-213.
Review: Arthur W. Burks, Don W. Warren, Jesse B. Wright, An Analysis of a Logical Machine Using Parenthesis-Free Notation. [REVIEW]Raymond J. Nelson - 1955 - Journal of Symbolic Logic 20 (1):70-71.
Ginsburg Seymour. The mathematical theory of context free languages. McGraw-Hill Book Company, New York, San Francisco, St, Louis, Toronto, London, and Sydney, 1966, xii + 232 pp. [REVIEW]Andrzej Blikle - 1968 - Journal of Symbolic Logic 33 (2):300-301.
Formal languages defined by the underlying structure of their words.J. P. Ressayre - 1988 - Journal of Symbolic Logic 53 (4):1009-1026.
Burks Arthur W., Warren Don W., and Wrights Jesse B.. An analysis of a logical machine using parenthesis-free notation. Mathematical tables and other aids to computation, vol. 8 , pp. 53–57. [REVIEW]Raymond J. Nelson - 1955 - Journal of Symbolic Logic 20 (1):70-71.
A mathematical theory of parenthesis, free notations.William James Meyers - 1975 - Warszawa: Państwowe Wydawn. Naukowe.
Pawlak Z.. New method of parenthesis-free notations of formulae. Bulletin de l'Académie Polonaise des Sciences, Série des sciences techniques, vol. 8 no. 4 (1960), pp. 197–198. [REVIEW]Frederic B. Fitch - 1966 - Journal of Symbolic Logic 31 (1):115-115.
A descriptive characterisation of linear languages.Tore Langholm - 2006 - Journal of Logic, Language and Information 15 (3):233-250.
Squares of regular languages.Gerhard Lischke - 2005 - Mathematical Logic Quarterly 51 (3):299.

Analytics

Added to PP
2014-01-16

Downloads
26 (#595,031)

6 months
1 (#1,510,037)

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