{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:22:09Z","timestamp":1725456129792},"publisher-location":"Berlin\/Heidelberg","reference-count":25,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354010027X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0022532","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T05:49:12Z","timestamp":1132724952000},"page":"552-561","source":"Crossref","is-referenced-by-count":3,"title":["Axioms of algorithmic logic univocally determine semantics of programs"],"prefix":"10.1007","author":[{"given":"Andrzej","family":"Salwicki","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"41_CR1","unstructured":"Andreka H., Nemeti, I., Completeness of Floyd logic, Bulletin of section of logic vol. 7 (1978)"},{"key":"41_CR2","unstructured":"Banachowski, L., Modular approach to the logical theory of programs Proc. MFCS '74 Symp. A. Blikle ed. Lecture Notes Comp. Sci. 28"},{"key":"41_CR3","unstructured":"Bartol, W. M., On configurations of objects in LOGLAN computations Institute of Informatics, University of Warsaw, manuscript, 1980"},{"key":"41_CR4","doi-asserted-by":"crossref","unstructured":"Blikle, A., A survey of input-output semantics and program verification, ICS PAS Reports 344, Warsaw 1979","DOI":"10.1016\/0306-4379(80)90056-3"},{"key":"41_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0207001","volume":"7","author":"S.A. Cook","year":"1978","unstructured":"Cook, S.A., Soundness and completeness of an axiom system for program verification, SIAM Journal on Computing, 7 (1978) no 1","journal-title":"SIAM Journal on Computing"},{"key":"41_CR6","unstructured":"Csirmaz, L., Programs and program verifications in a general setting, Preprint 4 of the Mathematical Institute of the Hungarian Academy of Sciences, Budapest 1980"},{"key":"41_CR7","unstructured":"Dijkstra, E.W., A discipline of programming, Prentice Hall, 1976"},{"key":"41_CR8","volume-title":"Assigning meaning to programs in Mathematical ASpects of Computer Science Proc. of Symp. in Applied Mathematics","author":"R.W. Floyd","year":"1967","unstructured":"Floyd, R.W., Assigning meaning to programs in Mathematical ASpects of Computer Science Proc. of Symp. in Applied Mathematics, AMS Providence, Rhode Island 1967"},{"key":"41_CR9","unstructured":"Greif, I., Meyer, A.R., Specifying the semantics of while programs, M.I.T. Lab. for Comp. Sci. TM-130, MIT, Cambridge, Mass. April 79"},{"key":"41_CR10","volume-title":"An outline of mathematical logic","author":"A. Grzegorczyk","year":"1977","unstructured":"Grzegorczyk, A., An outline of mathematical logic, Polish Scientific Publishers and North-Holland, Warsaw, 1977"},{"key":"41_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-09237-4","volume-title":"First-Order dynamic logic in Lecture notes Comp. Sci. vol.68","author":"D. Harel","year":"1979","unstructured":"Harel, D., First-Order dynamic logic in Lecture notes Comp. Sci. vol.68, Springer Vlg, 1979, Berlin"},{"key":"41_CR12","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/BF00289504","volume":"2","author":"C.A. Hoare","year":"1973","unstructured":"Hoare, C.A., Wirth, N., An axiomatic definition of the programming language PASCAL, Acta Informatica 2 (1973) 335\u2013355","journal-title":"Acta Informatica"},{"key":"41_CR13","unstructured":"Kozen, D., On the duality between dynamic algebras and Kripke models, IBM research report RC 7893, Oct. 1979"},{"key":"41_CR14","doi-asserted-by":"crossref","first-page":"195","DOI":"10.3233\/FI-1977-1113","volume":"1","author":"A. Kreczmar","year":"1977","unstructured":"Kreczmar, A., Programmability in fields, Fundamenta Informaticae 1 (1977) 195\u2013230","journal-title":"Fundamenta Informaticae"},{"key":"41_CR15","unstructured":"Oktaba, H., On algorithmic theory of reference, Institute of Informatics, University of Warsaw, manuscript, 1980"},{"key":"41_CR16","doi-asserted-by":"crossref","unstructured":"Meyer, A.R., Halpern, J.Y., Axiomatic definitions of programming languages, A theoretical assessment, Proc. 7-th POPL Symp. Las Vegas 1980 203\u2013212","DOI":"10.1145\/567446.567466"},{"key":"41_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-1977-1102","volume":"1","author":"G. Mirkowska","year":"1977","unstructured":"Mirkowska, G., Algorithmic logic and its applications in programs Fundamenta Informaticae 1 (1977) 1\u201317, 147\u2013165","journal-title":"Fundamenta Informaticae"},{"key":"41_CR18","doi-asserted-by":"crossref","unstructured":"Mirkowska, G., Complete axiomatization of algorithmio properties of program schemes with bounded nondeterministic interpretations, Proc 12-th STOC symp. Los Angeles, April 1980, 21\u201332","DOI":"10.1145\/800141.804648"},{"key":"41_CR19","unstructured":"Mirkowska, G., Model existence theorem for algorithmic logic of nondeterministic programs, 1978, to appear in Fundamenta Inform."},{"key":"41_CR20","first-page":"602","volume-title":"Lecture Notes Comp. Sci. vol. 45","author":"G. Mirkowska","year":"1976","unstructured":"Mirkowska, G., Salwicki, A., A complete axiomatic characterization of algorithmic properties of block-structured programs with procedures in Proc. MFCS '76 A. Mazurkiewicz ed. Lecture Notes Comp. Sci. vol. 45 pp 602\u2013603, Springer Vlg, 1976, Berlin"},{"key":"41_CR21","unstructured":"Reiterman, J., Trnkova, V., Dynamic algebras which are not Kripke structures, this volume"},{"key":"41_CR22","first-page":"278","volume":"18","author":"A. Salwicki","year":"1970","unstructured":"Salwicki, A., On the predicate calculi with iteration quantifiers, Bull. Pol. Acad. Sci. Ser. Math. 18 (1970) 278\u2013282","journal-title":"Bull. Pol. Acad. Sci. Ser. Math."},{"key":"41_CR23","volume-title":"Proc MFCS'78 Zakopane","author":"A. Salwicki","year":"1978","unstructured":"Salwicki, A., On algorithmic theory of stacks, in Proc MFCS'78 Zakopane J. Winkowski ed. Lecture Notes Comp. Scie. vol 64, Springer 1978 Berlin"},{"key":"41_CR24","unstructured":"Salwicki, A., On algorithmic theory of dictionaries, to appear in Proc. Alg. Logic Seminar, Z\u00fcrich 1979 E. Engeler ed. Lecture Notes Comp. Sci."},{"key":"41_CR25","unstructured":"Salwicki, A., Programmability and recursiveness, to appear"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1980"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0022532","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T15:33:21Z","timestamp":1683300801000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022532"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354010027X"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/bfb0022532","relation":{},"subject":[]}}