Grażyna Mirkowska dr hab. prof PJWSTK | |||||||||||||
|
[1] L.Banachowski, A.Kreczmar, G.Mirkowska, H.Rasiowa, A.Salwicki, An introduction to Algorithmic Logic, Mathematical Investigations in the theory of programs, vol. Mathematical Foundations of Computer Science, Banach Center Publications, PWN, Warszawa, 1977, pp. 7-99 [2] G.Mirkowska, A.Salwicki, Algorithmic Logic, PWN & D.Reidel Publ., Warsaw & Dordrecht, 1987 [3] G.Mirkowska, A.Salwicki, Logika Algorytmiczna dla programistów, WNT 1993 ARTYKUŁY [1] ( wspólnie z A.Goraj i A.Paluszkiewicz) On the notion of the description of programs, Bull. Acad.Pol. Sci.Ser.Math. 18, 1970, pp.499-505 [2] On formalized systems of algorithmic logic, Bull.Acad. Pol.Sci.Ser.Math. 19, 1971, pp.421-428 [3] Herbrand theorem in algorithmic logic, ibid.22, 1974, pp.539-543 [4] (wspólnie z A.Salwickim) A complete characterization of algorithmic properties of block-structured programs with procedures, Proc.MFCS Lecture Notes in Computer Science 45, Springer Verlag, 1976, pp.602-606 [6] Algorithmic Logic and its applications in the theory of programs, Fundamenta Informaticae 1, 1977, pp.1-17, 147-167 [7] (wspólnie z E.Orlowska) An elimination of iteration quantifiers, Fundamenta Informaticae 3, 1978, pp.347-355 [8] On the propositional algorithmic logic, Proc. MFCS'79, LNCS 74, Springer Verlag, Berlin, 1979, pp.381-390 [9] Algorithmic logic with nondeterministic programs, Fundamenta Informaticae 3, 1980, pp.45-64 [10] Model existence theorem in algorithmic logic with nondeterministic programs, Fundamenta Informaticae 3, 1980, pp. 157-170 [11] Complete axiomatization of algorithmic properties of program schemes with bounded nondeterministic interpretations, Proc. of the 12th ACM Symposium on Theory of Computing,Los Angeles 1980, pp.14-21 [12] PAL - propositional algorithmic logic, Proc. Logic of programs (ed.E.Engeler), LNCS 125, Springer Verlag 1981, pp.23-101 [13] The representation theorem for algorithmic algebras, Proc. Logic of programs Yorktown Heights, LNCS 131, Springer Verlag, 1981, pp 14-21 [14] (wspólnie z A.Meyerem i R.Streetem)The deducibility problem in propositional dynamic logic , Proc. ICALP 1981, LNCS 115, 1981 [15] On the propositional algorithmic theory of arithmetic,Proc.Symp.Logics of programs and their applications, Poznan 1980, LNCS 148, 1983, pp.166-186 [16] (wspólnie z L.Stappem) Algorithmic Logic can express progresive properties of programs, Proc. Hungarian Computer Science and Logic Conference 1983 [17] On certain property not expressible in PAL, Fundamenta Informaticae 7, 1984, pp.343-348 [18] (wspólnie z A.Salwickim) On applications of algorithmic logic, in Proc. CAAP'86 (ed.P.Franchi Zannettacci) Springer Verlag 1986, pp.288-306 [19] (wspólnie z A.Salwickim) Axiomatic definability of programming language seman-tics, in Proc. of IFIP Working Conference on formal description of programming concepts III, Ebberup 1986, pp.1-15 [20] (wspólnie z A.Salwickim) On axiomatic definition of Max-model of concurrency, Proc. of the Rome 1986 Advanced School on Mathematical Models of Parallelism [21] On axiomatization of coroutines, in Proc Mathem. Methods in Software Construction, M.Paul, H.Langmaack eds. Dagstuhl 1993, pp12-16 [22] (wspólnie z A.Salwickim) The algebraic specifications do not have the Tennenbaum property, Fundamenta Informaticae, 28 (1996) pp.143-152 [23] (wspólnie z A.Salwickim, M.Srebrnym, A.Tarleckim) First Order Specification of Programmable Data Types, (złożone do publikacji) Redakcja Sprawozdań z Konferencji [1] Mathematical Problems in Computation Theory, Banach
Center Publications vol.21, PWN 1987 (współred. H. Rasiowa), Sprawozdania i Raporty Techniczne [1] Podrecznik programowaia w języku wewnętrznym m.c. GIER
(wspólnie z grupą kolegów) 1965, wydawnictwa Uniwesytetu Warszawskiego [3] O splotach algebr, (1974) maszynopis, problem M 212 [4] Algorithmic logic with nondetermnistic programs, Coll.Math.Socie.Janos Bolyai 26, Mathematical logic in Computer Science, Salgotarjan 1978 [5] O pewnym rozszerzeniu pojęcia algebry algorytmicznej, (1981), problem M 212) [6] Multimodal Logics, (1979) maszynopis [7] CAL - concurrent algorithmic logic, maszynopis,1979 [8] O pewnych pojeciach definiowalnych w logice wielomodalnej (1982, problem M 212) [9] Multimodal logics as a base of algorithmic logic, sprawozdania z konferencji w Diedrichshagen, 1982 [10] Algorithmic logic versus process logic (wspólnie z L. Stappem), maszynopis (1984) [11] Semantyka procesow rozproszonych, (1984, problem resortowy IMPAN) [12] On theory of information systems (Note), in Proc.Logic Colloqium'88, Berlin, 1988 [13] Logic of concurrent processes, in Algebra and Logic in Computer Science, Semestr poświęcony pamięci prof.. H.Rasiowej, Centrum Banacha 1996 [14] Ultraproduct in Algorithmic Logic, Seminarium poświęcone pamięci prof. Łosia, Warszawa 1998 [15] Procesy rozproszone w symulacji, 6te Warsztaty Naukowe PTSK, Białowieża, 1999 [16] O agentach programowanych, Forum Informatyki Teoretycznej, FIT'13, Gdańsk 1999 |