Skip to main content

Part of the book series: Theory and Decision Library ((TDLB,volume 32))

Abstract

Finitely generated Heyting algebras and monadic Heyting algebras are described in terms of perfect Kripke models using colouring technique. Defining projective algebras as retract of free algebras, the characteristic of finitely generated projective algebras is given in varieties of Heyting algebras and monadic Heyting algebras. By means of projective algebras, using an algebraic proof, the conditions of Friedman’s conjecture (Problem 41 [8]) are confirmed for well-known Medvedev's logic.

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

Access this chapter

eBook
USD 16.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. R. Balbs and A. Horn, Injective and projective Heyting algebra, Trans. Amer. Soc. 148 (1970), 549–559.

    Article  Google Scholar 

  2. R.Bull, MPS as the formalization of an intuitionistic concept of modality, Journal of Symbolic Logic 31 (1966), 609–616.

    Article  MathSciNet  MATH  Google Scholar 

  3. R. Engelking, General topology, Polish Scientific Publishers, Warszawa, 1977.

    MATH  Google Scholar 

  4. L. Esakia, Topological Kripke model, Dokl. Sov. Akad. 214, 2, 298–301.

    Google Scholar 

  5. L. Esakia, The provability status of intuitionistic logic with the maximality principle, Preprint, 1989.

    Google Scholar 

  6. L. Esakia, The provability logic with quantifier modalities, IYSoviet-Finnish Symposium on Intensional Logic and Logical Structure of Theory "Metsniereba", Tbilisi, (1988), 4–10.

    Google Scholar 

  7. L. Esakia, R. Grigolia, The criterion of Brouwerian and closure algebras to be finiteliy generated, Bull. Sect. Logic 6, 2, (1973), 46–52.

    MathSciNet  Google Scholar 

  8. H. Friedman, One hundred and two problems in mathematical logic, Journal of Symbolic Logic 40 (1975), 113–129.

    Article  MathSciNet  MATH  Google Scholar 

  9. R. Grigolia, Free algebras of non classical logics, Monograph, “Metsniereba”, Tbilisi, 1987.

    Google Scholar 

  10. P. Halmos, Algebraic logic, Chesea Publ. Comp., N. Y., 1962.

    MATH  Google Scholar 

  11. R. Harrop, Concerning formulas of types A ⇀ B V C, A⇀ (∃x)B(x) in intuitionistic formal system, Journal of Symbolic Logic 25 (1960), 27–32.

    Article  MathSciNet  MATH  Google Scholar 

  12. G. Kreisel and H. Putnam, Eine Unableitbarkeitsbeweismethode für den ituitionistischen Aussagenkalkul, Arch. Math. Logic (Archiv für Math. Logik und Grundlagenforsch.) 3 (1957), 74–78.

    Article  MathSciNet  MATH  Google Scholar 

  13. JV. Medvedev, Finite problems, Dokl. Sov. Acad. 142, 5 (1962), 1015–1018.

    Google Scholar 

  14. I. Nishimura, On formulas on one variable in intuitionistic propositional calculus, Journal of Symbolic Logic 25 (1960), 327–331.

    Article  MathSciNet  MATH  Google Scholar 

  15. H. Ono, On some intuitionistic modal logic, Publication of the Research Institute for mathematical sciences, Kyoto university, 13 (1977), 687–722.

    Article  MATH  Google Scholar 

  16. W. A. Pogorzelski, Structural completeness of the propositional calculus, Bull. Acad. Polon. Sci. Ser. Math. Astr. Phys. 19 (1971), 349–351.

    MathSciNet  MATH  Google Scholar 

  17. T. Prucnal, Structural completeness of Medvedev's propositional calculus, Reports on Math. Log. 6 (1976).

    Google Scholar 

  18. T. Prucnal, On two problems of Harvey Friedman, SL 38, 3 (1979), 247–262.

    MathSciNet  MATH  Google Scholar 

  19. T. Prucnal, On the structural completeness of some pure implicational propositional calculus, SL 30 (1972), 45–52.

    MathSciNet  MATH  Google Scholar 

  20. H. Rasiowa and R. Sikorski, The mathematics of metamathematics, (3rd ed.) Monografie mathematyczne, Warszawa, 1970.

    Google Scholar 

  21. L. Rieger, Zametki o tak nazyvaemykh algebrakh s zamykaniami, Chekh. Math. Journ. 7, 16 (1957).

    MathSciNet  Google Scholar 

  22. N. I. Suzuki, An algrbraic approach to intuitionistic modal logic in connections with Intermediate predicate logic, SL 48 (1989), 141–155.

    MATH  Google Scholar 

  23. A. Urquhart, Free Heyting algebras, Alg. Univ. 3, 1, (1973), 94–97.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Grigolia, R. (1995). Free and projective Heyting and monadic Heyting algebras. In: Höhle, U., Klement, E.P. (eds) Non-Classical Logics and their Applications to Fuzzy Subsets. Theory and Decision Library, vol 32. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-0215-5_4

Download citation

  • DOI: https://doi.org/10.1007/978-94-011-0215-5_4

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-4096-9

  • Online ISBN: 978-94-011-0215-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics