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)

Categories

Keywords

Reprint years

DOI

10.2307/2271987

Other Versions

No versions found

Links

PhilArchive



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

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

Conservative reduction classes of Krom formulas.Stål O. Aanderaa, Egon Börger & Harry R. Lewis - 1982 - Journal of Symbolic Logic 47 (1):110-130.
Harry R. Lewis. Unsolvable classes of quantificational formulas. Advanced book program. Addison-Wesley Publishing Company, Reading, Mass., 1979, xv + 198 pp. [REVIEW]Dieter Rodding - 1982 - Journal of Symbolic Logic 47 (1):221-222.
Review: Burton Dreben, Stal Aanderaa, Herbrand Analyzing Functions. [REVIEW]Peter Andrews - 1967 - Journal of Symbolic Logic 32 (4):521-521.
Burton Dreben and Stål Aanderaa. Herbrand analyzing functions. Bulletin of the American Mathematical Society, vol. 70 , pp. 697–698. [REVIEW]Peter Andrews - 1968 - Journal of Symbolic Logic 32 (4):521.
Krom formulas with one dyadic predicate letter.Harry R. Lewis - 1976 - Journal of Symbolic Logic 41 (2):341-362.
Burton Dreben, Peter Andrews, and Stål Aanderaa. False lemmas in Herbrand. Bulletin of the American Mathematical Society, vol. 69 , pp. 699–706. [REVIEW]Paul Bernays - 1966 - Journal of Symbolic Logic 31 (4):657-659.
LEWIS, H. R. Unsolvable Classes of Quantificational Formulas. [REVIEW]G. Lolli - 1982 - Scientia 76 (17):420.

Analytics

Added to PP
2009-01-28

Downloads
86 (#251,873)

6 months
24 (#125,530)

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