{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:18:32Z","timestamp":1725664712280},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540613770"},{"type":"electronic","value":"9783540685074"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61377-3_28","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:35:15Z","timestamp":1330292115000},"page":"1-15","source":"Crossref","is-referenced-by-count":10,"title":["Incompleteness of a first-order g\u00f6del logic and some temporal logics of programs"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Baaz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Leitsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Zach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"issue":"6","key":"1_CR1","first-page":"333","volume":"29","author":"M. Baaz","year":"1994","unstructured":"M. Baaz, C. G. Ferm\u00fcller, and R. Zach. Elimination of cuts in first-order finite-valued logics. J. Inform. Process. Cybernet.\nEIK, 29(6), 333\u2013355, 1994.","journal-title":"J. Inform. Process. Cybernet."},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"M. Baaz, A. Leitsch, and R. Zach. Completeness of a first-order temporal logic with time-gaps. Theoret. Comput. Sci., 1996 to appear.","DOI":"10.1016\/0304-3975(95)00107-7"},{"key":"1_CR3","doi-asserted-by":"crossref","first-page":"97","DOI":"10.2307\/2964753","volume":"24","author":"M. Dummett","year":"1959","unstructured":"M. Dummett. A prepositional calculus with denumerable matrix. J. Symbolic Logic, 24, 97\u2013106, 1959.","journal-title":"J. Symbolic Logic"},{"key":"1_CR4","first-page":"65","volume":"69","author":"K. G\u00f6del","year":"1932","unstructured":"K. G\u00f6del. Zum intuitionistischen Aussagenkalk\u00fcl. Anz. Akad. Wiss. Wien, 69, 65\u201366, 1932.","journal-title":"Anz. Akad. Wiss. Wien"},{"key":"1_CR5","volume-title":"EATCS Monographs in Computer Science 8","author":"F. Kroger","year":"1987","unstructured":"F. Kroger. Temporal Logic of Programs. EATCS Monographs in Computer Science 8. (Springer, Berlin, 1987)."},{"key":"1_CR6","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0304-3975(90)90161-A","volume":"73","author":"F. Kr\u00f6ger","year":"1990","unstructured":"F. Kr\u00f6ger. On the interpretability of arithmetic in temporal logic. Theoret. Cornput. Sci., 73, 47\u201360, 1990.","journal-title":"Theoret. Cornput. Sci."},{"issue":"2","key":"1_CR7","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1080\/11663081.1992.10510779","volume":"2","author":"S. Merz","year":"1992","unstructured":"S. Merz. Decidability and incompleteness results for first-order temporal logics of linear time. J. Applied Non-Classical Logics, 2(2), 139\u2013156, 1992.","journal-title":"J. Applied Non-Classical Logics"},{"key":"1_CR8","doi-asserted-by":"crossref","first-page":"159","DOI":"10.2307\/2964111","volume":"27","author":"B. Scarpellini","year":"1962","unstructured":"B. Scarpellini. Die Nichtaxiomatisierbarkeit des unendlichwertigen Pr\u00e4dikatenkalk\u00fcls von Lukasiewicz. J. Symbolic Logic, 27, 159\u2013170, 1962.","journal-title":"J. Symbolic Logic"},{"key":"1_CR9","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0304-3975(86)90157-X","volume":"47","author":"A. Szalas","year":"1986","unstructured":"A. Szalas. Concerning the semantic consequence relation in first-order temporal logic. Theoret. Comput. Sci., 47, 329\u2013334, 1986.","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR10","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0304-3975(88)90045-X","volume":"57","author":"A. Szalas","year":"1988","unstructured":"A. Szalas and L. Holenderski. Incompleteness of first-order temporal logic with until. Theoret. Comput. Sci., 57, 317\u2013325, 1988.","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR11","doi-asserted-by":"crossref","first-page":"851","DOI":"10.2307\/2274139","volume":"49","author":"G. Takeuti","year":"1984","unstructured":"G. Takeuti and T. Titani. Intuitionistic fuzzy logic and instuitionistic fuzzy set theory. J. Symbolic Logic, 49, 851\u2013866, 1984.","journal-title":"J. Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61377-3_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:31:43Z","timestamp":1619573503000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61377-3_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540613770","9783540685074"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-61377-3_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}