{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T13:29:33Z","timestamp":1769693373520,"version":"3.49.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2004,6,1]],"date-time":"2004-06-01T00:00:00Z","timestamp":1086048000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,6,1]],"date-time":"2004-06-01T00:00:00Z","timestamp":1086048000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Studia Logica"],"published-print":{"date-parts":[[2004,6]]},"DOI":"10.1023\/b:stud.0000034183.33333.6f","type":"journal-article","created":{"date-parts":[[2004,7,7]],"date-time":"2004-07-07T21:08:48Z","timestamp":1089234528000},"page":"9-40","source":"Crossref","is-referenced-by-count":24,"title":["Light Affine Set Theory: A Naive Set Theory of Polynomial Time"],"prefix":"10.1007","volume":"77","author":[{"given":"Kazushige","family":"Terui","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"5379255_CR1","doi-asserted-by":"crossref","unstructured":"Asperti, A., \u2018Light affine logic\u2019, Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998, pp. 300-308.","DOI":"10.1109\/LICS.1998.705666"},{"issue":"1","key":"5379255_CR2","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/504077.504081","volume":"3","author":"A. Asperti","year":"2002","unstructured":"Asperti, A., and L. Roversi, \u2018Intuitionistic light affine logic (proof-nets, normalization complexity, expressive power, programming notation)\u2019, ACM Transactions on Computational Logic 3(1): 137-175, 2002.","journal-title":"ACM Transactions on Computational Logic"},{"key":"5379255_CR3","unstructured":"Baillot, P., \u2018Stratified coherent spaces: a denotational semantics for light linear logic\u2019, Theoretical Computer Science, to appear."},{"key":"5379255_CR4","volume-title":"The Lambda Calculus: Its Syntax and Semantics","author":"H. P. Barendregt","year":"1981","unstructured":"Barendregt, H. P., The Lambda Calculus: Its Syntax and Semantics, Elsevier North-Holland, 1981."},{"key":"5379255_CR5","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1023\/A:1025159016268","volume":"74","author":"A. Cantini","year":"2003","unstructured":"Cantini, A., \u2018The undecidability of Grishin's set theory\u2019, Studia Logica 74: 345-368, 2003.","journal-title":"Studia Logica"},{"issue":"1","key":"5379255_CR6","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0890-5401(03)00010-5","volume":"183","author":"V. Danos","year":"2003","unstructured":"Danos, V., and J.-B. Joinet, \u2018Linear logic & elementary time\u2019, Information and Computation 183(1): 123-137, 2003.","journal-title":"Information and Computation"},{"issue":"3","key":"5379255_CR7","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1006\/inco.1998.2700","volume":"14","author":"J. Girard","year":"1998","unstructured":"Girard, J.-Y., \u2018Light linear logic\u2019, Information and Computation 14(3): 175-204, 1998.","journal-title":"Information and Computation"},{"key":"5379255_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J. Girard","year":"1987","unstructured":"Girard, J.-Y., \u2018Linear logic\u2019, Theoretical Computer Science 50: 1-102, 1987.","journal-title":"Theoretical Computer Science"},{"key":"5379255_CR9","unstructured":"Grishin, V. N., \u2018A nonstandard logic and its application to set theory\u2019, In Studies in Formalized Languages and Nonclassical Logics (Russian), Izdat, Nauka, Moskow, 1974, pp. 135-171."},{"issue":"1","key":"5379255_CR10","first-page":"47","volume":"45","author":"V. N. Grishin","year":"1981","unstructured":"Grishin, V. N., \u2018Predicate and set theoretic calculi based on logic without contraction rules\u2019 (Russian), Izvestiya Akademii Nauk SSSR Seriya Matematicheskaya 45(1): 47-68, 1981. English translation in Math. USSR Izv. 18(1): 41\u201359, 1982.","journal-title":"Izvestiya Akademii Nauk SSSR Seriya Matematicheskaya"},{"key":"5379255_CR11","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J. Hopcroft","year":"1979","unstructured":"Hopcroft, J., and J. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, Mass, 1979."},{"issue":"3","key":"5379255_CR12","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1016\/S0304-3975(01)00177-3","volume":"244","author":"M Kanovitch","year":"2003","unstructured":"Kanovitch, M, M. Okada, and A. Scedrov, \u2018Phase semantics for light linear logic\u2019, Theoretical Computer Science 244(3): 525-549, 2003.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"5379255_CR13","first-page":"585","volume":"34","author":"Y. Komori","year":"1989","unstructured":"Komori, Y., \u2018Illative combinatory logic based on BCK-logic\u2019, Mathematica Japonica 34(4): 585-596, 1989.","journal-title":"Mathematica Japonica"},{"key":"5379255_CR14","doi-asserted-by":"crossref","unstructured":"Lincoln, P., A. Scedrov, and N. Shankar, \u2018Decision problems for second order linear logic\u2019, Proceedings of the Tenth Annual IEEE Symposium on Logic in Computer Science, 1995, pp. 476-485.","DOI":"10.1109\/LICS.1995.523281"},{"key":"5379255_CR15","first-page":"427","volume":"1862","author":"A. S. Murawski","year":"2000","unstructured":"Murawski, A. S., and C.-H. L. Ong, \u2018Discreet games, light affine logic and PTIME computation\u2019, Proceedings of Computer Science Logic 2000, Springer-Verlag, LNCS 1862, 2000, pp. 427-441.","journal-title":"Proceedings of Computer Science Logic 2000"},{"key":"5379255_CR16","unstructured":"Neergaard, P., and H. Mairson, \u2018LAL is square: Representation and expressiveness in light affine logic\u2019, presented at the Fourth International Workshop on Implicit Computational Complexity, 2002."},{"issue":"3","key":"5379255_CR17","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1023\/A:1005293713265","volume":"64","author":"U. Peterson","year":"2000","unstructured":"Peterson, U., \u2018Logic without contraction as based on inclusion and unrestricted abstraction\u2019, Studia Logica 64(3): 365-403, 2000.","journal-title":"Studia Logica"},{"key":"5379255_CR18","unstructured":"Schwichtenberg, H., and A. S. Troelstra, Basic Proof Theory, Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1996."},{"key":"5379255_CR19","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF00372772","volume":"56","author":"M. Shirahata","year":"1996","unstructured":"Shirahata, M., \u2018A linear conservative extension of Zermelo-Fraenkel set theory\u2019, Studia Logica 56: 361-392, 1996.","journal-title":"Studia Logica"},{"key":"5379255_CR20","unstructured":"Shirahata, M., \u2018Fixpoint theorem in linear set theory\u2019, unpublished manuscript, available at http:\/\/www.fbc.keio.ac.jp\/~sirahata\/Research, 1999."},{"key":"5379255_CR21","doi-asserted-by":"crossref","unstructured":"Terui, K., \u2018Light affine lambda calculus and polytime strong normalization\u2019, Proceedings of the Sixteenth Annual IEEE Symposium on Logic in Computer Science, 2001, pp. 209-220. The full version is available at http:\/\/research.nii.ac.jp\/~terui.","DOI":"10.1109\/LICS.2001.932498"},{"key":"5379255_CR22","unstructured":"Terui, K., Light Logic and Polynomial Time Computation, PhD thesis, Keio University, 2002. Available at http:\/\/research.nii.ac.jp\/~terui."},{"issue":"1","key":"5379255_CR23","first-page":"149","volume":"32","author":"R. White","year":"1987","unstructured":"White, R., \u2018A demonstrably consistent type-free extension of the logic BCK\u2019, Mathematica Japonica 32(1): 149-169, 1987.","journal-title":"Mathematica Japonica"},{"key":"5379255_CR24","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF01053067","volume":"52","author":"R. White","year":"1993","unstructured":"White, R., \u2018A consistent theory of attributes in a logic without contraction\u2019, Studia Logica 52: 113-142, 1993.","journal-title":"Studia Logica"}],"container-title":["Studia Logica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/B:STUD.0000034183.33333.6f.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/B:STUD.0000034183.33333.6f\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/B:STUD.0000034183.33333.6f.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T05:32:01Z","timestamp":1754631121000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/B:STUD.0000034183.33333.6f"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,6]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,6]]}},"alternative-id":["5379255"],"URL":"https:\/\/doi.org\/10.1023\/b:stud.0000034183.33333.6f","relation":{},"ISSN":["0039-3215","1572-8730"],"issn-type":[{"value":"0039-3215","type":"print"},{"value":"1572-8730","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,6]]}}}