{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:25:44Z","timestamp":1725585944123},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642221187"},{"type":"electronic","value":"9783642221194"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22119-4_20","type":"book-chapter","created":{"date-parts":[[2011,6,15]],"date-time":"2011-06-15T10:21:08Z","timestamp":1308133268000},"page":"248-262","source":"Crossref","is-referenced-by-count":3,"title":["A Hypersequent System for G\u00f6del-Dummett Logic with Non-constant Domains"],"prefix":"10.1007","author":[{"given":"Alwen","family":"Tiu","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Avellone, A., Ferrari, M., Miglioli, P.: Duplication-free tableau calculi and related cut-free sequent calculi for the interpolable propositional intermediate logics. In: Logic Journal of the IGPL, vol.\u00a07(4), pp. 447\u2013480 (1999)","DOI":"10.1093\/jigpal\/7.4.447"},{"key":"20_CR2","series-title":"Contemporary Mathematics","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1090\/conm\/235\/03471","volume-title":"Proc. of the Eleventh Brazilian Conference on Mathematical Logic 1996","author":"A. Avellone","year":"1999","unstructured":"Avellone, A., Ferrari, M., Miglioli, P., Moscato, U.: A tableau calculus for Dummett predicate logic. In: Proc. of the Eleventh Brazilian Conference on Mathematical Logic 1996. Contemporary Mathematics, vol.\u00a0235, pp. 135\u2013150. American Mathematical Society, Providence (1999)"},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF01531058","volume":"4","author":"A. Avron","year":"1991","unstructured":"Avron, A.: Hypersequents, logical consequence and intermediate logics for concurrency. Ann. Math. Artif. Intell.\u00a04, 225\u2013248 (1991)","journal-title":"Ann. Math. Artif. Intell."},{"key":"20_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/3-540-45616-3_3","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"M. Baaz","year":"2002","unstructured":"Baaz, M., Ciabattoni, A.: A sch\u00fctte-tait style cut-elimination proof for first-order g\u00f6del logic. In: Egly, U., Ferm\u00fcller, C. (eds.) TABLEAUX 2002. LNCS (LNAI), vol.\u00a02381, pp. 24\u201337. Springer, Heidelberg (2002)"},{"issue":"6","key":"20_CR5","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1093\/logcom\/13.6.835","volume":"13","author":"M. Baaz","year":"2003","unstructured":"Baaz, M., Ciabattoni, A., Ferm\u00fcller, C.G.: Hypersequent calculi for G\u00f6del logics - a survey. J. Log. Comput.\u00a013(6), 835\u2013861 (2003)","journal-title":"J. Log. Comput."},{"issue":"1","key":"20_CR6","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/s11225-006-6603-6","volume":"82","author":"M. Baaz","year":"2006","unstructured":"Baaz, M., Iemhoff, R.: Gentzen calculi for the existence predicate. Studia Logica\u00a082(1), 7\u201323 (2006)","journal-title":"Studia Logica"},{"issue":"1","key":"20_CR7","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s11225-006-6605-4","volume":"82","author":"K. Br\u00fcnnler","year":"2006","unstructured":"Br\u00fcnnler, K.: Cut elimination inside a deep inference system for classical predicate logic. Studia Logica\u00a082(1), 51\u201371 (2006)","journal-title":"Studia Logica"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-642-16242-8_13","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"K. Br\u00fcnnler","year":"2010","unstructured":"Br\u00fcnnler, K.: How to universally close the existential rule. In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS, vol.\u00a06397, pp. 172\u2013186. Springer, Heidelberg (2010)"},{"issue":"4","key":"20_CR9","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s00153-004-0265-8","volume":"44","author":"A. Ciabattoni","year":"2005","unstructured":"Ciabattoni, A.: A proof-theoretical investigation of global intuitionistic (fuzzy) logic. Arch. Math. Log.\u00a044(4), 435\u2013457 (2005)","journal-title":"Arch. Math. Log."},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1002\/malq.19890350402","volume":"35","author":"G. Corsi","year":"1989","unstructured":"Corsi, G.: A cut-free calculus for Dummett\u2019s LC quantified. Zeitschr. f. math. Logik und Grundlagen d. Math.\u00a035, 289\u2013301 (1989)","journal-title":"Zeitschr. f. math. Logik und Grundlagen d. Math."},{"issue":"2","key":"20_CR11","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/BF00370118","volume":"51","author":"G. Corsi","year":"1992","unstructured":"Corsi, G.: Completeness theorem for Dummett\u2019s LC quantified and some of its extensions. Studia Logica\u00a051(2), 317\u2013336 (1992)","journal-title":"Studia Logica"},{"issue":"2","key":"20_CR12","doi-asserted-by":"publisher","first-page":"97","DOI":"10.2307\/2964753","volume":"24","author":"M. Dummett","year":"1959","unstructured":"Dummett, M.: A propositional calculus with denumerable matrix. J. Symbolic Logic\u00a024(2), 97\u2013106 (1959)","journal-title":"J. Symbolic Logic"},{"issue":"3","key":"20_CR13","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1093\/jigpal\/7.3.319","volume":"7","author":"R. Dyckhoff","year":"1999","unstructured":"Dyckhoff, R.: A deterministic terminating sequent calculus for G\u00f6del-Dummett logic. Logic Journal of the IGPL\u00a07(3), 319\u2013326 (1999)","journal-title":"Logic Journal of the IGPL"},{"key":"20_CR14","volume-title":"Collected Works","author":"K. G\u00f6del","year":"1986","unstructured":"G\u00f6del, K.: On the intuitionistic propositional calculus. In: Feferman, S., Dawson Jr, S.W., Kleene, S.C., Moore, G.H., Solovay, R.M., van Heijenoort, J. (eds.) Collected Works, vol.\u00a01. Oxford University Press, Oxford (1986)"},{"issue":"4","key":"20_CR15","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1093\/logcom\/exi031","volume":"15","author":"R. Iemhoff","year":"2005","unstructured":"Iemhoff, R.: A note on linear Kripke models. J. Log. Comput.\u00a015(4), 489\u2013506 (2005)","journal-title":"J. Log. Comput."},{"issue":"1-2","key":"20_CR16","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0304-3975(99)00171-1","volume":"232","author":"R. McDowell","year":"2000","unstructured":"McDowell, R., Miller, D.: Cut-elimination for a logic with definitions and induction. Theor. Comput. Sci.\u00a0232(1-2), 91\u2013119 (2000)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"20_CR17","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1093\/logcom\/1.4.497","volume":"1","author":"D. Miller","year":"1991","unstructured":"Miller, D.: A logic programming language with lambda-abstraction, function variables, and simple unification. J. Log. Comput.\u00a01(4), 497\u2013536 (1991)","journal-title":"J. Log. Comput."},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Poggiolesi, F.: The tree-hypersequent method for modal propositional logic. Trends in Logic: Towards Mathematical Philsophy, 9\u201330 (2009)","DOI":"10.1007\/978-1-4020-9084-4_3"},{"key":"20_CR19","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1007\/BFb0061839","volume-title":"Applications of Sheaves","author":"D. Scott","year":"1979","unstructured":"Scott, D.: Identity and existence in intuitionistic logic. In: Fourman, M., Mulvey, C., Scott, D. (eds.) Applications of Sheaves. Lecture Notes in Mathematics, vol.\u00a0753, pp. 660\u2013696. Springer, Berlin (1979)"},{"key":"20_CR20","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BF00296176","volume":"18","author":"J.K. Slaney","year":"1989","unstructured":"Slaney, J.K.: Solution to a problem of Ono and Komori. Journal of Philosophical Logic\u00a018, 103\u2013111 (1989)","journal-title":"Journal of Philosophical Logic"},{"key":"20_CR21","first-page":"7","volume":"7","author":"O. Sonobe","year":"1975","unstructured":"Sonobe, O.: A Gentzen-type formulation of some intermediate propositional logics. J. Tsuda College\u00a07, 7\u201314 (1975)","journal-title":"J. Tsuda College"},{"key":"20_CR22","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/11916277_17","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"A. Tiu","year":"2006","unstructured":"Tiu, A.: A local system for intuitionistic logic. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol.\u00a04246, pp. 242\u2013256. Springer, Heidelberg (2006)"},{"key":"20_CR23","volume-title":"Basic Proof Theory","author":"A. Troelstra","year":"1996","unstructured":"Troelstra, A., Schwichtenberg, H.: Basic Proof Theory. Cambridge University Press, Cambridge (1996)"},{"key":"20_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85108-0","volume-title":"Logic and Structure","author":"D. Dalen van","year":"2004","unstructured":"van Dalen, D.: Logic and Structure. Springer, Heidelberg (2004)"},{"key":"20_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-1280-4","volume-title":"Displaying Modal Logic","author":"H. Wansing","year":"1998","unstructured":"Wansing, H.: Displaying Modal Logic. Kluwer Academic Publishers, Boston (1998)"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning with Analytic Tableaux and Related Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22119-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T18:14:44Z","timestamp":1553796884000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22119-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642221187","9783642221194"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22119-4_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}