The Decision Problem. Solvable Classes of Quantificational Formulas

Journal of Symbolic Logic 47 (2):452-453 (1982)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

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

The decision problem: solvable classes of quantificational formulas.Burton Dreben - 1979 - Reading, Mass.: Addison-Wesley, Advanced Book Program. Edited by Warren D. Goldfarb.
Unsolvable Classes of Quantificational Formulas.Dieter Rödding - 1982 - Journal of Symbolic Logic 47 (1):221-222.
Random models and solvable Skolem classes.Warren Goldfarb - 1993 - Journal of Symbolic Logic 58 (3):908-914.
Some Non‐Recursive Classes of Thue Systems With Solvable Word Problem.Ann Yasuhara - 1974 - Mathematical Logic Quarterly 20 (8-12):121-132.
Solvable Cases of the Decision Problem.[author unknown] - 1956 - Philosophy 31 (116):92-93.
Solvable Cases of the Decision Problem.Paul Bernays - 1957 - Journal of Symbolic Logic 22 (1):68-72.

Analytics

Added to PP
2017-02-21

Downloads
11 (#976,244)

6 months
1 (#1,042,085)

Historical graph of downloads
How can I increase my downloads?