{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,5,16]],"date-time":"2022-05-16T21:25:45Z","timestamp":1652736345362},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1988,5,1]],"date-time":"1988-05-01T00:00:00Z","timestamp":578448000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1988,5]]},"DOI":"10.1007\/bf02737110","type":"journal-article","created":{"date-parts":[[2007,10,30]],"date-time":"2007-10-30T23:33:24Z","timestamp":1193787204000},"page":"439-473","source":"Crossref","is-referenced-by-count":1,"title":["Program-substitution and admissibility of rules in algorithmic logic"],"prefix":"10.1007","volume":"25","author":[{"given":"Andrzej","family":"Biela","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"BF02737110_CR1","doi-asserted-by":"crossref","first-page":"93","DOI":"10.3233\/FI-1977-1108","volume":"I","author":"L. Banachowski","year":"1977","unstructured":"Banachowski, L.: Investigations of properties of programs by means of the extended algorithmic logic I. Annales Societatis Mathematicae Polonae. Ser. IV. Fundamenta Informaticae. Vol. I, No. 1, 1977,93\u2013119.","journal-title":"Fundamenta Informaticae"},{"key":"BF02737110_CR2","unstructured":"Bernert, J., Biela, A.: On two different modal logics denoted by S9. Reports on Math. Logic.13, 3\u20139 (1981)"},{"key":"BF02737110_CR3","first-page":"51","volume":"16","author":"A. Biela","year":"1982","unstructured":"Biela, A., Dziobiak, W.: On two properties of structurally complete logics. Reports on Math. Logic.16, 51\u201354 (1982)","journal-title":"Reports on Math. Logic."},{"key":"BF02737110_CR4","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1002\/malq.19820281409","volume":"28","author":"B. Chlebus","year":"1982","unstructured":"Chlebus, B.: On the decidability of propositional algorithmic logic. Zeitschr. f\u00fcr Math. Logik und Grundlagen der Math.28, 247\u2013261 (1982)","journal-title":"Zeitschr. f\u00fcr Math. Logik und Grundlagen der Math."},{"key":"BF02737110_CR5","unstructured":"Church, A.: Introduction on Mathematical Logic. Princeton 1956."},{"key":"BF02737110_CR6","series-title":"Logic of Programs and Their Applications","volume-title":"Algorithmic properties of finitely generated structures","author":"W. Danko","year":"1983","unstructured":"Danko, W.: Algorithmic properties of finitely generated structures. Proceedings, Poznan, August 1980, Lect, Notes in Comput. Sci. Vol. 148. Logic of Programs and Their Applications. Berlin, Heidelberg, New York: Springer 1983"},{"key":"BF02737110_CR7","first-page":"169","volume-title":"Elements of Intuitionism","author":"M. Dummet","year":"1977","unstructured":"Dummet, M.: Elements of Intuitionism, Clarendon Press. Oxford 1977, p. 169."},{"key":"BF02737110_CR8","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF01705528","volume":"1","author":"E. Engeler","year":"1967","unstructured":"Engeler, E.: Algorithmic properties of structures. Math. Syst. Theory1, 183\u2013195 (1967)","journal-title":"Math. Syst. Theory"},{"key":"BF02737110_CR9","volume-title":"Nondeterminism in Logics of Programs","author":"D. Harel","year":"1977","unstructured":"Harel, D., Pratt, V.: Nondeterminism in Logics of Programs, Proc. 9-th Ann. ACM Symp. on Theory of Computing, Boulder, Colorado, May 1977. MIT, Cambridge, MA 1977."},{"key":"BF02737110_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-87132-0","volume-title":"Introduction to Mathematical Logic","author":"H. Hermes","year":"1973","unstructured":"Hermes, H.: Introduction to Mathematical Logic. Berlin, Heidelberg, New York: Springer 1973"},{"key":"BF02737110_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-00049-6","volume-title":"Grundz\u00fcge der theoretischen Logik","author":"D. Hilbert","year":"1967","unstructured":"Hilbert, D., Ackermann, W.: Grundz\u00fcge der theoretischen Logik. Berlin, Heidelberg, New York: Springer 1967"},{"key":"BF02737110_CR12","first-page":"19","volume":"1","author":"A. Kreczmar","year":"1977","unstructured":"Kreczmar, A.: Effectivity problems of algorithmic logic. Annales Societatis Math. Polon. Ser. IV, Fundam. Inf.1, 19\u201332 (1977)","journal-title":"Annales Societatis Math. Polon. Ser. IV, Fundam. Inf."},{"key":"BF02737110_CR13","first-page":"781","volume":"21","author":"A. Kreczmar","year":"1971","unstructured":"Kreczmar, A.: The set of all tautologies of algorithmic logic is hyperarithmetical. Bull. Acad. Polon. Sci., Ser. Math.21, 781\u2013783 (1971)","journal-title":"Bull. Acad. Polon. Sci., Ser. Math."},{"key":"BF02737110_CR14","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF00264469","volume":"8","author":"F. Kr\u00f6ger","year":"1977","unstructured":"Kr\u00f6ger, F.: LAR: A Logic of Algorithmic Reasoning. Acta Inf.8, 243\u2013266 (1977)","journal-title":"Acta Inf."},{"key":"BF02737110_CR15","first-page":"85","volume-title":"Proizvodost dopustimych pravi\u0142. Issliedovanija po konstruktiwnoj matiematikie i matiematiczeskoj logikie","author":"G. Minc","year":"1972","unstructured":"Minc, G.: Proizvodost dopustimych pravi\u0142. Issliedovanija po konstruktiwnoj matiematikie i matiematiczeskoj logikie, vol. 5, pp. 85\u201389. Leningrad: Nauka AN CCCP Matiematiczeskij Institut im. V.A. Steklova. Leningradskoje otdielienie. (1972)"},{"key":"BF02737110_CR16","first-page":"1","volume":"1","author":"G. Mirkowska","year":"1977","unstructured":"Mirkowska, G.: Algorithmic logic and its applications in the theory of programs I. Annales Societatis Math. Polon. Ser. IV, Fundam. Inf.1, 1\u201317 (1977)","journal-title":"Annales Societatis Math. Polon. Ser. IV, Fundam. Inf."},{"key":"BF02737110_CR17","first-page":"147","volume":"1","author":"G. Mirkowska","year":"1977","unstructured":"Mirkowska, G.: Algorithmic logic and its applications in the theory of programs II. Annales Societatis Math. Polon. Ser. IV. Fundam. Inf.1, 147\u2013165 (1977)","journal-title":"Annales Societatis Math. Polon. Ser. IV. Fundam. Inf."},{"key":"BF02737110_CR18","first-page":"45","volume":"3","author":"G. Mirkowska","year":"1980","unstructured":"Mirkowska, G.: Algorithmic logic with nondeterministic programs. Annales Societatis Math. Polon. Ser. IV. Fundam. Inf.3, 45\u201364 (1980)","journal-title":"Annales Societatis Math. Polon. Ser. IV. Fundam. Inf."},{"key":"BF02737110_CR19","first-page":"157","volume":"3","author":"G. Mirkowska","year":"1980","unstructured":"Mirkowska, G.: Model existence theorem in algorithmic logic with non-deterministic programs. Annales Societatis Math. Polon, Ser. IV. Fundam. Inf.3, 157\u2013170 (1980)","journal-title":"Annales Societatis Math. Polon, Ser. IV. Fundam. Inf."},{"key":"BF02737110_CR20","first-page":"421","volume":"19","author":"G. Mirkowska","year":"1971","unstructured":"Mirkowska, G.: On formalized systems of algorithmic logic. Bull. Acad. Polon. Sci. Ser. Math.19, 421\u2013428 (1971)","journal-title":"Bull. Acad. Polon. Sci. Ser. Math."},{"key":"BF02737110_CR21","first-page":"717","volume":"20","author":"E. Perkowska","year":"1972","unstructured":"Perkowska, E.: On algorithmic m-valued logics, Bull. Acad. Polon. Sci. Ser. Sci. Math. Astr. Phys.20, 717\u2013719(1972)","journal-title":"Bull. Acad. Polon. Sci. Ser. Sci. Math. Astr. Phys."},{"key":"BF02737110_CR22","first-page":"213","volume-title":"On Algorithmic Logic with partial operations","author":"U. Petermann","year":"1983","unstructured":"Petermann, U.: On Algorithmic Logic with partial operations. Proceedings, Pozna\u0144, August 1980, Lect. Notes Comput. Sci. Vol. 148. Logic of Programs and Their Applications, pp. 213\u2013223. Berlin, Heidelberg, New York: Springer 1983"},{"key":"BF02737110_CR23","first-page":"349","volume":"19","author":"W.A. Pogorzelski","year":"1971","unstructured":"Pogorzelski, W.A.: Structural completeness of the propositional calculus, Bull. Acad. Polon. Sci. Ser. Sci. Math. Astr. Phys.19, 349\u2013351 (1971)","journal-title":"Bull. Acad. Polon. Sci. Ser. Sci. Math. Astr. Phys."},{"key":"BF02737110_CR24","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1002\/malq.19750210138","volume":"21","author":"W.A. Pogorzelski","year":"1975","unstructured":"Pogorzelski, W.A., Prucnal, T.: Structural completeness of the first order predicate calculus. Zeitschr. f\u00fcr Math. Logik und Grundlagen der Math.21, 315\u2013320 (1975)","journal-title":"Zeitschr. f\u00fcr Math. Logik und Grundlagen der Math."},{"key":"BF02737110_CR25","doi-asserted-by":"crossref","first-page":"97","DOI":"10.2307\/2273325","volume":"48","author":"J. Porte","year":"1983","unstructured":"Porte, J.: Antitheses in systems of relevant implication. J. Symb. Logic,48, 97\u201399 (1983)","journal-title":"J. Symb. Logic"},{"key":"BF02737110_CR26","doi-asserted-by":"crossref","unstructured":"Pratt, V.: Semantical Considerations on Floyd-Hoare Logic, in: Proceedings 17-th Ann. IEEE Symp. on FCS, pp. 109\u2013121, October 1976","DOI":"10.1109\/SFCS.1976.27"},{"key":"BF02737110_CR27","first-page":"101","volume":"29","author":"T. Prucnal","year":"1972","unstructured":"Prucnal, T.: Structural completeness of Lewis\u2019s system S 5, Bulletin de 1\u2019 Acad. Polon. des Sci. Ser. Sci. Math. Astr. Phys.29, 101\u2013103 (1972)","journal-title":"Bulletin de 1\u2019 Acad. Polon. des Sci. Ser. Sci. Math. Astr. Phys."},{"key":"BF02737110_CR28","volume-title":"Programmability andP = NP conjecture","author":"S. Radziszewski","year":"1977","unstructured":"Radziszewski, S.: Programmability andP = NP conjecture, Proc. FCT\u2019 77, Cont. Lect. Notes Comput. Sci. Vol. 56. Berlin, Heidelberg: Springer 1977"},{"key":"BF02737110_CR29","first-page":"319","volume":"20","author":"H. Rasiowa","year":"1972","unstructured":"Rasiowa, H.: On logical structure of programs, Bull. Polon. Acad. Sci. Ser. Math. Astr. Phys.20, 319\u2013324(1972)","journal-title":"Bull. Polon. Acad. Sci. Ser. Math. Astr. Phys."},{"key":"BF02737110_CR30","volume-title":"\u03a9+-valued algorithmic logic as a tool to investigate procedures","author":"H. Rasiowa","year":"1974","unstructured":"Rasiowa, H.: \u03a9+-valued algorithmic logic as a tool to investigate procedures. Proc. MFCS \u201974. Lect. Notes Comput. Sci. Vol. 28. Berlin, Heidelberg: Springer 1974"},{"key":"BF02737110_CR31","first-page":"352","volume-title":"Axioms of Algorithmic Logic univocally determine Semantics of programs","author":"A. Salwicki","year":"1980","unstructured":"Salwicki, A.: Axioms of Algorithmic Logic univocally determine Semantics of programs. Proc. MFCS \u201980. Lect. Notes Comput. Sci. Vol. 88, pp. 352\u2013361. Heidelberg, Berlin, New York: Springer 1980"},{"key":"BF02737110_CR32","first-page":"227","volume":"18","author":"A. Salwicki","year":"1970","unstructured":"Salwicki, A.: Formalized algorithmic languages, Bull. Acad. Pol. Sci. Ser. Sci. Math. Astr. Phys.18, 227\u2013232 (1970)","journal-title":"Bull. Acad. Pol. Sci. Ser. Sci. Math. Astr. Phys."},{"key":"BF02737110_CR33","unstructured":"Segerberg, K.: A Completeness Theorem in Modal Logic of Programs, abstract, Notices of the American Mathematical Society, Oct. 1977."},{"key":"BF02737110_CR34","unstructured":"Thiele, H. : Wissenschaftstheoretische Untersuchungen in algorithmischen Sprachen, VEB Deutscher Verlag der Wissenschaften Berlin 1966"},{"key":"BF02737110_CR35","first-page":"40","volume":"241","author":"A.I. Tsitkin","year":"1978","unstructured":"Tsitkin, A.I.: On structurally complete superintuitionistic logics. Dokl. Akad. Nauk CCCP.241, 40\u201343 (1978)","journal-title":"Dokl. Akad. Nauk CCCP."},{"key":"BF02737110_CR36","first-page":"2","volume":"3","author":"P. Wojtylak","year":"1974","unstructured":"Wojtylak, P.: On structural completeness of many valued logic\u2019s. Studia Logica3, 2\u20138(1974)","journal-title":"Studia Logica"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02737110.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02737110\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02737110","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,26]],"date-time":"2021-08-26T14:23:44Z","timestamp":1629987824000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02737110"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,5]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1988,5]]}},"alternative-id":["BF02737110"],"URL":"https:\/\/doi.org\/10.1007\/bf02737110","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,5]]}}}