Skip to main content
SpringerLink
Log in

Completeness in classical logic of complex algorithms

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1980 (MFCS 1980)

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 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.

References

  1. Blikle A.,Mazurkiewicz A., An algebraic approach to the theory of programs,algorithms,languages and recursiveness,Proc.Intern.Symp. and Summer School on MFCS,1972,CCPAS Reports 1972

    Google Scholar 

  2. Conway M.E.,Design of a separable-transition diagram compliler, Comm.ACM 6,July 1963,396–408

    Google Scholar 

  3. Harel D., Meyer A.R., Pratt V.R., Computability,and Completeness in Logics of programs, Proc. 9th Annual ACM Symposium on Theory of Computing, Boulder,Colorado, May 1977,261–268

    Google Scholar 

  4. Janicki R.,An algebraic approach to the theory of recursive coroutines,Fundamenta Informaticae 1,No 1 (1977),131–145

    Google Scholar 

  5. Mazurkiewicz A.,Recursive algorithms and formal languages,Bull.Ac. Pol.Sci.,Ser.Sci.Math.Astron.Phys., 20(1972),799–809

    Google Scholar 

  6. Mirkowska G.,Algorithmic logic with nondeterministic programs,ICS PAS Reports 343 (1979),17

    Google Scholar 

  7. Pratt V.R.,Semantical considerations in Floyd-Hoare Logic,Proc. 17th IEEE Symp. on FCS,1976

    Google Scholar 

  8. Rasiowa H.,Sikorski R.,The Mathematics of Metamathematics,Warsaw, 3rd ed.1970

    Google Scholar 

  9. Rasiowa H.,ω+-valued algorithmic logic as a tool to investigate procedures,Proc.MFCS'74,Lecture Notes in Computer Sci 28(1974) Springer Verlag

    Google Scholar 

  10. Rasiowa H.,Completeness theorem for extended algorithmic logic, Proc.Vth Int.Congress of Logic Methodology and Philosophy of Science,1975 III,13–15

    Google Scholar 

  11. Rasiowa H.,Algorithmic Logic.Multiple-valued extensions.Studia Logica,XXXVIII 4 (1979),317–335

    Google Scholar 

  12. Rasiowa H., Logic of complex algorithms,Proc.FCT'79,Berlin,ed.by L.Budach,Mathematische Forschung,2(1979),Akademie Verlag,370–381

    Google Scholar 

  13. Salwicki A.,Formalized algorithmic languages,Bull.Ac.Pol.Sci.,Ser. Math.Astron.Phys.18 (1970),227–232

    Google Scholar 

  14. Tiuryn J.,Logic of effective definitions,RWTH Aachen Schriften zur Informatik und Angewndten Mathematik,55,juli 1979; Fundamenta Informaticae,to appear

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, University of Warsaw, PKiN, IX p.,00-901, Warsaw, Poland

    Helena Rasiowa

Authors
  1. Helena Rasiowa
    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

Rasiowa, H. (1980). Completeness in classical logic of complex algorithms. 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/BFb0022527

Download citation

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

  • 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