Skip to main content

Completions of Basic Algebras

  • Conference paper
Logic, Language, Information and Computation (WoLLIC 2009)

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

Abstract

We discuss completions of basic algebras. We prove that the ideal completion of a basic algebra is also a basic algebra. It will be shown that basic algebras are not closed under MacNeille completions. By adding the join-infinite distributive law to basic algebras, we will show that these kind of basic algebras are closed under the closed ideal completion and moreover any other regular completions of these algebras are isomorphic to the closed ideal completion. As an application we establish an algebraic completeness theorem for a logic weaker than Visser’s basic predicate logic, BQL, a proper subsystem of intuitionistic predicate logic, IQL.

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. Alizadeh, M., Ardeshir, M.: Amalgamation property for the class of basic algebras and some of its natural subclasses. Archive for Mathematical Logic 45, 913–930 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  2. Alizadeh, M., Ardeshir, M.: On Löb algebras. Mathematical Logic Quarterly 52, 95–105 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  3. Alizadeh, M., Ardeshir, M.: On Löb algebras II (submitted)

    Google Scholar 

  4. Ardeshir, M.: Aspects of basic logic. PhD thesis, Department of Mathematics, Statistics and Computer Science, Marquette University (1995)

    Google Scholar 

  5. Ardeshir, M., Ruitenburg, M.: Basic propositional calculus I. Mathematical Logic Quarterly 44, 317–343 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  6. Harding, J.: Any lattice can be regularly embedded into the Macneille completion of a distributive lattice. Houston J. Math. 19, 39–44 (1993)

    MathSciNet  MATH  Google Scholar 

  7. Harding, J., Bezhanishvili, G.: MacNielle completions of Heyting algebras. Houston J. Math. 30, 937–950 (2004)

    MATH  Google Scholar 

  8. Ruitenburg, W.: Basic predicate calculus. Notre Dame Journal of Formal Logic 39, 18–46 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  9. Visser, V.: A propositional logic with explicit fixed points. Studia Logica 40, 155–175 (1981)

    Article  MathSciNet  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

Alizadeh, M. (2009). Completions of Basic Algebras. In: Ono, H., Kanazawa, M., de Queiroz, R. (eds) Logic, Language, Information and Computation. WoLLIC 2009. Lecture Notes in Computer Science(), vol 5514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02261-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02261-6_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02260-9

  • Online ISBN: 978-3-642-02261-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics