{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T01:24:52Z","timestamp":1777080292982,"version":"3.51.4"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"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":[[2003,8]]},"DOI":"10.1023\/a:1025159016268","type":"journal-article","created":{"date-parts":[[2003,9,16]],"date-time":"2003-09-16T18:25:03Z","timestamp":1063736703000},"page":"345-368","source":"Crossref","is-referenced-by-count":28,"title":["The Undecidability of Grisin's Set Theory"],"prefix":"10.1007","volume":"74","author":[{"given":"Andrea","family":"Cantini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5144713_CR1","volume-title":"The Lambda Calculus. Its Syntax and Semantics","author":"H. Barendregt","year":"1984","unstructured":"Barendregt, H.\nThe Lambda Calculus. Its Syntax and Semantics, North Holland, Amsterdam, 1984."},{"key":"5144713_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-68952-9","volume-title":"Foundations of constructive mathematics","author":"M. J. Beeson","year":"1985","unstructured":"Beeson, M. J., Foundations of constructive mathematics, Springer, Berlin, 1985."},{"key":"5144713_CR3","volume-title":"The logic of provability","author":"G. Boolos","year":"1993","unstructured":"Boolos, G.\nThe logic of provability, Cambridge University Press, Cambridge, U. K., 1993."},{"key":"5144713_CR4","volume-title":"Logical Frameworks for Truth and Abstraction","author":"A. Cantini","year":"1996","unstructured":"Cantini, A., Logical Frameworks for Truth and Abstraction, North Holland, Amsterdam, 1996."},{"key":"5144713_CR5","unstructured":"Cantini, A., On extensionality, uniformity and comprehension in the theory of operations and classes, in: W. Sieg, R. Sommer and C. Talcott (eds.), Reflections on the Foundations of Mathematics. Essays in honor of Solomon Feferman, Lecture Notes in Logic, n. 15, Association of Symbolic Logic and A.K.Peters, Ltd., to appear, 2002."},{"key":"5144713_CR6","series-title":"Synthese Library","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/978-94-017-0487-8_14","volume-title":"Logic and Scientific Method I","author":"E. Casari","year":"1997","unstructured":"Casari, E., Conjoining and disjoining on different levels, in: M. L. Dalla Chiara, K. Doets, D. Mundici and J van Benthem, Logic and Scientific Method I, Tenth International Congress of Logic, Methodology and Philosophy of Science, Florence, August 1995, Synthese Library, vol. 259, Kluwer, Dordrecht 1997, 261-288."},{"key":"5144713_CR7","doi-asserted-by":"crossref","first-page":"92","DOI":"10.2307\/2269029","volume":"1","author":"F.B. Fitch","year":"1936","unstructured":"Fitch, F.B., A system of formal logic without an analogue to Curry W-operator, Journal of Symbolic Logic 1 (1936), 92-100.","journal-title":"Journal of Symbolic Logic"},{"key":"5144713_CR8","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1090\/pspum\/013.2\/0360271","volume-title":"Axiomatic Set Theory, Proceedings of Symposia in Pure Mathematics","author":"P. C. Gilmore","year":"1974","unstructured":"Gilmore, P. C., The consistency of partial set theory without extensionality, Axiomatic Set Theory, Proceedings of Symposia in Pure Mathematics, vol. 13, part 2, American Mathematical Society, Providence RI 1974, 147-153"},{"key":"5144713_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"Y.N. Girard","year":"1987","unstructured":"Girard, Y.N., Linear Logic, Theoretical Computer Science, 50 (1987), 1-102.","journal-title":"Theoretical Computer Science"},{"key":"5144713_CR10","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1006\/inco.1998.2700","volume":"143","author":"J. Y. Girard","year":"1998","unstructured":"Girard, J. Y., Light linear logic, Information and Computation, 143 (1998), 175-204.","journal-title":"Information and Computation"},{"issue":"1","key":"5144713_CR11","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1070\/IM1982v018n01ABEH001382","volume":"18","author":"V. N. Gri\u0160in","year":"1982","unstructured":"Gri\u0160in, V. N., Predicate and set-theoretic calculi based on logic without contractions, Math. USSR Izvestija (English translation), vol. 18 (1982), No.1, 41-59.","journal-title":"Math. USSR Izvestija"},{"key":"5144713_CR12","first-page":"585","volume":"34","author":"Y. Komori","year":"1989","unstructured":"Komori, Y., Illative combinatory logic based on BCK-logic, Mathematica Japonica, 34 (1989), 585-596.","journal-title":"Mathematica Japonica"},{"key":"5144713_CR13","unstructured":"Kopylov, A.P., The undecidability of second order linear affine logic, Institute for Logic, Language and Information Research Report and Technical Notes Series, University of Amsterdam, Computationand Complexity Theory Series, ML-95-10 (1995), 1-10."},{"key":"5144713_CR14","doi-asserted-by":"crossref","first-page":"1202","DOI":"10.2307\/2275637","volume":"62","author":"Y. Lafont","year":"1997","unstructured":"Lafont, Y., The finite model property for various fragments of linear logic, Journal of Symbolic Logic 62 (1997), 1202-1208.","journal-title":"Journal of Symbolic Logic"},{"key":"5144713_CR15","unstructured":"Lincoln, P.D., and N. Shankar, Proof Search in first order linear logic and other cut free sequent calculi, in: Proceedings of the 9-th Annual IEEE Symposium on Logic in Computer Science, Paris, 1994, 281-291."},{"key":"5144713_CR16","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/978-1-4613-0609-2_8","volume-title":"Mathematical Logic","author":"H. Ono","year":"1990","unstructured":"Ono, H., Structural rules and a logical hierarchy,, in: P.P. Petko (ed.), Mathematical Logic, Plenum Press, New York, 1990, 95-104."},{"key":"5144713_CR17","first-page":"263","volume-title":"The Tblisi Symposium on Language, Logic and Computation","author":"H. Ono","year":"1998","unstructured":"Ono, H., Decidability and finite model property of substructural logics, in: The Tblisi Symposium on Language, Logic and Computation, CSLI Publications, Stanford, 1998, 263-274."},{"key":"5144713_CR18","doi-asserted-by":"crossref","unstructured":"Ono, H., Proof-theoretic methods in nonclassical logic: an introduction, in: Theories of types and proofs, Memoirs of the Mathematical Society of Japan, vol.2, 1998, 207-254.","DOI":"10.2969\/msjmemoirs\/00201C060"},{"key":"5144713_CR19","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1023\/A:1005293713265","volume":"64","author":"U. Pedersen","year":"2000","unstructured":"Pedersen, U., Logic without contraction as based on inclusion and unrestricted abstraction, Studia Logica, 64 (2000), 365-403.","journal-title":"Studia Logica"},{"key":"5144713_CR20","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF00372772","volume":"56","author":"M. Shirahata","year":"1996","unstructured":"Shirahata, M., A linear conservative extension of Zermelo-Fraenkel Set Theory, Studia Logica, 56 (1996), 361-392.","journal-title":"Studia Logica"},{"key":"5144713_CR21","first-page":"149","volume":"32","author":"R. B. White","year":"1987","unstructured":"White, R. B., A demonstrably consistent type-free extension of the logic BCK, Mathematica Japonica, 32 (1987), 149-169.","journal-title":"Mathematica Japonica"},{"key":"5144713_CR22","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF01053067","volume":"52","author":"R. B. White","year":"1993","unstructured":"White, R. B., A consistent theory of attributes in a logic without contraction, Studia Logica, 52 (1993), 113-142.","journal-title":"Studia Logica"},{"key":"5144713_CR23","volume-title":"Basic Proof Theory","author":"A. Troelstra","year":"1996","unstructured":"Troelstra, A. and H. Schwichtenberg, Basic Proof Theory, Cambridge University Press, Cambridge, 1996"}],"container-title":["Studia Logica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1025159016268.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1025159016268\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1025159016268.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T05:13:26Z","timestamp":1754630006000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1025159016268"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["5144713"],"URL":"https:\/\/doi.org\/10.1023\/a:1025159016268","relation":{},"ISSN":["0039-3215","1572-8730"],"issn-type":[{"value":"0039-3215","type":"print"},{"value":"1572-8730","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}