{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:00:29Z","timestamp":1725512429290},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540797081"},{"type":"electronic","value":"9783540797098"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79709-8_9","type":"book-chapter","created":{"date-parts":[[2008,5,13]],"date-time":"2008-05-13T10:33:17Z","timestamp":1210674797000},"page":"52-63","source":"Crossref","is-referenced-by-count":1,"title":["A Triple Correspondence in Canonical Calculi: Strong Cut-Elimination, Coherence, and Non-deterministic Semantics"],"prefix":"10.1007","author":[{"given":"Arnon","family":"Avron","sequence":"first","affiliation":[]},{"given":"Anna","family":"Zamansky","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF00881838","volume":"10","author":"A. Avron","year":"1993","unstructured":"Avron, A.: Gentzen-Type Systems, Resolution and Tableaux. Journal of Automated Reasoning\u00a010, 265\u2013281 (1993)","journal-title":"Journal of Automated Reasoning"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1093\/logcom\/exi001","volume":"15","author":"A. Avron","year":"2005","unstructured":"Avron, A.,, Lev, I.: Non-deterministic Multi-valued Structures. Journal of Logic and Computation\u00a015, 241\u2013261 (2005)","journal-title":"Journal of Logic and Computation"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-540-72734-7_3","volume-title":"Logical Foundations of Computer Science","author":"A. Avron","year":"2007","unstructured":"Avron, A., Zamansky, A.: Generalized Non-deterministic matrices and (n,k)-ary quantifiers. In: Artemov, S.N., Nerode, A. (eds.) LFCS 2007. LNCS, vol.\u00a04514, pp. 26\u201341. Springer, Heidelberg (2007)"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Avron, A., Zamansky, A.: Canonical calculi with (n,k)-ary quantifiers. Journal of Logical Methods in Computer Science (forthcming, 2008)","DOI":"10.2168\/LMCS-4(3:2)2008"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1005022012721","volume":"61","author":"M. Baaz","year":"1998","unstructured":"Baaz, M., Ferm\u00fcller, C.G., Salzer, G., Zach, R.: Labeled Calculi and Finite-valued Logics. Studia Logica\u00a061, 7\u201333 (1998)","journal-title":"Studia Logica"},{"issue":"2","key":"9_CR6","doi-asserted-by":"publisher","first-page":"473","DOI":"10.2307\/2274395","volume":"52","author":"W.A. Carnielli","year":"1987","unstructured":"Carnielli, W.A.: Systematization of Finite Many-valued Logics through the method of Tableaux. Journal of Symbolic Logic\u00a052(2), 473\u2013493 (1987)","journal-title":"Journal of Symbolic Logic"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Carnielli, W.A., Conglio, M.E.: Splitting Logics. In: Artemov,, Barringer,, Garcez,, Lamb (eds.) We Will Show Them!, Essays in Honour of Dov Gabbay, vol.\u00a01, pp. 389\u2013414. Woods College Publications (2005)","DOI":"10.1007\/978-1-4020-6782-2_9"},{"key":"9_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/11916277_10","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"A. Ciabattoni","year":"2006","unstructured":"Ciabattoni, A., Terui, K.: Modular cut-elimination: Finding proofs or counter-examples. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol.\u00a04246, pp. 135\u2013149. Springer, Heidelberg (2006)"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"56","DOI":"10.2307\/2266170","volume":"5","author":"A. Church","year":"1940","unstructured":"Church, A.: A formulation of the simple theory of types. Journal of Symbolic Logic\u00a05, 56\u201368 (1940)","journal-title":"Journal of Symbolic Logic"},{"key":"9_CR10","first-page":"68","volume-title":"The collected works of Gerhard Gentzen","author":"G. Gentzen","year":"1969","unstructured":"Gentzen, G.: Investigations into Logical Deduction. In: Szabo, M.E. (ed.) The collected works of Gerhard Gentzen, pp. 68\u2013131. North Holland, Amsterdam (1969)"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1023\/A:1005086415447","volume":"61","author":"R. H\u00e4hnle","year":"1998","unstructured":"H\u00e4hnle, R.: Commodious Axiomatization of Quantifiers in Many-valued Logic. Studia Logica\u00a061, 101\u2013121 (1998)","journal-title":"Studia Logica"},{"key":"9_CR12","unstructured":"Henkin, L.: Some remarks on infinitely long formulas. In: Infinistic Methods, pp. 167\u2013183. Pergamon Press, Oxford (1961)"},{"key":"9_CR13","volume-title":"Logic, Techniques. of Formal Reasoning","author":"D. Kalish","year":"1964","unstructured":"Kalish, D., Montague, R.: Logic, Techniques. of Formal Reasoning. Brace and World, Inc., New York, Harcourt (1964)"},{"key":"9_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-45616-3_2","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"D. Miller","year":"2002","unstructured":"Miller, D., Pimentel, E.: Using Linear logic to reason about sequent systems. In: Egly, U., Ferm\u00fcller, C. (eds.) TABLEAUX 2002. LNCS (LNAI), vol.\u00a02381, pp. 2\u201323. Springer, Heidelberg (2002)"},{"key":"9_CR15","first-page":"275","volume":"50","author":"P. Shroeder-Heister","year":"1985","unstructured":"Shroeder-Heister, P.: Natural deduction calculi with rules of higher levels. Journal of Symbolic Logic\u00a050, 275\u2013276 (1985)","journal-title":"Journal of Symbolic Logic"},{"key":"9_CR16","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1017\/CBO9781139168717","volume-title":"Basic Proof Theory","author":"A.S. Troelstra","year":"2000","unstructured":"Troelstra, A.S., Schwichtenberg, H.: Basic Proof Theory, pp. 126\u2013130. Cambridge University Press, Cambridge (2000)"},{"issue":"1","key":"9_CR17","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s11225-006-6611-6","volume":"82","author":"A. Zamansky","year":"2006","unstructured":"Zamansky, A., Avron, A.: \u2018Cut Elimination and Quantification in Canonical Systems\u2019. Studia Logica\u00a082(1), 157\u2013176 (2006)","journal-title":"Studia Logica"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79709-8_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:28:57Z","timestamp":1619508537000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79709-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540797081","9783540797098"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79709-8_9","relation":{},"subject":[]}}