Skip to main content
SpringerLink
Log in

Modal translations in substructural logics

  • Published:
Journal of Philosophical Logic Aims and scope Submit manuscript

Abstract

Substructural logics are logics obtained from a sequent formulation of intuitionistic or classical logic by rejecting some structural rules. The substructural logics considered here are linear logic, relevant logic and BCK logic. It is proved that first-order variants of these logics with an intuitionistic negation can be embedded by modal translations into S40type extensions of these logics with a classical, involutive, negation. Related embeddings via translations like the double-negation translation are also considered. Embeddings into analogues of S4 are obtained with the help of cut climination for sequent formulations of our substructural logics and their modal extensions. These results are proved for systems with equality too.

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

Access this article

Log in via an institution

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

References

  • Anderson, A. R. and Belnap, N. D.Jr: 1975,Entailment: The Logic of Relevance and Necessity, vol. I, Princcton University Press, Princeton.

    Google Scholar 

  • Avron, A.: 1988, The semantics and proof theory of linear logic,Theoretical Computer Science 57, pp. 161–184.

    Google Scholar 

  • Belnap, N. D.Jr, Gupta, A. and Dunn, J. M.: 1980, A consecutive calculus for positive relevant implication with necessity,Journal of Philosophical Logic 9, pp. 343–362.

    Google Scholar 

  • Božić, M.: 1983, ‘A Contribution to the Semantics of Relevant Logics (in Serbo-Croatian)’, doctoral dissertation, University of Belgradc.

  • Brady, R. T.: 1990, The gentzentization and decidability of RW,Journal of Philosophical Logic 19, pp. 35–73.

    Google Scholar 

  • Bull, R. A.: 1987, Survey of generalizations of Urquhart semantics,Notre Dame Journal of Formal Logic 28, pp. 220–237.

    Google Scholar 

  • Curry, H. B.: 1950,A Theory of Formal Deducibility, University of Notre Dame Press, Notre Dame.

    Google Scholar 

  • Curry, H. B.: 1952, The elimination theorem when modality is present,The Journal of Symbolic Logic 17, pp. 249–265.

    Google Scholar 

  • Došen, K.: 1981, A reduction of classical propositional logic to the conjunction-negation fragment of an intuitionistic relevant logic,Journal of Philosophical Logic 10, pp. 399–408.

    Google Scholar 

  • Došen, K.: 1985, Sequent systems for modal logic,The Journal of Symbolic Logic 50, pp. 149–168.

    Google Scholar 

  • Došen, K.: 1988, Sequent systems and groupoid models, I and II,Studia Logica 47, pp. 353–385,48(1989), pp. 41–65,49 (1990), p. 614.

    Google Scholar 

  • Došen, K.: 1990, Modal logic as metalogic,SNS-Bericht 90-57, University of Tübingen (to appear in the proceedings of the conference “Kleene '90”, Chaika, 1990).

  • Došen, K.: 1992, The first, axiomatization of relcvant logic,Journal of Philosophical Logic 21, pp. 337–354 (forthcoming in next issue).

    Google Scholar 

  • Dunn, J. M.: 1986, Relevance logic and entailment, in: D. Gabbay and F. Guenthner eds,Handbook of Philosophical Logic, Vol. III: Alternatives to Classical Logic, Reidel, Dordrecht, pp. 117–224.

    Google Scholar 

  • Fitch, F. B.: 1936, A system of formal logic without an analogue to the CurryW combinator,The Journal of Symbolic Logic 1, pp. 92–100.

    Google Scholar 

  • Flagg, R. C. and Friedman, H.: 1986, Epistemic and intuitionistic formal systems,Annals of Pure and Applied Logic 32, pp. 53–60.

    Google Scholar 

  • Fuhrmann, A.: 1990, Models for relevant modal logics,Studia Logica 44, pp. 501–514.

    Google Scholar 

  • Gentzen, G.: 1935, Untersuchungen über das logische Schließen,Mathematische Zeitschrift 39, 176–210, 405–431 (English translation in Gentzen 1969).

    Google Scholar 

  • Gentzen, G.: 1938, Neuc Fassung des Widerspuchsfreiheitsbeweises für dic reinc Zahlentheorie,Forschungen zur Logik und zur Grundlegung der exakten Wissenschaften N.S. 4 pp. 19–44 (English translation in Gentzen 1969).

  • Gentzen, G.: 1969,The Collected Papers of Gerhard Gentzen, M. E. Szabo, ed., North-Holland, Amsterdam.

    Google Scholar 

  • Giambrone, S.: 1985,TW. andRW are decidable,Journal of Philosophical Logic 14, pp. 235–254.

    Google Scholar 

  • Giambrone, S. and Kron, A.: 1987, Four relevant Gentzen systems,Studia Logica 46, pp. 55–71.

    Google Scholar 

  • Girard, J.-Y.: 1987, Linear logic,Theoretical Computer Science 50, pp. 1–102.

    Google Scholar 

  • Grishin, V. N.: 1974, A nonstandard logic and its application to set theory (in Russian), in:Studies in Formalized Languages and Nonclassical Logics (in Russian), Nauka, Moscow, pp. 135–171 (Mathematical Reviews 56 # 8331, 1978).

    Google Scholar 

  • Grishin, V. N.: 1981, Predicate and set-theoretic calculuses based on logic without contractions (in Russian),Izvestiya Akademii Nauk SSSR Seriya Matematicheskaya 45, pp. 47–68 (English translation inMath. USSR-Izv. 18 (1982), pp. 41–59).

    Google Scholar 

  • Hacking, I.: 1963, What is strict implication?,The Journal of Symbolic Logic 28, pp. 51–71.

    Google Scholar 

  • Kanger, S.: 1963, A simplified proof method for elementary logic, in: P. Brafford and D. Hirschberg, eds,Computer Programming and Formal Systems, North-Holland, Amsterdam, pp. 87–94.

    Google Scholar 

  • Kleene, S. C.: 1952,Introduction to Metamathematics, North-Holland, Amsterdam (Van Nostrand, New York).

    Google Scholar 

  • Komori, Y.: 1968, Logics without the structure rules,Studia Logica 45, pp. 393–404.

    Google Scholar 

  • Kripke, S.: 1959, The problem of entailment (abstract),The Journal of Symbolic Logic 24, p. 324.

    Google Scholar 

  • Lambek, J.: 1958, The mathematics of sentence structure,The American Mathematical Monthly 65, pp. 154–170.

    Google Scholar 

  • Lambek, J.: 1961, On the calculus of syntactic types, in: R. Jacobson, ed.,Structure of Language and its Mathematical Aspects, American Mathematical Society, Providence, pp. 166–178, 264–265.

    Google Scholar 

  • Lambek, J. and Scott, P. J.: 1986,Introduction to Higher-Order Categorical Logic, Cambridge University Press, Cambridge.

    Google Scholar 

  • Lambek, J.: 1988, Categorial and categorical grammars, in: R. T. Oehrle et al., eds.,Categorial Grammars and Natural Language Structures, Reidel, Dordrecht, pp. 297–317.

    Google Scholar 

  • Lifschitz, V. A.: 1968, A specialization of the form of deduction in the predicate calculus with equality and functional symbols I (in Russian),Trudy Matematicheskogo Instituta 98, pp. 5–25 (English translation inProc. Steklov Inst. Math. 98 (1968), pp. 1–23).

    Google Scholar 

  • McRobbie, M. A. and Belnap, N. D.Jr: 1984, Proof tableau formulations of some first-order relevant ortho-logics (abstract),Bulletin of the Section of Logic 13, pp. 233–240.

    Google Scholar 

  • Maehara, S.: 1954, Eine Darstellung der intuitionistischen Logik in der klassischen,Nagoya Mathematical Journal 7, pp. 45–64.

    Google Scholar 

  • Meyer, R. K.: 1966, ‘Topics in Modal and Many-Valucd Logic’, doctoral dissertation, University of Pittsburgh (I know this work only from references).

  • Meyer, R. K. and McRobbie, M. A.: 1982, Multisets and relevant implication, I and II,Australasian Journal of Philosophy 60, pp. 107–139, 265–281.

    Google Scholar 

  • Ono, H. and Komori, Y.: 1985, Logics without the contraction rule,The Journal of Symbolic Logic 50, 169–201.

    Google Scholar 

  • Ono, H.: 1990, Structural rules and a logical hierarchy, in P. P. Petkov, ed.,Mathematical Logic, Plenum, New York, pp. 95–104.

    Google Scholar 

  • Orlov, I. E.: 1928, The calculus of compatibility of propositions (in Russian),Mathematicheskiĩ Sbornik 35, pp. 263–286.

    Google Scholar 

  • Palasiński, M. and Wroński, A.: 1986, Eight simple questions concerning BCK-algebras,Reports on Mathematical Logic 20, pp. 87–91.

    Google Scholar 

  • Prawitz, D. and Malmnäs, P.-E.: 1968, A survey of some connections between classical, intuitionistic and minimal logic, in H. A. Schmidt, K. Schütte, and H.-J. Thiele, eds,Contributions to Mathematical Logic, North-Holland, Amsterdam, pp. 215–229.

    Google Scholar 

  • Routley, R. and Meyer, R. K.: 1972, The semantics of entailment—II,Journal of Philosophical Logic 1, pp. 53–73.

    Google Scholar 

  • Schellinx, H.: 1991, Some syntactical observations on linear logic,Journal of Logic and Computation 1, pp. 537–559.

    Google Scholar 

  • Schütte, K.: 1968,Vollständige Systeme modaler und intuitionistischer Logik, Springer, Berlin.

    Google Scholar 

  • Slaney, J. K.: 1984, A metacompleteness theorem for contraction-free relevant logics,Studia Logica 43, pp. 159–168.

    Google Scholar 

  • Smirnov, V. A.: 1972,Formal Deduction and Logical Calculuses (in Russian), Nauka, Moscow.

    Google Scholar 

  • Szabo, M. E.: 1978,Algebra of Proofs, North-Holland, Amsterdam.

    Google Scholar 

  • Takeuti, G.: 1975,Proof Theory, North-Holland, Amsterdam (second revised edition 1987).

    Google Scholar 

  • Thistlewaite, P. B., McRobbie, M. A. and Meyer, R. K.: 1988,Automated Theorem-Proving in Non-Classical Logics, Pitman, London.

    Google Scholar 

  • Troelstra, A. S.: 1990, Lectures on linear logic,ITLI Prepublication Series X-90-15, University of Amsterdam.

  • Urquhart, A.: 1984, The undecidability of entailment and relevant implication,The Journal of Symbolic Logic 49, pp. 1059–1073.

    Google Scholar 

  • Urquhart, A.: 1993, Failure of interpolation in relevant logics (to appear inJournal of Philosophical Logic).

  • Zaslavskiĩ, I. D.: 1978,Symmetric Constructive Logic (in Russian), Armenian Academy of Sciences, Erevan.

    Google Scholar 

  • Zeman, J. J.: 1973,Modal Logic: The Lewis-Modal Systems, Clarendon Press, Oxford.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Matematički Institut, Knez-Mihailova 35, p.f. 367, 11001, Beograd, Yugoslavia

    Kosta Došen

Authors
  1. Kosta Došen
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Došen, K. Modal translations in substructural logics. J Philos Logic 21, 283–336 (1992). https://doi.org/10.1007/BF00260931

Download citation

  • Issue Date:

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

Keywords

Search

Navigation