Notre Dame Journal of Formal Logic

Sequent Calculi for Visser's Propositional Logics

Katsumasa Ishii, Ryo Kashima, and Kentaro Kikuchi

Full-text: Access has been disabled (more information)

Abstract

This paper introduces sequent systems for Visser's two propositional logics: Basic Propositional Logic (BPL) and Formal Propositional Logic (FPL). It is shown through semantical completeness that the cut rule is admissible in each system. The relationships with Hilbert-style axiomatizations and with other sequent formulations are discussed. The cut-elimination theorems are also demonstrated by syntactical methods.

Article information

Source
Notre Dame J. Formal Logic Volume 42, Number 1 (2001), 1-22.

Dates
First available in Project Euclid: 30 May 2003

Permanent link to this document
http://projecteuclid.org/euclid.ndjfl/1054301352

Digital Object Identifier
doi:10.1305/ndjfl/1054301352

Mathematical Reviews number (MathSciNet)
MR1993387

Zentralblatt MATH identifier
1023.03054

Subjects
Primary: 03F05: Cut-elimination and normal-form theorems
Secondary: 03B60: Other nonclassical logic

Keywords
sequent calculus Kripke semantics cut-elimination

Citation

Ishii, Katsumasa; Kashima, Ryo; Kikuchi, Kentaro. Sequent Calculi for Visser's Propositional Logics. Notre Dame J. Formal Logic 42 (2001), no. 1, 1--22. doi:10.1305/ndjfl/1054301352. http://projecteuclid.org/euclid.ndjfl/1054301352.


Export citation

References

  • [1] Ardeshir, M., Aspects of Basic Logic, Ph.D. thesis, Marquette University, Milwaukee, 1995.
  • [2] Ardeshir, M., and W. Ruitenburg, "Basic propositional calculus I", Mathematical Logic Quarterly, vol. 44 (1998), pp. 317--43.
    Mathematical Reviews (MathSciNet): MR2000a:03016
    Zentralblatt MATH: 0912.03005
  • [3] Ruitenburg, W., "Constructive logic and the paradoxes", Modern Logic, vol. 1 (1991), pp. 271--301.
    Mathematical Reviews (MathSciNet): MR92g:03011
    Zentralblatt MATH: 0748.03037
  • [4] Ruitenburg, W., "Basic predicate calculus", Notre Dame Journal of Formal Logic, vol. 39 (1998), pp. 18--46.
    Mathematical Reviews (MathSciNet): MR2000d:03009
    Zentralblatt MATH: 0967.03005
    Digital Object Identifier: doi:10.1305/ndjfl/1039293019
    Project Euclid: euclid.ndjfl/1039293019
  • [5] Sasaki, K., "A Gentzen-style formulation for Visser's propositional logic", Nanzan Management Review, no. 12 (1998), pp. 343--51.
  • [6] Sasaki, K., "Formalizations for the consequence relation of Visser's propositional logic", Reports on Mathematical Logic, no. 33 (1999), pp. 65--78.
    Mathematical Reviews (MathSciNet): MR2001f:03029
    Zentralblatt MATH: 0947.03026
  • [7] Schroeder-Heister, P., and K. Došen, editors, Substructural Logics, vol. 2 of Studies in Logic and Computation, The Clarendon Press, New York, 1993.
    Mathematical Reviews (MathSciNet): MR95a:03003
    Zentralblatt MATH: 0811.68056
  • [8] Suzuki, Y., F. Wolter, and M. Zakharyaschev, "Speaking about transitive frames in propositional languages", Journal of Logic, Language and Information, vol. 7 (1998), pp. 317--39.
    Mathematical Reviews (MathSciNet): MR99i:03019
    Zentralblatt MATH: 0927.03036
    Digital Object Identifier: doi:10.1023/A:1008237600846
  • [9] Takeuti, G., Proof Theory, 2d edition, Studies in Logic and the Foundations of Mathematics, North-Holland Publishing Co., Amsterdam, 1987.
    Mathematical Reviews (MathSciNet): MR89a:03115
    Zentralblatt MATH: 0609.03019
  • [10] Valentini, S., "The modal logic of provability: Cut-elimination", Journal of Philosophical Logic, vol. 12 (1983), pp. 471--76.
    Mathematical Reviews (MathSciNet): MR86a:03019
    Zentralblatt MATH: 0535.03031
    Digital Object Identifier: doi:10.1007/BF00249262
  • [11] Visser, A., "A propositional logic with explicit fixed points", Studia Logica, vol. 40 (1981), pp. 155--75.
    Mathematical Reviews (MathSciNet): MR83h:03039
    Zentralblatt MATH: 0469.03012

Duke University Press

Notre Dame Journal of Formal Logic

New content alerts

Email RSS ToC RSS Article
  • You have access to this content.
  • You have partial access to this content.
  • You do not have access to this content.
Turn Off MathJax

What is MathJax?

More like this

+ See more