Skip to main content
SpringerLink
Log in

Zur Komplexität der Presburger Arithmetik und des Äquivalenzproblems einfacher Programme

  • Vorträge (In Alphabetischer Reihenfolge)
  • Conference paper
  • First Online:
Theoretical Computer Science 4th GI Conference

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

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5. Literatur

  1. J.Cherniavsky, S.Kamin: A complete and consistent Hoare axiomatic for a simple programming language, Conf. Report of 4th ACM-Symposium on Principles of Programming Languages, 1977

    Google Scholar 

  2. D.C. Cooper: Theorem proving without multiplication, Machine Intelligence 7, S. 91–99, Edinburgh 1972

    Google Scholar 

  3. P.C.Downey: Undecidability of Presburger Arithmetic with a single monadic letter, Center for Research in Computing Technologie, Harvard University, 18–72, 1972

    Google Scholar 

  4. J.Ferrante,C.Rackoff: A decision procedure for the first order theory of real addition with order, SIAM J.Comp., Vol. 4 No. 1, 1975

    Google Scholar 

  5. M.J.Fischer, M.O.Rabin: Super-exponential complexity of Presburger Arithmetic, SIAM-AMS Proceedings Vol. 7, 1974

    Google Scholar 

  6. G. Kreisel, J.L. Krivine: Elements of mathematical logic, North-Holland, Amsterdam 1971

    Google Scholar 

  7. A.R.Meyer,D.M.Ritchie: Computation complexity and program structure, IBM Research Report RC 1817, 1967

    Google Scholar 

  8. D.C. Oppen: An upper bound on the complexity of Presburger Arithmetic JCSS 16, 323–332, 1978

    Google Scholar 

  9. M.Presburger: Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt, Comptes-Rendus du Congrès des Mathématiciens des Pays Slaves, Warsaw 1930, S. 99–101, 395

    Google Scholar 

  10. C.R.Reddy,D.W.Loveland: Presburger Arithmetik with bounded quantifier alternation, Conf. Report of 10th ACM-Symposium on Theory of Computing, 1978

    Google Scholar 

  11. D. Tsichritzis: The equivalence problem of simple programs, JACM Vol. 17, No.4, S. 729–738, 1970

    Article  Google Scholar 

  12. K.Wöhl: Äquivalenzuntersuchungen an einfachen Programmen (Dissertation), Bericht Nr. 56/78, Abteilung Informatik, Universität Dortmund, 1978

    Google Scholar 

Download references

Authors
  1. Kai Wöhl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

K. Weihrauch

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wöhl, K. (1979). Zur Komplexität der Presburger Arithmetik und des Äquivalenzproblems einfacher Programme. In: Weihrauch, K. (eds) Theoretical Computer Science 4th GI Conference. Lecture Notes in Computer Science, vol 67. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09118-1_32

Download citation

  • DOI: https://doi.org/10.1007/3-540-09118-1_32

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09118-9

  • Online ISBN: 978-3-540-35517-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation