Skip to main content
×
Home
    • Aa
    • Aa

Logics without the contraction rule

  • Hiroakira Ono (a1) and Yuichi Komori (a2)
Abstract

We will study syntactical and semantical properties of propositional logics weaker than the intuitionistic, in which the contraction rule (or, the exchange rule or the weakening rule, in some cases) does not hold. Here, the contraction rule means the rule of inference of the form

if we formulate our logics in a Gentzen-type formal system. Some syntactical properties of these logics have been studied firstly by the second author in [11], in connection with the study of BCK-algebras (for information on BCK-algebras, see [9]). There, it turned out that such a syntactical method is a powerful and promising tool in studying BCK-algebras. Using this method, considerable progress has been made since then (see, e.g., [8], [18], [27]).

In this paper, we will study these logics more comprehensively. We notice here that the distributive law

does not hold necessarily in these logics. By adding some axioms (or initial sequents) and rules of inference to these basic logics, we can obtain a lot of interesting nonclassical logics such as Łukasiewicz's many-valued logics, relevant logics, the intuitionistic logic and logics related to BCK-algebras, which have been studied separately until now. Thus, our approach will give a uniform way of dealing with these logics. One of our two main tools in doing so is Gentzen-type formulation of logics in syntax, and the other is semantics defined by using partially ordered monoids.

Copyright
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

[1] C.C. Chang , A new proof of the completeness of the Łukasiewicz axioms, Transactions of the American Mathematical Society, vol. 93 (1959), pp. 7480.

[2] K. Fine , Models for entailment, Journal of Philosophical Logic, vol. 3 (1974), pp. 347372.

[3] G. Grätzer , General lattice theory, Academic Press, New York, 1978.

[10] Y. Komori , Super-Lukasiewicz propositional logics, Nagoya Mathematical Journal, vol. 84 (1981), pp. 119133.

[14] S. Kripke , Semantical analysis of intuitionistic logic. I, Formal systems and recursive functions, North-Holland, Amsterdam, 1965, pp. 92130.

[16] L. L. Maksimova , Craig's theorem in superintuitionistic logics and amalgamable varieties of pseudo-Boolean algebras, Algebra i Logika, vol. 16(1977), pp. 643681; English translation, Algebra and Logic, vol. 16 (1977), pp. 427–455.

[19] A. Rose and J. B. Rosser , Fragments of many-valued statement calculi, Transactions of the American Mathematical Society, vol. 87 (1958), pp. 153.

[20] R. Routley and R. K. Meyer , The semantics of entailment, Truth, syntax and modality, North-Holland, Amsterdam, 1973, pp. 199243.

[21] D. Scott , Completeness and axiomatizability in many-valued logic, Proceedings of the Tarski Symposium, Proceedings of Symposia in Pure Mathematics, vol. 25, American Mathematical Society, Providence, Rhode Island, 1974, pp. 411435.

[24] A. Urquhart , An interpretation of many-valued logic, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, vol. 19 (1973), pp. 111114.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 1 *
Loading metrics...

Abstract views

Total abstract views: 77 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 24th April 2017. This data will be updated every 24 hours.