{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:25:27Z","timestamp":1725488727890},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540668367"},{"type":"electronic","value":"9783540466918"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46691-6_20","type":"book-chapter","created":{"date-parts":[[2007,8,9]],"date-time":"2007-08-09T16:42:24Z","timestamp":1186677744000},"page":"258-268","source":"Crossref","is-referenced-by-count":1,"title":["On the Undecidability of Some Sub-classical First-Order Logics"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Baaz","sequence":"first","affiliation":[]},{"given":"Agata","family":"Ciabattoni","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Ferm\u00fcller","sequence":"additional","affiliation":[]},{"given":"Helmut","family":"Veith","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,6,9]]},"reference":[{"issue":"199","key":"20_CR1","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF01531058","volume":"4","author":"A. Avron","year":"1991","unstructured":"A. Avron. Hypersequents, logical consequence and intermediate logics for concurrency. Annals for Mathematics and Artificial Intelligence, 4(199):225\u2013248, 1991. 263, 264, 265, 265","journal-title":"Annals for Mathematics and Artificial Intelligence"},{"key":"20_CR2","first-page":"1","volume-title":"Logic: from Foundations to Applications, European Logic Colloquium","author":"A. Avron","year":"1996","unstructured":"A. Avron. The method of hypersequents in the proof theory of propositional nonclassical logics.In Logic: from Foundations to Applications, European Logic Colloquium, pages 1\u201332. Oxford Science Publications. Clarendon Press. Oxford, 1996. 264"},{"key":"20_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BFb0055769","volume-title":"Mathematical Foundations of Computer Science 1998, 23rd International Symposium, MFCS\u201998, Brno, Czech Republic, August 24-28, 1998, Proceedings","author":"M. Baaz","year":"1998","unstructured":"M. Baaz, A. Ciabattoni, C. F erm\u00fcller, and H. Veith. Proof theory of fuzzy logics: Urquhart\u2019s C and related logics. In Mathematical Foundations of Computer Science 1998, 23rd International Symposium, MFCS\u201998, Brno, Czech Republic, August 24-28, 1998, Proceedings, volume 1450 of LNCS, pages 203\u2013212. Springer-Verlag, 1998. 258, 259, 263, 263, 263, 263, 264, 265, 265, 266"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"A. Ciabattoni. Bounded contraction in systems with linearity. In N. Murray, editor, Automated Reasoning with Analytic Tableaux and Related Methods, International Conference, TABLEAUX\u201999, Saratoga Springs, volume 1617 of LNAI, pages 113\u2013128. Springer-Verlag, 1999. To appear. 266","DOI":"10.1007\/3-540-48754-9_13"},{"key":"20_CR5","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1017\/S0022481200125848","volume":"24","author":"M. Dummett","year":"1959","unstructured":"M. Dummett. A propositional calculus with a denumerable matrix. Journal of Symbolic Logic, 24:96\u2013107, 1959. 263","journal-title":"Journal of Symbolic Logic"},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J. Y. Girard","year":"1987","unstructured":"J. Y. Girard. Linear logic. Theoretical Computer Science, 50:1\u2013101, 1987. 263","journal-title":"Theoretical Computer Science"},{"key":"20_CR7","first-page":"65","volume":"69","author":"K. G\u00f6del","year":"1932","unstructured":"K. G\u00f6del. Zum intuitionistischen Aussagenkalk\u00fcl. Anzeiger der Akademie der Wissenschaften in Wien, 69:65\u201366, 1932. 263","journal-title":"Anzeiger der Akademie der Wissenschaften in Wien"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"P. H\u00e1jek. Metamathematics of Fuzzy Logic. Kluwer, 1998. 258, 259, 263, 263","DOI":"10.1007\/978-94-011-5300-3"},{"key":"20_CR9","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF01268618","volume":"35","author":"P. H\u00e1jek","year":"1996","unstructured":"P. H\u00e1jek, L. Godo, and F. Esteva. A complete many-valued logic with productconjunction. Archive for Math. Logic, 35:191\u2013208, 1996. 263","journal-title":"Archive for Math. Logic"},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/BF00370189","volume":"50\/2","author":"E. Kiriyama","year":"1991","unstructured":"E. Kiriyama and H. Ono. The contraction rule in decision problems for logics without structural rules. Studia Logica, 50\/2:299\u2013319, 1991. 258","journal-title":"Studia Logica"},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/BF00370272","volume":"45","author":"Y. Komori","year":"1985","unstructured":"Y. Komori. Predicate logics without structural rules. Studia Logica, 45:393\u2013404, 1985. 258","journal-title":"Studia Logica"},{"key":"20_CR12","first-page":"51","volume":"23","author":"J. Lukasiewicz","year":"1930","unstructured":"J. Lukasiewicz. Philosophische Bemerkungen zu mehrwertigen Systemen des Aussagenkalk \u00fcls. Comptes rendus des s\u00e9ances de la Soci\u00e9t\u00e9 des Sciences et des Lettres de Varsovie Cl. III, 23:51\u201377, 1930. 263","journal-title":"Comptes rendus des s\u00e9ances de la Soci\u00e9t\u00e9 des Sciences et des Lettres de Varsovie Cl. III"},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1305\/ndjfl\/1040149356","volume":"36\/3","author":"J.M. Mendez","year":"1995","unstructured":"J.M. M endez and F. Salto. Urquhart\u2019s C with intuitionistic negation: Dummett\u2019s LC without the contraction axiom. Notre Dame Journal of Formal Logic, 36\/3:407\u2013413, 1995. 258, 258, 263","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"20_CR14","doi-asserted-by":"crossref","first-page":"169","DOI":"10.2307\/2273798","volume":"50\/1","author":"H. Ono","year":"1985","unstructured":"H. Ono and Y. Komori. Logics without the contraction rule. Journal of Symbolic Logic, 50\/1:169\u2013201, 1985. 258, 265","journal-title":"Journal of Symbolic Logic"},{"key":"20_CR15","unstructured":"G. Takeuti. Proof Theory. North-Holland, Amsterdam, 2nd edition, 1987."},{"key":"20_CR16","volume-title":"Handbook of Philosophical Logic","author":"A. Urquhart","year":"1984","unstructured":"A. Urquhart. Many-valued logic. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, volume III. Reidel, Dordrecht, 1984. 258, 258, 263"},{"key":"20_CR17","unstructured":"A. Urquhart. Basic Many-valued logic. Manuscript, private communication, 1999. 258"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46691-6_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T17:58:21Z","timestamp":1556733501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46691-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540668367","9783540466918"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-46691-6_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}