Skip to main content

Finite bases of admissible rules for the logic S52 C

  • Conference paper
  • First Online:
Logical Foundations of Computer Science (LFCS 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1234))

Included in the following conference series:

  • 113 Accesses

Abstract

We study bimodal logic system S52 C having two modal operators □0 and □1, each of which satisfies the axioms of S5 and in addition, an axiom for commutability of modal operators: □01 p]≡□10 p. The main result of this paper establishes that the bimodal logic S52 C and all its extensions have finite bases for admissible inference rules. We also show that even though the logic S52 C is not locally finite, any proper extension of S52 C is already locally finite. Moreover, the universal theory of the free algebra of any S52 C-logic is decidable. It is shown also that any S52 C-logic λ with the adjoined inference rule

is structurally complete and that logic has the same set of theorems as the logic λ.

The research was supported by Grant Center of Novosibirsk State University and RFFI grant 96-01-00228

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. V.V.Rybakov, Admissible rules for logics, which are extension of S4.3, Siberian math. j., 25, N 5, (1984), 141–145.

    Google Scholar 

  2. Fine K. Logics Containing S4.3. Z. für Math. Logic and Grundl. Math., V.17, 1971, 371–376.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Sergei Adian Anil Nerode

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Golovanov, M. (1997). Finite bases of admissible rules for the logic S52 C . In: Adian, S., Nerode, A. (eds) Logical Foundations of Computer Science. LFCS 1997. Lecture Notes in Computer Science, vol 1234. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63045-7_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-63045-7_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63045-6

  • Online ISBN: 978-3-540-69065-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics