Skip to main content
Springer Nature Link
Log in

A linear conservative extension of Zermelo-Fraenkel set theory

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

In this paper, we develop the system LZF of set theory with the unrestricted comprehension in full linear logic and show that LZF is a conservative extension of ZF− i.e., the Zermelo-Fraenkel set theory without the axiom of regularity. We formulate LZF as a sequent calculus with abstraction terms and prove the partial cut-elimination theorem for it. The cut-elimination result ensures the subterm property for those formulas which contain only terms corresponding to sets in ZF−. This implies that LZF is a conservative extension of ZF− and therefore the former is consistent relative to the latter.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles and news from researchers in related subjects, suggested using machine learning.

References

  1. Arnon Avron. “The semantics and proof theory of linear logic.” Theoretical Computer Science, 57, 1988, 161–184.

    Google Scholar 

  2. J.Y. Girard. “Linear logic.” Theoretical Computer Science, 50, 1987, 1–102.

    Google Scholar 

  3. J.Y. Girard, A. Scedrov, and P.J. Scott. “Bounded linear logic.” Theoretical Computer Science, 97, 1992, 1–66.

    Google Scholar 

  4. V.N. Grishin. “A nonstandard logic and its application to set theory,” (Russian). Studies in Formalized Languages and Nonclassical Logics (Russian), Izdat, “Nauka,” Moskow. 1974, 135–171.

    Google Scholar 

  5. V.N. Grishin. “Predicate and set theoretic calculi based on logic without contraction rules,” (Russian). Izvestiya Akademii Nauk SSSR Seriya Matematicheskaya, 45, no.1, 1981, 47–68. 239. Math. USSR Izv., 18, no.1, 1982, 41–59 (English translation).

    Google Scholar 

  6. Y. Komori. “Illative combinatory logic based on BCK -logic.” Mathematica Japonica, 34, 1989, 585–596.

    Google Scholar 

  7. P. Schroeder-Heister. “Cut-elimination in logics with definitional reflection.” Non-classical Logic and Information Processing, Springer, 1992, 146–171.

  8. R.B. White. “A demonstrably consistent type-free extension.” Mathematica Japonica, 32, 1987, 149–169.

    Google Scholar 

  9. R.B. White. “A consistent theory of attributes in a logic without contraction.” Studia Logica, 52, 1993, 113–142.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Science Japan Advanced Institute of Science and Technology, Japan

    Masaru Shirahata

Authors
  1. Masaru Shirahata
    View author publications

    You can also search for this author inPubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shirahata, M. A linear conservative extension of Zermelo-Fraenkel set theory. Stud Logica 56, 361–392 (1996). https://doi.org/10.1007/BF00372772

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00372772

Key words