Skip to main content

ω+ -valued algorithmic logic as a tool to investigate procedures

  • Theory Of Programs
  • Conference paper
  • First Online:

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

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. BLIKLE,A.; MAZURKIEWICZ,A. An algebraic approach to the theory of programs,algorithms,languages and recursiveness.Proc.Intern. Symp.and Summer School on Math.Found.of Comp.Sci.,Warsaw,Jabłonna, August 21–27,1972, CCPAS Reports,1972

    Google Scholar 

  2. CADIOU,J.M. Recursive definitions of partial functions and their computations. Ph.D.Thesis,Computer Science Dept.,Stanford Univ.

    Google Scholar 

  3. ENGELER, E. Algorithmic properties of structures,Math.Syst. Theory 1 /1967/, 183–195

    Google Scholar 

  4. KARP, C.R. Languages with expressions of infinite length. North-Holland Publishing Co., Amsterdam 1964

    Google Scholar 

  5. KRECZMAR,A. Effectivity problems in algorithmic logic. Ph.D.Thesis,Faculty of Mathematics and Mechanics,University of Warsaw, 1973

    Google Scholar 

  6. MANNA, Z.; VUILLEMIN,J.Fixpoint approach to the theory of computation.Stanford Artificial Intelligence Project,Computer Science Department,School of Humanities and Sciences,Stanford University, Unpublished memo,1972

    Google Scholar 

  7. MIRKOWSKA, G. On formalized systems of algorithmic logic, Bull.Ac.Pol.Sci.,Ser.Sci.Math.Astron.Phys.,19 /1971/,421–428

    Google Scholar 

  8. MIRKOWSKA-SALWICKA, G.Algorithmic logic and its applications in the programming theory. Ph.D.Thesis,Faculty of Mathematics and Mechanics,University of Warsaw,1972

    Google Scholar 

  9. PERKOWSKA, E. On algorithmic m-valued logics.Bull.Ac.Pol. Sci.,Ser.Sci.Math.Astron.Phys.,20 /1972/,717–719

    Google Scholar 

  10. RASIOWA, H. On logical structure of programs,ibid.,20 /1972/, 319–324

    Google Scholar 

  11. RASIOWA,H. On a logical structure of programs,Proc.Intern. Symp.and Summer School on Math.Found.of Comp.Sci.,Warsaw,Jabłonna, August 21–27,1972,CCPAS Reports,1972

    Google Scholar 

  12. RASIOWA, H. On generalized Post algebras of order ω+ and ω+-valued predicate calculi.Bull.Ac.Pol.Sci.,Ser.Sci.Math.Astron.Phys., 21 /1973/,209–219

    Google Scholar 

  13. RASIOWA, H. On logical structure of mix-valued programs and ω+-valued algorithmic logic.ibid., 21 /1973/,451–458

    Google Scholar 

  14. RASIOWA, H. Formalized ω+-valued algorithmic systems.ibid., 21 /1973/,559–565

    Google Scholar 

  15. RASIOWA,H. On ω+-valued algorithmic logic and related problems. CCPAS Reports,1974

    Google Scholar 

  16. RASIOWA, H. A simplified formalization of ω+-valued algorithmic logic. Bull.Ac.Pol.Sci.,Ser.Sci.Math.Astron.Phys.,22 /1974/,595–603

    Google Scholar 

  17. RASIOWA, H. Extended ω+-valued algorithmic logic. ibid. 22 /1974/,605–610

    Google Scholar 

  18. Scott,D. An outline of a Mathematical Theory of Computation. Oxford University computing Laboratory,Programming Research Group, Technical Monograph PRG 2 /November 1970/

    Google Scholar 

  19. SALWICKI, A. Formalized algorithmic languages. Bull.Ac.Pol. Sci.,Ser.Sci.Math.Astron.Phys.,18 /1970/,227–232

    Google Scholar 

  20. SALWICKI, A. On the equivalence of FS-expressions and programs. ibid. 18 /1970/,275–278

    Google Scholar 

  21. SALWICKI, A. On the predicate calculi with the iteration quantifiers.ibid. 18 /1970/,279–285

    Google Scholar 

  22. SALWICKI,A. Programmability and Recursiveness /an application of algorithmic logic to procedures/. To appear in Dissertationes Mathematicae

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

A. Blikle

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rasiowa, H. (1975). ω+ -valued algorithmic logic as a tool to investigate procedures. In: Blikle, A. (eds) Mathematical Foundations of Computer Science. MFCS 1974. Lecture Notes in Computer Science, vol 28. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07162-8_702

Download citation

  • DOI: https://doi.org/10.1007/3-540-07162-8_702

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07162-4

  • Online ISBN: 978-3-540-37492-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics