{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T02:10:26Z","timestamp":1736129426200,"version":"3.32.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":26,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540529535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029619","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T05:33:46Z","timestamp":1133415226000},"page":"277-284","source":"Crossref","is-referenced-by-count":0,"title":["A first-order logic for partial recursive functions"],"prefix":"10.1007","author":[{"given":"Antonio","family":"Gavilanes-Franco","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1145\/357146.357150","volume":"3","author":"K. R. Apt","year":"1981","unstructured":"Ten years of Hoare's logic: a survey \u2014 Part I. K. R. Apt. ACM Trans. Prog. Lang. Syst. 3, 431\u2013483, 1981.","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"28_CR2","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF00264250","volume":"21","author":"H. Barringer","year":"1984","unstructured":"A logic covering undefinedness in program proofs. H. Barringer, J. H. Cheng, C. B. Jones. Acta Informatica 21, 251\u2013269, 1984.","journal-title":"Acta Informatica"},{"key":"28_CR3","first-page":"1","volume":"III","author":"S. Blamey","year":"1986","unstructured":"Partial logic. S. Blamey. Handbook of Philosophical Logic, Vol. III, 1\u201370, D. Reidel Publishing Company, 1986.","journal-title":"Handbook of Philosophical Logic"},{"key":"28_CR4","doi-asserted-by":"crossref","DOI":"10.1515\/9783112720875","volume-title":"A model theoretic oriented approach to partial algebras","author":"P. Burmeister","year":"1986","unstructured":"A model theoretic oriented approach to partial algebras. P. Burmeister. Part I. Akademie Verlag, Berlin, 1986."},{"key":"28_CR5","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF00625280","volume":"18","author":"M. Broy","year":"1982","unstructured":"Partial abstract types. M. Broy, M. Wirsing. Acta Informatica 18, 47\u201364, 1982.","journal-title":"Acta Informatica"},{"key":"28_CR6","unstructured":"Programmation en logique trivalu\u00e9e. J. P. Delahaye. European Workshop on Logical Method in Artificial Intelligence, JELIA 88, 1988."},{"key":"28_CR7","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0304-3975(86)90096-4","volume":"48","author":"M. Fitting","year":"1986","unstructured":"Partial models and logic programming. M. Fitting. Theoretical Computer Science 48, 229\u2013255, 1986.","journal-title":"Theoretical Computer Science"},{"key":"28_CR8","unstructured":"Una l\u00f3gica trivalorada para functiones recursivas parciales. A. Gavilanes. Thesis. Madrid, 1989."},{"key":"28_CR9","unstructured":"A first-order logic for partial recursive functions. A. Gavilanes. Technical Report DIA 89\/2, FEB\/89. Univ. Comp. Madrid, 1989."},{"key":"28_CR10","unstructured":"Standard versus nonstandard semantics in logics for functional programs. A. Gil-Luezas, T. Hortal\u00e1-Gonz\u00e1lez, M. Rodr\u00edguez-Artalejo. Technical Report DIA 89\/7, AUG\/89. Univ. Comp. Madrid, 1989."},{"key":"28_CR11","unstructured":"A first order logic for partial functions. A. Gavilanes, F. Lucio. To appear in Theoretical Computer Science."},{"key":"28_CR12","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BFb0028972","volume":"349","author":"A. Gavilanes","year":"1989","unstructured":"A first order logic for partial functions. A. Gavilanes, F. Lucio. STACS'89. Proceedings. Lecture Notes in Computer Science 349, 47\u201358, 1989.","journal-title":"Lecture Notes in Computer Science"},{"key":"28_CR13","unstructured":"Ein Hoare kalk\u00fcl f\u00fcr die sprache der getypten lambda-terme. Korrektheit, vollst\u00e4ndigkeit, anwendungen. A. Goerdt. Thesis, 1986."},{"key":"28_CR14","unstructured":"Hoare logic for lambda-terms as basis of Hoare logic for imperative languages. A. Goerdt. IEEE, 293\u2013299, 1987."},{"key":"28_CR15","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF00292109","volume":"24","author":"A. Hoogewijs","year":"1987","unstructured":"Partial-predicate logic in computer science. A. Hoogewijs. Acta Informatica 24, 281\u2013293, 1987.","journal-title":"Acta Informatica"},{"key":"28_CR16","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1007\/3-540-50214-9_19","volume":"328","author":"B. Konikowska","year":"1988","unstructured":"A three-valued logic for software specification and validation. B. Konikowska, A. Tarlecki, A. Blikle. VDM'88. Proceedings. Lecture Notes in Computer Science 328, 218\u2013242, 1988.","journal-title":"Lecture Notes in Computer Science"},{"key":"28_CR17","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/3-540-51237-3_16","volume":"363","author":"A. J. Kfoury","year":"1989","unstructured":"ALGOL-like languages with higher-order procedures and their expressive power. A. J. Kfoury, P. Urzyczyn. Logic at Botik'89. Proceedings. Lecture Notes in Computer Science 363, 186\u2013199, 1989.","journal-title":"Lecture Notes in Computer Science"},{"issue":"4","key":"28_CR18","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1145\/29873.30399","volume":"9","author":"J. Loeckx","year":"1987","unstructured":"Algorithmic specifications: a constructive specification method for abstract data types. J. Loeckx. ACM Trans. on Prog. Lang., vol. 9, n. 4, 646\u2013685, 1987.","journal-title":"ACM Trans. on Prog. Lang."},{"key":"28_CR19","unstructured":"Mathematical theory of computation. Z. Manna. McGraw Hill, 1974."},{"key":"28_CR20","unstructured":"Initial Computability, Algebraic Specifications, and Partial Algebras. H. Reichel. Oxford Science Publications, 1987."},{"key":"28_CR21","unstructured":"Outline of a mathematical theory of computation technical monograph PRG-2. D. S. Scott. Oxford University Computing Laboratory, 1970."},{"key":"28_CR22","unstructured":"Domains for denotational semantics. D. S. Scott. ICALP'82, Aarhus, Denmark, 1982."},{"key":"28_CR23","unstructured":"First-order logic. R. M. Smullyan. Springer-Verlag, 1968."},{"key":"28_CR24","unstructured":"Denotational semantics: The Scott-Strachey approach to programming language theory. J. Stoy. MIT Press, 1977."},{"issue":"8","key":"28_CR25","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1145\/360303.360308","volume":"19","author":"R. D. Tennent","year":"1976","unstructured":"The denotational semantics of programming languages. R. D. Tennent. Comm. ACM 19 (8), 437\u2013453, 1976.","journal-title":"Comm. ACM"},{"key":"28_CR26","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1007\/3-540-12896-4_382","volume":"164","author":"B. A. Trakhtenbrot","year":"1983","unstructured":"From denotational to operational and axiomatic semantics for ALGOL-like languages: An overview. B. A. Trakhtenbrot, J. Y. Halpern, A. R. Meyer. Logics of Programs. Proceedings. Lecture Notes in Computer Science 164, 474\u2013500, 1983.","journal-title":"Lecture Notes in Computer Science"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1990"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0029619.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T01:34:27Z","timestamp":1736127267000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029619"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540529535"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/bfb0029619","relation":{},"subject":[]}}