Prefix classes of Krom formulas

Journal of Symbolic Logic 38 (4):628-642 (1973)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

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

External links

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

Through your library

Analytics

Added to PP
2009-01-28

Downloads
89 (#248,057)

6 months
26 (#125,448)

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

Introduction to Mathematical Logic.Max Black - 1956 - Journal of Symbolic Logic 22 (3):286-289.
The Decision Problem for a Class of First-Order Formulas in Which all Disjunctions are Binary.M. R. Krom - 1967 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 13 (1-2):15-20.
The Mathematical Theory of Context Free Languages.Seymour Ginsburg - 1968 - Journal of Symbolic Logic 33 (2):300-301.

Add more references