{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:49:45Z","timestamp":1725662985709},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540111603"},{"type":"electronic","value":"9783540386315"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/3-540-11160-3_7","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:38:35Z","timestamp":1330191515000},"page":"198-245","source":"Crossref","is-referenced-by-count":7,"title":["A survey of the logic of effective definitions"],"prefix":"10.1007","author":[{"given":"J.","family":"Tiuryn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"7_CR1","first-page":"7","volume-title":"Math. Found of Comp. Sc.","author":"L. Banachowski","year":"1977","unstructured":"Banachowski, L., Kreczmar, A., Mirkowska, G., Rasiowa, H. and Salwicki, A., An Introduction to Algorithmic Logic. Mathematical Investigations in the Theory of Programs. In Mazurkiewicz and Pawlak (eds) Math. Found of Comp. Sc. Banach Center Publications. Warsaw 1977, pp. 7\u201399."},{"key":"7_CR2","volume-title":"A Course in Mathematical","author":"J. Bell","year":"1977","unstructured":"Bell, J. and Machover, M., A Course in Mathematical Logic. North-Holland Publ. Co., Amsterdam 1977."},{"key":"7_CR3","unstructured":"Bergstra, J. and Meyer, J. J. C. On the Quantifier Free Fragment of Logic of Effective Definitions. Leiden University Report (80\u20134), 1980."},{"key":"7_CR4","unstructured":"Bergstra, J. and Tiuryn, J., Implicit Definability of Algebraic Structures by Means of Program Properties. Abstract: in Budach (ed.). Fundamentals of Comp. Th. Academie-Verlag Berlin 1979. The full version will appear in Fundamenta Informaticae."},{"key":"7_CR5","unstructured":"Bergstra, J., and Tiuryn, J., Algorithmic Degrees of Algebraic Structures. Leiden University Report (79\u20136), 1979."},{"key":"7_CR6","unstructured":"Bergstra, J., Tiuryn, J., and Tucker, J.V., Correctness Theories and Program Equivalence. Mathematisch Centrum Report (IW 119\/79). Amsterdam 1979."},{"key":"7_CR7","volume-title":"Model Theory","author":"C. C. Chang","year":"1973","unstructured":"Chang, C.C. and Keisler, H.J., Model Theory. North-Holland Publ. Co., Amsterdam 1973."},{"key":"7_CR8","first-page":"733","volume-title":"Information Processing '77","author":"R. L. Constable","year":"1977","unstructured":"Constable, R.L., A Constructive Programming Logic. In Gilchrist (ed.) Information Processing '77. Proc. of IFIP Congress '77. North-Holland Publ. Co. Amsterdam 1977, pp. 733\u2013738."},{"key":"7_CR9","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1137\/0201006","volume":"1","author":"R. L. Constable","year":"1972","unstructured":"Constable, R.L. and Gries, D., On Classes of Program Schemata. SIAM Journal on Computing 1 (1972) pp. 66\u2013118.","journal-title":"SIAM Journal on Computing"},{"key":"7_CR10","unstructured":"Engeler, E., Algorithmic Logic. In de Bakker (ed.) Mathematical Centre Tracts (63) Amsterdam 1975, pp. 57\u201385."},{"key":"7_CR11","unstructured":"Engeler, E., Generalized Galois Theory and its Application to Complexity. Berichte des Instituts f\u00fcr Informatik (24) ETH Zurich (1978)."},{"key":"7_CR12","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/S0049-237X(08)71238-2","volume-title":"Logic Colloquium '69","author":"H. Friedman","year":"1971","unstructured":"Friedman, H., Algorithmic Procedures, Generalized Turing Algorithms, and Elementary Recursion Theory. In Gandy and Yates (eds) Logic Colloquium '69, North-Holland Publ. Co., Amsterdam 1971, pp. 361\u2013390."},{"key":"7_CR13","unstructured":"Goguen, J.A., Thatcher, J.W., and Wagner, E.G., An Initial Algebra Approach to the Specification Correctness and Implementation of Abstract Data Types. In Yeh (ed.) Current Trends in Programming Methodology, (vol. 3) Data Structuring. Prentice-Hall 1977. Automatic Computation Series."},{"key":"7_CR14","series-title":"Lecture Notes in Comp. Sc.","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0023017","volume-title":"Theory of Program Structures: Schemes, Semantics, Verification","author":"S. A. Greibach","year":"1975","unstructured":"Greibach, S.A., Theory of Program Structures: Schemes, Semantics, Verification. Lecture Notes in Comp. Sc. 36, Springer Verlag, Berlin 1975."},{"key":"7_CR15","series-title":"Lecture Notes in Comp. Sc.","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-09237-4","volume-title":"First-order Dynamic Logic","author":"D. Harel","year":"1979","unstructured":"Harel, D., First-order Dynamic Logic. Lecture Notes in Comp. Sc. 68, Springer Verlag, Berlin 1979."},{"key":"7_CR16","volume-title":"Model Theory for Infinitary Logic","author":"H. J. Keisler","year":"1972","unstructured":"Keisler, H.J., Model Theory for Infinitary Logic. North-Holland Publ. Co., Amsterdam 1972."},{"key":"7_CR17","first-page":"253","volume-title":"Automata, Languages and Programming","author":"D. J. Kfoury","year":"1972","unstructured":"Kfoury, D.J., Comparing Algebraic Structures up to Algorithmic Equivalence. In Nivat (ed.) Automata, Languages and Programming. North-Holland Publ. Co., Amsterdam 1972, pp. 253\u2013264."},{"key":"7_CR18","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/S0022-0000(74)80030-9","volume":"8","author":"D. J. Kfoury","year":"1974","unstructured":"Kfoury, D.J., Translatability of schemes over restricted interpretations. Journal of Comp. and Syst. Sc. 8 (1974) pp. 387\u2013408.","journal-title":"Journal of Comp. and Syst. Sc."},{"issue":"2","key":"7_CR19","doi-asserted-by":"crossref","first-page":"195","DOI":"10.3233\/FI-1977-1113","volume":"I","author":"A. Kreczmar","year":"1977","unstructured":"Kreczmar, A. Programmability in Fields. Fundamenta Informaticae I, 2. (1977) pp. 195\u2013230.","journal-title":"Fundamenta Informaticae"},{"key":"7_CR20","doi-asserted-by":"crossref","first-page":"253","DOI":"10.4064\/fm-57-3-253-272","volume":"LVII","author":"E. Lopez-Escobar","year":"1965","unstructured":"Lopez-Escobar, E., An interpolation theorem for denumerably long sentences. Fundamenta Mathematicae LVII, (1965) pp. 253\u2013272.","journal-title":"Fundamenta Mathematicae"},{"key":"7_CR21","series-title":"Lecture Notes in Comp. Sc.","first-page":"25","volume-title":"Theoretical Comp Sc. 4th GI Conference","author":"A. R. Meyer","year":"1979","unstructured":"Meyer, A.R. and Grief, I., Can Partial Correctness Assertions Specify Programming Language Semantics? In Weihrauch (ed.) Theoretical Comp Sc. 4th GI Conference. Lecture Notes in Comp. Sc. 67, Springer Verlag, Berlin (1979) pp. 25\u201326."},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Meyer, A.R. and Halpern, J.Y. Axiomatic Definitions of Programming Languages: A Theoretical Assessment. In Proceedings of the 7th Annual Symposium on the Principles of Programming Languages. pp. 203\u2013212, January 1980.","DOI":"10.1145\/567446.567466"},{"key":"7_CR23","unstructured":"Moldestad, J., Stoltenberg-Hansen, V. and Tucker, J.V., Finite Algorithmic Procedures and Computation Theories. To appear in Mathematica Scandanavia."},{"key":"7_CR24","series-title":"Lecture Notes in Comp. Sc.","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/3-540-08921-7_88","volume-title":"Proc. of MFCS '78","author":"R. Parikh","year":"1978","unstructured":"Parikh, R., The Completeness of Propositional Dynamic Logic. In Winkowski (ed.) Proc. of MFCS '78. Lecture Notes in Comp. Sc. 64, Springer Verlag, Berlin 1978, pp. 403\u2013415."},{"key":"7_CR25","unstructured":"Rasiowa, H., Algorithmic Logic. ICSPAS Report 281, Warsaw 1977."},{"key":"7_CR26","series-title":"Lecture Notes in Comp. Sc.","first-page":"423","volume-title":"Proc. of MFCS '74","author":"H. Rasiowa","year":"1974","unstructured":"Rasiowa, H., \u03b8+-valued Algorithmic Logic As a Tool To Investigate Procedures. In Blikle (ed.) Proc. of MFCS '74 Lecture Notes in Comp. Sc. 28, Springer Verlag, Berlin 1974, pp. 423\u2013450."},{"key":"7_CR27","first-page":"371","volume-title":"Fundamentals of Comp. Th.","author":"H. Rasiowa","year":"1979","unstructured":"Rasiowa, H., Logic of Complex Algorithms. In Budach (ed.) Fundamentals of Comp. Th. Akademie Verlag, Berlin 1979. pp. 371\u2013380."},{"key":"7_CR28","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers","year":"1967","unstructured":"Rogers, H., Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York 1967."},{"key":"7_CR29","series-title":"Lecture Notes in Comp. Sc.","volume-title":"Proc. of MFCS '78","author":"A. Salwicki","year":"1978","unstructured":"Salwicki, A., On Algorithmic Theory of Stacks. In Winkowski (ed.) Proc. of MFCS '78. Lecture Notes in Comp. Sc. 64. Springer Verlag, Berlin 1978."},{"key":"7_CR30","first-page":"445","volume-title":"Logic Colloquium '73","author":"J. C. Shepherdson","year":"1973","unstructured":"Shepherdson, J.C., Computation Over Abstract Structures: Serial and Parallel Procedures and Friedman's Effective Definitional Schemes. In Shepherdson and Rose (eds.) Logic Colloquium '73. North-Holland, Amsterdam 1973, pp. 445\u2013513."},{"key":"7_CR31","unstructured":"Tiuryn, J., Algebraic Aspects of Logic Based on Term Algebra of r.e. trees. Warsaw University Report 1978."},{"key":"7_CR32","unstructured":"Tiuryn, J., Completeness Theorem for Logic of Effective Definitions. To appear in Proc. Coll. Logic in Programming, Salgotarjan 1978, North-Holland Publishing Co."},{"key":"7_CR33","unstructured":"Tiuryn, J., Logic of Effective Definitions. R.W.T.H.-Aachen Report 55, 1979. To appear in Fundamenta Informaticae."},{"key":"7_CR34","unstructured":"Urzyczyn, P., On Algorithmically Trivial Structures. Warsaw University Report 1979."}],"container-title":["Lecture Notes in Computer Science","Logic of Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-11160-3_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T01:18:15Z","timestamp":1640913495000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-11160-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540111603","9783540386315"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/3-540-11160-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]}}}