Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
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
CADIOU,J.M. Recursive definitions of partial functions and their computations. Ph.D.Thesis,Computer Science Dept.,Stanford Univ.
ENGELER, E. Algorithmic properties of structures,Math.Syst. Theory 1 /1967/, 183–195
KARP, C.R. Languages with expressions of infinite length. North-Holland Publishing Co., Amsterdam 1964
KRECZMAR,A. Effectivity problems in algorithmic logic. Ph.D.Thesis,Faculty of Mathematics and Mechanics,University of Warsaw, 1973
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
MIRKOWSKA, G. On formalized systems of algorithmic logic, Bull.Ac.Pol.Sci.,Ser.Sci.Math.Astron.Phys.,19 /1971/,421–428
MIRKOWSKA-SALWICKA, G.Algorithmic logic and its applications in the programming theory. Ph.D.Thesis,Faculty of Mathematics and Mechanics,University of Warsaw,1972
PERKOWSKA, E. On algorithmic m-valued logics.Bull.Ac.Pol. Sci.,Ser.Sci.Math.Astron.Phys.,20 /1972/,717–719
RASIOWA, H. On logical structure of programs,ibid.,20 /1972/, 319–324
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
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
RASIOWA, H. On logical structure of mix-valued programs and ω+-valued algorithmic logic.ibid., 21 /1973/,451–458
RASIOWA, H. Formalized ω+-valued algorithmic systems.ibid., 21 /1973/,559–565
RASIOWA,H. On ω+-valued algorithmic logic and related problems. CCPAS Reports,1974
RASIOWA, H. A simplified formalization of ω+-valued algorithmic logic. Bull.Ac.Pol.Sci.,Ser.Sci.Math.Astron.Phys.,22 /1974/,595–603
RASIOWA, H. Extended ω+-valued algorithmic logic. ibid. 22 /1974/,605–610
Scott,D. An outline of a Mathematical Theory of Computation. Oxford University computing Laboratory,Programming Research Group, Technical Monograph PRG 2 /November 1970/
SALWICKI, A. Formalized algorithmic languages. Bull.Ac.Pol. Sci.,Ser.Sci.Math.Astron.Phys.,18 /1970/,227–232
SALWICKI, A. On the equivalence of FS-expressions and programs. ibid. 18 /1970/,275–278
SALWICKI, A. On the predicate calculi with the iteration quantifiers.ibid. 18 /1970/,279–285
SALWICKI,A. Programmability and Recursiveness /an application of algorithmic logic to procedures/. To appear in Dissertationes Mathematicae
Author information
Authors and Affiliations
Editor information
Rights 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