Skip to main content

The Structure of Rigid Frames of Depth 3 Only

  • Conference paper
Logic, Language, and Computation (TbiLLC 2007)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5422))

Included in the following conference series:

Abstract

In this paper we classify all rigid rooted IPC-frames of depth 3. Among other things we show that these have at most 3 maximal elements. The interest in rigid frames arose from the paper [5]. In this paper quasi-characterizing inference rules were discussed. These rules are built on the pattern of Jankov-formulas of finite rooted frames but a Jankov-formula of the form ϕp is transformed into a quasi-characterizing rule ϕ/p. Such a rule is called self-admissible if it is admissible in the logic generated by the frame corresponding to the rule itself. The important results of [5] are that self-admissible rules are admissible in IPC itself, and that such a quasi-characterizing inference rule is self-admissible iff the frame it derives from is not rigid. The classification of rigid frames thus becomes of interest.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bezhanishvili, N.: Lattices of Intermediate and Cylindric Modal Logics, PhD thesis, ILLC, Universiteit van Amsterdam (2006)

    Google Scholar 

  2. Chagrov, A., Zakharyaschev, M.: Modal Logic, p. 605. Clarendon Press, Oxford (1997)

    MATH  Google Scholar 

  3. de Jongh, D.: Investigations on the Intuitionistic Propositional Calculus, PhD thesis, University of Wisconsin (1968)

    Google Scholar 

  4. de Jongh, D., Troelstra, A.: On the connection of partially ordered sets with some pseudo-Boolean algebras. Indagationes Mathematicae 28, 317–329 (1966)

    Article  MathSciNet  MATH  Google Scholar 

  5. Rybakov, V.V., Terziler, M., Gencer, C.: Description of Self-Admissible Quasi-Characterizing Inference Rules. Studia Logica 65, 417–428 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  6. Rybakov, V.V., Oner, T.: The Structure of the Rigid Frames of Restricted Depth 2. Bulletin Section Logic 27(4), 172–181 (1998)

    MathSciNet  MATH  Google Scholar 

  7. Rybakov, V.V.: Admissibility of Logical Inference Rules, Studies in Logic and Foundations of Mathematics, vol. 136, p. 617. Elsevier, Amsterdam (1997)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Oner, T., de Jongh, D. (2009). The Structure of Rigid Frames of Depth 3 Only. In: Bosch, P., Gabelaia, D., Lang, J. (eds) Logic, Language, and Computation. TbiLLC 2007. Lecture Notes in Computer Science(), vol 5422. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00665-4_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-00665-4_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00664-7

  • Online ISBN: 978-3-642-00665-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics