Skip to main content

SCI–Sequent Calculi, Cut Elimination and Interpolation Property

  • Chapter
  • First Online:
Janusz Czelakowski on Logical Consequence

Part of the book series: Outstanding Contributions to Logic ((OCTR,volume 27))

  • 37 Accesses

Abstract

We discuss the methods for providing sequent calculi for Suszko’s basic non-Fregean Logic with sentential identity SCI. After examination of possible strategies and already proposed systems we focus on the new calculus and its modification. It does not satisfy full cut elimination but a slightly generalised form of the subformula property holds for it. It is also standard in the sense of satisfying several conditions on rules formulated by Gentzen and his followers. We examine also the problem of providing a constructive proof of the interpolation theorem in the setting of this sequent calculus.

Second reader: Heinrich Wansing

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 99.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 129.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    One may easily notice that axioms 2 and 4 are analogues of usual congruency principles for identity with respect to unary and binary predicates. Only axiom 3 has no direct counterpart in identity laws for terms.

References

  • Chlebowski, S. (2018). Sequent calculi for SCI. Studia Logica, 106(3), 541–564.

    Article  Google Scholar 

  • Chlebowski, S., & Leszczyńska-Jasion, D. (2018). Sequent calculi for SCI. Bulletin of the Section of Logic, 106(3), 541–564.

    Google Scholar 

  • Ciabattoni, A. (2004). Automated generation of analytic calculi for logics with linearity. In J. Marcinkowski & A. Tarlecki (Eds.), CSL 2004, LNCS (Vol. 3210, pp. 503–517). Heidelberg: Springer.

    Google Scholar 

  • Czelakowski, J. (1981). Equivalential logics (I). Studia Logica, 40(3), 227–236.

    Article  Google Scholar 

  • Czelakowski, J. (1981). Equivalential logics (II). Studia Logica, 40(4), 355–372.

    Article  Google Scholar 

  • Czelakowski, J. (1982). Logical matrices and the amalgamation property. Studia Logica, 41(4), 329–342.

    Article  Google Scholar 

  • Czelakowski, J. (1985). Sentential logics and Maehara interpolation property. Studia Logica, 44(3), 265–284.

    Article  Google Scholar 

  • Golińska-Pilarek, J. (2021). Dedukcyjne dylematy: przypadek niefregowski. In D. Leszczyńska-Jasion, P.Łupkowski, A. Gajda, & S. Chlebowski (Eds.), Wędrówki po świecie symboli. Język, matematyka, logika. Tom dedykowany Jerzemu Pogonowskiemu w siedemdziesiątą rocznicę urodzin (pp. 43–76). Wydawnictwo Ryś.

    Google Scholar 

  • Golińska-Pilarek, J., Huuskonen, T., & Zawidzki, M. (2021). Technical Report: Deciding Non-Fregean Identities. Tableaux vs. Dual Tableaux.

    Google Scholar 

  • Golińska-Pilarek, J., Huuskonen, T., Zawidzki, M. (2021). Tableau-based decision procedure for non-Fregean logic of sentential identity. In A. Platzer, G. Sutcliffe (Eds.), Automated Deduction-CADE 28, Proceedings, Lecture Notes in Artificial Inteligence 12699 (pp. 41–57). Springer.

    Google Scholar 

  • Golińska-Pilarek, J., Welle, M. (2019). Deduction in non-Fregean propositional logic SCI. Axioms,8(4).

    Google Scholar 

  • Golińska-Pilarek, J. (2007). Rasiowa-Sikorski proof system for the non-Fregean sentential logic. Journal of Applied Non-Classical Logics, 17(4), 511–519.

    Article  Google Scholar 

  • Indrzejczak, A. (2021). Sequents and trees: an introduction to the theory and applications of propositional sequent calculi. Birkhäuser.

    Google Scholar 

  • Indrzejczak, A. (2023). Logicality of Equality. To appear in: Peter Schroeder-Heister on Proof-Theoretic Semantics. Outstanding Contributions to Logic. Springer.

    Google Scholar 

  • Leszczyńska-Jasion, D., Chlebowski, S., Gawek, M., Rabiza, M., & Tomczyk, A. (2022). Systemy dowodowe dla logik niefregowskich. In D. Leszczyńska-Jasion, S. Chlebowski, A. Tomczyk, & A. Zakosztowicz (Eds.), Język–struktura–ontologia. Tom dedykowany pamięci Romana Suszki (pp. 221–251). Wyd. UAM, Poznań.

    Google Scholar 

  • Leszczyńska-Jasion, D., Tomczyk, A. (2022). Investigations into the decidability of propositional non-Fregean theories. Technical Report.

    Google Scholar 

  • Łukowski, P. (1974). Cut elimination in SCI. Bulletin of the Section of Logic, 4(3), 119–124.

    Google Scholar 

  • Maehara, S. (1970). A general theory of completeness proofs. Annals of the Japan Association for Philosophy of Science, 3(5), 242–256.

    Article  Google Scholar 

  • Malinowski, G., & Michalczyk, M. (1982). That SCI has the interpolation property. Studia Logica, 41(4), 375–380.

    Article  Google Scholar 

  • Metcalfe, G., Olivetti, N., & Gabbay, D. (2008). Proof Theory for Fuzzy Logics. Heidelberg: Springer.

    Google Scholar 

  • Michaels, A. (1974). A uniform proof procedure for SCI tautologies. Studia Logica, 33(3), 299–310.

    Article  Google Scholar 

  • Negri, S., & von Plato, J. (2001). Structural Proof Theory. Cambridge: Cambridge University Press.

    Book  Google Scholar 

  • Omyła, M. (1986). Zarys logiki niefregowskiej. Warszawa: PWN.

    Google Scholar 

  • Ono, H. (1998). Proof-Theoretic Methods in Nonclassical Logic–an Introduction. In M. Takahashi (Ed.), Theories of Types and Proofs (pp. 207–254). MSJ-Memoir 2. Mathematical Society of Japan.

    Google Scholar 

  • Orłowska, E., & Golińska-Pilarek, J. (2010). Dual Tableaux: Foundations, Methodology. Berlin: Case Studies. Springer.

    Google Scholar 

  • Poggiolesi, F. (2011). Gentzen Calculi for Modal Propositional Logic. Berlin: Springer.

    Book  Google Scholar 

  • Rogava, M. (1974). Cut elimination in SCI. Bulletin of the Section of Logic, 4(3), 119–124.

    Google Scholar 

  • Suszko, R. (1975). Abolition of the Fregean axiom. In Logic Colloquium (pp. 169–239). Berlin: Springer.

    Google Scholar 

  • Takeuti, G. (1987). Proof Theory. Amsterdam: North-Holland.

    Google Scholar 

  • Troelstra, A. S., & Schwichtenberg, H. (1996). Basic Proof Theory. Oxford: Oxford University Press.

    Google Scholar 

  • Wansing, H. (1999). Displaying Modal Logics. Dordrecht: Kluwer Academic Publishers.

    Google Scholar 

  • Wasilewska, A. (1976). A sequence formalization for SCI. Studia Logica, 35(3), 213–219.

    Article  Google Scholar 

  • Wasilewska, A. (1984). DFC-algorithms for Suszko Logic SCI. Studia Logica, 43(4), 395–404.

    Article  Google Scholar 

  • Wójtowicz, A. (2001). Własności Hallden-zupełności i interpolacji w klasie zdaniowych logik nefregowskich. In M. Omyła (Ed.), Idee Logiczne Romana Suszki (pp. 183–198). Warszawa.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Andrzej Indrzejczak .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Indrzejczak, A. (2024). SCI–Sequent Calculi, Cut Elimination and Interpolation Property. In: Malinowski, J., Palczewski, R. (eds) Janusz Czelakowski on Logical Consequence. Outstanding Contributions to Logic, vol 27. Springer, Cham. https://doi.org/10.1007/978-3-031-44490-6_11

Download citation

Publish with us

Policies and ethics