{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:38:11Z","timestamp":1725565091765},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223450"},{"type":"electronic","value":"9783540259848"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25984-8_19","type":"book-chapter","created":{"date-parts":[[2010,9,11]],"date-time":"2010-09-11T02:31:38Z","timestamp":1284172298000},"page":"274-288","source":"Crossref","is-referenced-by-count":3,"title":["Counter-Model Search in G\u00f6del-Dummett Logics"],"prefix":"10.1007","author":[{"given":"Dominique","family":"Larchey-Wendling","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"19_CR1","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1093\/jigpal\/7.4.447","volume":"7","author":"A. Avellone","year":"1999","unstructured":"Avellone, A., Ferrari, M., Miglioli, P.: Duplication-Free Tableau Calculi and Related Cut-Free Sequent Calculi for the Interpolable Propositional Intermediate Logics. Logic Journal of the IGPL\u00a07(4), 447\u2013480 (1999)","journal-title":"Logic Journal of the IGPL"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/10722086_11","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"A. Avron","year":"2000","unstructured":"Avron, A.: A Tableau System for G\u00f6del-Dummett Logic Based on a Hypersequent Calculus. In: Dyckhoff, R. (ed.) TABLEAUX 2000. LNCS, vol.\u00a01847, pp. 98\u2013111. Springer, Heidelberg (2000)"},{"issue":"2","key":"19_CR3","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1023\/A:1013813806341","volume":"69","author":"A. Avron","year":"2001","unstructured":"Avron, A., Konikowska, B.: Decomposition Proof Systems for G\u00f6del- Dummett Logics. Studia Logica\u00a069(2), 197\u2013219 (2001)","journal-title":"Studia Logica"},{"key":"19_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-48754-9_8","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"M. Baaz","year":"1999","unstructured":"Baaz, M., Ferm\u00fcller, C.: Analytic Calculi for Projective Logics. In: Murray, N.V. (ed.) TABLEAUX 1999. LNCS (LNAI), vol.\u00a01617, pp. 36\u201350. Springer, Heidelberg (1999)"},{"issue":"8","key":"19_CR5","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C-35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers\u00a0C-35(8), 677\u2013691 (1986)","journal-title":"IEEE Transactions on Computers"},{"key":"19_CR6","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1017\/S0022481200125848","volume":"24","author":"M. Dummett","year":"1959","unstructured":"Dummett, M.: A Propositional Calculus with a Denumerable matrix. Journal of Symbolic Logic\u00a024, 96\u2013107 (1959)","journal-title":"Journal of Symbolic Logic"},{"issue":"3","key":"19_CR7","doi-asserted-by":"publisher","first-page":"795","DOI":"10.2307\/2275431","volume":"57","author":"R. Dyckhoff","year":"1992","unstructured":"Dyckhoff, R.: Contraction-free Sequent Calculi for Intuitionistic Logic. Journal of Symbolic Logic\u00a057(3), 795\u2013807 (1992)","journal-title":"Journal of Symbolic Logic"},{"key":"19_CR8","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. Logical Journal of the IGPL\u00a07, 319\u2013326 (1999)","journal-title":"Logical Journal of the IGPL"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-540-45206-5_7","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"C. Ferm\u00fcller","year":"2003","unstructured":"Ferm\u00fcller, C.: Parallel Dialogue Games and Hypersequents for Intermediate Logics. In: Cialdea Mayer, M., Pirri, F. (eds.) TABLEAUX 2003. LNCS, vol.\u00a02796, pp. 48\u201364. Springer, Heidelberg (2003)"},{"key":"19_CR10","first-page":"65","volume":"69","author":"K. G\u00f6del","year":"1932","unstructured":"G\u00f6del, K.: Zum intuitionistischen Aussagenkalk\u00fcl. Anzeiger Akademie des Wissenschaften Wien\u00a069, 65\u201366 (1932)","journal-title":"Anzeiger Akademie des Wissenschaften Wien"},{"key":"19_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-011-5300-3","volume-title":"Metamathematics of Fuzzy Logic","author":"P. Hajek","year":"1998","unstructured":"Hajek, P.: Metamathematics of Fuzzy Logic. Kluwer Academic Publishers, Dordrecht (1998)"},{"key":"19_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/3-540-45620-1_7","volume-title":"Automated Deduction - CADE-18","author":"D. Larchey-Wendling","year":"2002","unstructured":"Larchey-Wendling, D.: Combining Proof-Search and Counter-Model Construction for Deciding G\u00f6del-Dummett Logic. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol.\u00a02392, pp. 94\u2013110. Springer, Heidelberg (2002)"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-540-45220-1_33","volume-title":"Computer Science Logic","author":"G. Metcalfe","year":"2003","unstructured":"Metcalfe, G., Olivetti, N., Gabbay, D.: Goal-Directed Calculi for G\u00f6del-Dummett Logics. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol.\u00a02803, pp. 413\u2013426. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25984-8_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:21:20Z","timestamp":1620012080000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25984-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223450","9783540259848"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25984-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}