乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T17:24:00Z","timestamp":1725902640116},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662553855"},{"type":"electronic","value":"9783662553862"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-662-55386-2_13","type":"book-chapter","created":{"date-parts":[[2017,6,28]],"date-time":"2017-06-28T11:24:53Z","timestamp":1498649093000},"page":"182-198","source":"Crossref","is-referenced-by-count":6,"title":["The Lambek Calculus with Iteration: Two Variants"],"prefix":"10.1007","author":[{"given":"Stepan","family":"Kuznetsov","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,29]]},"reference":[{"issue":"4","key":"13_CR1","doi-asserted-by":"crossref","first-page":"309","DOI":"10.3233\/FI-1998-33401","volume":"33","author":"M Brandt","year":"1998","unstructured":"Brandt, M., Henglein, F.: Coinductive axiomatization of recursive type equality and subtyping. Fundam. Inf. 33(4), 309\u2013338 (1998)","journal-title":"Fundam. Inf."},{"issue":"6","key":"13_CR2","doi-asserted-by":"crossref","first-page":"1177","DOI":"10.1093\/logcom\/exq052","volume":"21","author":"J Brotherston","year":"2011","unstructured":"Brotherston, J., Simpson, A.: Sequent calculi for induction and infinite descent. J. Log. Comput. 21(6), 1177\u20131216 (2011)","journal-title":"J. Log. Comput."},{"key":"13_CR3","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1002\/malq.19820281407","volume":"28","author":"W Buszkowski","year":"1982","unstructured":"Buszkowski, W.: Compatibility of a categorial grammar with an associated category system. Zeitschr. Math. Log. Grundl. Math. 28, 229\u2013238 (1982)","journal-title":"Zeitschr. Math. Log. Grundl. Math."},{"issue":"1","key":"13_CR4","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1093\/logcom\/exl036","volume":"17","author":"W Buszkowski","year":"2007","unstructured":"Buszkowski, W.: On action logic: equational theories of action algebras. J. Log. Lang. Comput. 17(1), 199\u2013217 (2007)","journal-title":"J. Log. Lang. Comput."},{"key":"13_CR5","volume-title":"Problem Solving in Automata, Languages, and Complexity","author":"D-Z Du","year":"2001","unstructured":"Du, D.-Z., Ko, K.-I.: Problem Solving in Automata, Languages, and Complexity. Wiley, New York (2001)"},{"issue":"1","key":"13_CR6","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1145\/321250.321254","volume":"12","author":"SA Greibach","year":"1965","unstructured":"Greibach, S.A.: A new normal-form theorem for context-free phrase structure grammars. J. ACM 12(1), 42\u201352 (1965)","journal-title":"J. ACM"},{"key":"13_CR7","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"2001","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison-Wesley, Boston (2001)","edition":"2"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/978-3-540-85958-1_33","volume-title":"Principles and Practice of Constraint Programming","author":"J Jaffar","year":"2008","unstructured":"Jaffar, J., Santosa, A.E., Voicu, R.: A coinduction rule for entailment of recursively defined properties. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol. 5202, pp. 493\u2013508. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-85958-1_33"},{"key":"13_CR9","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1023\/B:STUD.0000032089.54776.63","volume":"76","author":"P Jipsen","year":"2004","unstructured":"Jipsen, P.: From semirings to residuated Kleene algebras. Stud. Log. 76, 291\u2013303 (2004)","journal-title":"Stud. Log."},{"key":"13_CR10","doi-asserted-by":"crossref","first-page":"78","DOI":"10.7551\/mitpress\/4286.003.0007","volume-title":"Logic and Information Flow","author":"D Kozen","year":"1994","unstructured":"Kozen, D.: On action algebras. In: van Eijck, J., Visser, A. (eds.) Logic and Information Flow, pp. 78\u201388. MIT Press, Cambridge (1994)"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Kozen, D., Silva, A.: Practical coinduction. Math. Struct. Comp. Sci. 1\u201321 (2016). FirstView. https:\/\/doi.org\/10.1017\/S0960129515000493","DOI":"10.1017\/S0960129515000493"},{"issue":"3","key":"13_CR12","doi-asserted-by":"crossref","first-page":"154","DOI":"10.2307\/2310058","volume":"65","author":"J Lambek","year":"1958","unstructured":"Lambek, J.: The mathematics of sentence stucture. Am. Math. Mon. 65(3), 154\u2013170 (1958)","journal-title":"Am. Math. Mon."},{"issue":"4","key":"13_CR13","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1007\/BF01091743","volume":"10","author":"GE Mints","year":"1978","unstructured":"Mints, G.E.: Finite investigations on transfinite derivations. J. Math. Sci. 10(4), 548\u2013596 (1978)","journal-title":"J. Math. Sci."},{"issue":"2","key":"13_CR14","first-page":"295","volume":"78","author":"E Palka","year":"2007","unstructured":"Palka, E.: An infinitary sequent system for the equational theory of *-continuous action lattices. Fundam. Inform. 78(2), 295\u2013309 (2007)","journal-title":"Fundam. Inform."},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Pentus, M.: Lambek grammars are context-free. In: Proceedings of LICS 1993, pp. 429\u2013433 (1993)","DOI":"10.1109\/LICS.1993.287565"},{"issue":"2","key":"13_CR16","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01110612","volume":"3","author":"M Pentus","year":"1994","unstructured":"Pentus, M.: The conjoinability relation in Lambek calculus and linear logic. J. Log. Lang. Inf. 3(2), 121\u2013140 (1994)","journal-title":"J. Log. Lang. Inf."},{"issue":"1\u20132","key":"13_CR17","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0168-0072(94)00063-9","volume":"75","author":"M Pentus","year":"1995","unstructured":"Pentus, M.: Models for the Lambek calculus. Ann. Pure Appl. Log. 75(1\u20132), 179\u2013213 (1995)","journal-title":"Ann. Pure Appl. Log."},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Pous, D., Sangiorgi, D.: Enchancements of coinductive proof methods. In: Advanced Topics in Bisimulation and Coinduction. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511792588.007"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BFb0018436","volume-title":"Logics in AI","author":"V Pratt","year":"1991","unstructured":"Pratt, V.: Action logic and pure induction. In: Eijck, J. (ed.) JELIA 1990. LNCS, vol. 478, pp. 97\u2013120. Springer, Heidelberg (1991). doi: 10.1007\/BFb0018436"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-642-03741-2_10","volume-title":"Algebra and Coalgebra in Computer Science","author":"G Ro\u015fu","year":"2009","unstructured":"Ro\u015fu, G., Lucanu, D.: Circular coinduction: a proof theoretical foundation. In: Kurz, A., Lenisa, M., Tarlecki, A. (eds.) CALCO 2009. LNCS, vol. 5728, pp. 127\u2013144. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-03741-2_10"},{"key":"13_CR21","unstructured":"Ryzhkova, N.S.: Properties of the categorial dependencies calculus. Diploma Paper, Moscow State University (2013, unpublished). (in Russian)"},{"issue":"4","key":"13_CR22","doi-asserted-by":"crossref","first-page":"168","DOI":"10.3103\/S0027132207040092","volume":"62","author":"AN Safiullin","year":"2007","unstructured":"Safiullin, A.N.: Derivability of admissible rules with simple premises in the Lambek calculus. Moscow Univ. Math. Bull. 62(4), 168\u2013171 (2007)","journal-title":"Moscow Univ. Math. Bull."},{"key":"13_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-662-55386-2_z","volume-title":"WoLLIC 2017","author":"Y Savateev","year":"2017","unstructured":"Savateev, Y., Shamkanov, D.: Cut-elimination for the modal Grzegorczyk logic via non-well-founded proofs. In: Kennedy, J., de Queiroz, R.J.G.B. (eds.) WoLLIC 2017. LNCS, vol. 10388, pp. 321\u2013335. Springer, Berlin (2017). doi: 10.1007\/978-3-662-55386-2_z"},{"issue":"4","key":"13_CR24","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1134\/S0001434614090326","volume":"96","author":"DS Shamkanov","year":"2014","unstructured":"Shamkanov, D.S.: Circular proofs for the G\u00f6del - L\u00f6b provability logic. Math. Notes 96(4), 575\u2013585 (2014)","journal-title":"Math. Notes"},{"issue":"9","key":"13_CR25","doi-asserted-by":"crossref","first-page":"1344","DOI":"10.1070\/SM8667","volume":"207","author":"DS Shamkanov","year":"2016","unstructured":"Shamkanov, D.S.: A realization theorem for the G\u00f6del - L\u00f6b provability logic. Sbornik: Math. 207(9), 1344\u20131360 (2016)","journal-title":"Sbornik: Math."}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-55386-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,25]],"date-time":"2024-06-25T01:31:52Z","timestamp":1719279112000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-55386-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783662553855","9783662553862"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-55386-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}