Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1980: Mathematical Foundations of Computer Science 1980 pp 205–218Cite as

A criterion of undecidability of algorithmic theories

  • Communications
  • Conference paper
  • First Online:

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

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

  1. L. Banachowski, Investigations of properties of programs by means of extended algorithmic logic, Fundamenta Informaticae I, 1977

    Google Scholar 

  2. L. Banachowski, An axiomatic approach to the theory of data structures, Bull.Acad.Pol.Sci.Sèr.Math.Astr.Phys. 23, 1975, 315–323

    Google Scholar 

  3. M. Grabowski, The set of tautologies of zero order algorithmic logic is decidable, Bull.Acad.Pol.Sci.Sèr.Math.Astr.Phys. 20, 1972, 575–582

    Google Scholar 

  4. D.Harel, A.R.Meyer, V.R.Pratt, Computability and completeness in logic of programs, Proc. 9th Ann. ACM Symp. on Theory of Computing, 261–268

    Google Scholar 

  5. A. Kreczmar, Effectivity problems of algorithmic logic, Funda menta Informaticae I, 1977, 19–32

    Google Scholar 

  6. A. Kreczmar, Programmability in fields, Fundamenta Informaticae I, 1977, 195–230

    Google Scholar 

  7. J.Matijasevič, Recursively enumerable relations are diophanic, Reports of Academy of Science of USSR 191, 279–282

    Google Scholar 

  8. G. Mirkowska, Algorithmic logic and its applications in program theory, Fundamenta Informaticae I, 1977, 1–17, 147–167

    Google Scholar 

  9. H. Rasiowa, R. Sikorski, Mathematics of metamathematics, PWN, Warszawa 1963

    Google Scholar 

  10. A.Salwicki, On algorithmic theory of stacks, CC PAS Reports

    Google Scholar 

  11. A. Salwicki, On algorithmic theory of dictionaries, Fundamenta Informaticae to appear

    Google Scholar 

  12. A.Salwicki, Programmability and recursiveness, Dissertationes Mathematicae, to appear

    Google Scholar 

  13. A. Tarski, A decision method for elementary algebra and geometry, RAND Corporation, Santa Monica, Calif. 1948

    Google Scholar 

  14. B.A.Trachtenbrot, There is no algorithm for deciding the validity of formulas in finite structures, Reports of Academy of Science of USSR, 70, 569–572

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Division Białystok, University of Warsaw, Akademicka 2, 15-267, Białystok, Poland

    Wiktor Dańko

Authors
  1. Wiktor Dańko
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

P. Dembiński

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dańko, W. (1980). A criterion of undecidability of algorithmic theories. In: Dembiński, P. (eds) Mathematical Foundations of Computer Science 1980. MFCS 1980. Lecture Notes in Computer Science, vol 88. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022506

Download citation

  • DOI: https://doi.org/10.1007/BFb0022506

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10027-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation