Skip to main content

On the solvability of the extended ∀∃ ∧ ∃∀⋆ — Ackermann class with identity

  • Section IV: Decision Problems
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 171))

Abstract

Dreben and Goldfarb define the class 5.7 to be the class of all schemata of the form

$$\forall y\exists xPy \wedge \forall y_l \forall y_2 \cdots \forall y_n G$$

where G is quantifier-free and contains, apart from the dyadic predicate letter P, only monadic predicate letters. Dreben and Goldfarb prove the docility of the class 5.7, but the solvability of this class is left open (see Dreben and Goldfarb(1979) p. 136 and p.264). We shall give an outline of a proof of the solvability of the class 5.7. In fact, we shall give an outline of a proof of the solvability of an extension of this class.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Ackermann, Wilhelm 1928 "Über die Erfüllbarkeit gewisser Zählaüsdrucke," Math. Ann. V. 100 pp. 638–649

    Google Scholar 

  • Ackermann, Wilhelm 1936. "Beiträge zum Entscheidungsproblem der mathematischen Logik". Math. Ann. V. 112 pp. 414–432.

    Google Scholar 

  • Drake, Frank R, 1974 Set theory. An introduction to large cardinals. North-Holland. Amsterdam.

    Google Scholar 

  • Denton, John 1963 Applications of the Herbrand theorem. Ph.D. thesis, Harvard University, Cambridge, Mass.

    Google Scholar 

  • Dreben, Burten and John Denton 1963 "Three solvable cases," Notices Amer.Math.Soc. V.10 p 590.

    Google Scholar 

  • Dreben, Burton and Goldfarb, Warren D., 1979. The decision problem. Solvable classes of quantificational formulas. Addison-Wesley Reading, Massachusetts

    Google Scholar 

  • Kostyrko, V.F. 1962 "On a case of the decision problem in the restricted predicate calculus". Uspekhi.Mat.Nauk V.17 (106) p.213.

    Google Scholar 

  • Ramsey, F.P., 1930 "On a problem of formal logic", Proc. London Math. Soc (Ser.2) V.30 pp. 264–286.

    Google Scholar 

Download references

Authors

Editor information

E. Börger G. Hasenjaeger D. Rödding

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aanderaa, S. (1984). On the solvability of the extended ∀∃ ∧ ∃∀⋆ — Ackermann class with identity. In: Börger, E., Hasenjaeger, G., Rödding, D. (eds) Logic and Machines: Decision Problems and Complexity. LaM 1983. Lecture Notes in Computer Science, vol 171. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13331-3_46

Download citation

  • DOI: https://doi.org/10.1007/3-540-13331-3_46

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13331-5

  • Online ISBN: 978-3-540-38856-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics