skip to main content
article
Free access

Review of "Unsolvable classes of quantificational formulas" by Harry R. Lewis. Addison-Wesley 1979. and "The decision problem: solvable classes of quantificational formulas" by Burton Dreben and Warren D. Goldfarb. Addison-Wesley 1979.

Published: 01 September 1982 Publication History

Abstract

No abstract available.

References

[1]
Wilhem Ackermann, Solvable cases of the Decision Problem, North Holland, Amsterdam, 1954.
[2]
Robert Berger, The Undecidability of the Domino Problem, Memoirs of the AMS, no. 66, 1966.
[3]
Janos Suranyi, Reduktionstheorie des Entscheidungsproblems im Pradikatenkalkul der Ersten Stufe, Proceedings of the Hungarian Academy of Sciences, Budapest, 1959.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGACT News
ACM SIGACT News  Volume 14, Issue 4
Fall-Winter 1982
46 pages
ISSN:0163-5700
DOI:10.1145/1008902
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 September 1982
Published in SIGACT Volume 14, Issue 4

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 145
    Total Downloads
  • Downloads (Last 12 months)33
  • Downloads (Last 6 weeks)4
Reflects downloads up to 13 Feb 2025

Other Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media