Skip to main content

Countable Almost Rigid Heyting Algebras

  • Conference paper
Book cover Topics in Discrete Mathematics

Part of the book series: Algorithms and Combinatorics ((AC,volume 26))

  • 1696 Accesses

Abstract

For non-trivial Heyting algebras H 1, H 2 one always has at least one homomorphism H 1H 2; if H 1 = H 2 there is at least one non-identical one. A Heyting algebra H is almost rigid if ∣ End(H)∣ = 2 and a system of almost rigid algebras ℌ is said to be discrete if ∣ Hom(H 1, H 2)∣ = 1 for any two distinct H 1, H 2 ∈ ℌ. We show that there exists a discrete system of 2ω countable almost rigid Heyting algebras.

The second author would like to express his thanks for the support by the project LN 00A056 of the Ministry of Education of the Czech Republic.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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. M. E. Adams, V. Koubek, and J. Sichler, Endomorphisms and homomorphisms of Heyting algebras, Algebra Universalis 20 (1985), 167–178.

    Article  MATH  MathSciNet  Google Scholar 

  2. R. Balbes, P. Dwinger, “Distributive Lattices”, University of Missouri Press, Columbia, Missouri, 1974.

    MATH  Google Scholar 

  3. B. Jónsson, A Boolean algebra without proper automorphisms, Proc. Amer. Math. Soc. 2 (1951), 766–770.

    Article  MATH  MathSciNet  Google Scholar 

  4. M. Katětov, Remarks on Boolean algebras, Colloq. Math. 2 (1951), 229–235.

    Google Scholar 

  5. S. Koppelberg, “Handbook of Boolean Algebras I”, North-Holland, Amsterdam, 1989.

    Google Scholar 

  6. C. Kuratowski, Sur la puissance de I’ensemble des “nombres de dimensions” de M. Fréchet, Fund. Math. 8 (1926), 201–208.

    Google Scholar 

  7. K. D. Magill, The semigroup of endomorphisms of a Boolean ring, Semigroup Forum 4 (1972), 411–416.

    Google Scholar 

  8. C. J. Maxson, On semigroups of Boolean ring endomorphisms, Semigroup Forum 4 (1972), 78–82.

    Article  MATH  MathSciNet  Google Scholar 

  9. H. A. Priestley, Representation of distributive lattices by means of ordered Stone spaces, Bull. London Math. Soc. 2 (1970), 186–190.

    Article  MATH  MathSciNet  Google Scholar 

  10. H. A. Priestley, Ordered topological spaces and the representation of distributive lattices, Proc. London Math. Soc. 324 (1972), 507–530.

    Article  MathSciNet  Google Scholar 

  11. L. Rieger, Some remarks on automorphisms of Boolean algebras, Fund. Math. 38 (1951), 209–216.

    MATH  MathSciNet  Google Scholar 

  12. B. M. Schein, Ordered sets, semilattices, distributive lattices, and Boolean algebras with homomorphic endomorphism semigroups, Fund. Math. 68 (1970), 31–50.

    MATH  MathSciNet  Google Scholar 

  13. C. Tsinakis, Brouwerian Semilattices Determined by their Endomorphism Semigroups, Houston J. Math. 5 (1979), 427–436.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Adams, M.E., Pultr, A. (2006). Countable Almost Rigid Heyting Algebras. In: Klazar, M., Kratochvíl, J., Loebl, M., Matoušek, J., Valtr, P., Thomas, R. (eds) Topics in Discrete Mathematics. Algorithms and Combinatorics, vol 26. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-33700-8_1

Download citation

Publish with us

Policies and ethics