Abstract
We investigate a contractionless naive set theory, due to Grisin [11]. We prove that the theory is undecidable.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Barendregt, H. The Lambda Calculus. Its Syntax and Semantics, North Holland, Amsterdam, 1984.
Beeson, M. J., Foundations of constructive mathematics, Springer, Berlin, 1985.
Boolos, G. The logic of provability, Cambridge University Press, Cambridge, U. K., 1993.
Cantini, A., Logical Frameworks for Truth and Abstraction, North Holland, Amsterdam, 1996.
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.
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.
Fitch, F.B., A system of formal logic without an analogue to Curry W-operator, Journal of Symbolic Logic 1 (1936), 92-100.
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
Girard, Y.N., Linear Logic, Theoretical Computer Science, 50 (1987), 1-102.
Girard, J. Y., Light linear logic, Information and Computation, 143 (1998), 175-204.
GriŠin, V. N., Predicate and set-theoretic calculi based on logic without contractions, Math. USSR Izvestija (English translation), vol. 18 (1982), No.1, 41-59.
Komori, Y., Illative combinatory logic based on BCK-logic, Mathematica Japonica, 34 (1989), 585-596.
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.
Lafont, Y., The finite model property for various fragments of linear logic, Journal of Symbolic Logic 62 (1997), 1202-1208.
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.
Ono, H., Structural rules and a logical hierarchy,, in: P.P. Petko (ed.), Mathematical Logic, Plenum Press, New York, 1990, 95-104.
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.
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.
Pedersen, U., Logic without contraction as based on inclusion and unrestricted abstraction, Studia Logica, 64 (2000), 365-403.
Shirahata, M., A linear conservative extension of Zermelo-Fraenkel Set Theory, Studia Logica, 56 (1996), 361-392.
White, R. B., A demonstrably consistent type-free extension of the logic BCK, Mathematica Japonica, 32 (1987), 149-169.
White, R. B., A consistent theory of attributes in a logic without contraction, Studia Logica, 52 (1993), 113-142.
Troelstra, A. and H. Schwichtenberg, Basic Proof Theory, Cambridge University Press, Cambridge, 1996
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Cantini, A. The Undecidability of Grisin's Set Theory. Studia Logica 74, 345–368 (2003). https://doi.org/10.1023/A:1025159016268
Issue Date:
DOI: https://doi.org/10.1023/A:1025159016268