Skip to main content

Amalgamation Property for Varieties of BL-algebras Generated by One Chain with Finitely Many Components

  • Conference paper
  • First Online:
Relational and Algebraic Methods in Computer Science (RAMiCS 2021)

Abstract

BL-algebras are the algebraic semantics for Hájek’s Basic Logic BL, the logic of all continuous t-norms and their residua. Every BL-chain can be decomposed (up to isomorphism) as an ordinal sum of non-trivial Wajsberg hoops - called components - with the first bounded. In this paper we study the amalgamation property for the varieties of BL-algebras generated by one BL-chain with finitely many components.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    \(\varGamma \) establishes a categorical equivalence between abelian l-groups with a strong order unit \((\mathcal {G},u)\) and MV-algebras, by equipping the interval [0, u] of \(\mathcal {G}\) with MV-algebraic operations obtained by truncation of the group ones. On arrows \(\varGamma \) acts by restriction.

  2. 2.

    Note that every non-trivial totally ordered cancellative hoop \(\mathcal {A}\) does not have rank, since \(\mathcal {A}/Rad(\mathcal {A})\) is an infinite cancellative hoop.

  3. 3.

    To use this proof strategy is essential that \(k\ge 4\).

  4. 4.

    To use this proof strategy it is essential that \(h\ge 2\). For every \(l(C_i)\) (\(m(D_i)\), respectively), the elements are ordered as in the chain \(l(\mathcal {C}_i)\) (\(m(\mathcal {D}_i)\), respectively).

  5. 5.

    Here \(x\Leftrightarrow y\) stands for \((x\Rightarrow y)*(y\Rightarrow x)\). Moreover \(x\uplus y{\mathop {=}\limits ^{\text {def}}}(x\Rightarrow (x*y))\Rightarrow y\), whilst nx is defined inductively by \(0x=0\) and \(n(x)=(n-1)x\uplus x\).

  6. 6.

    The assumption that \(Ch(\mathcal {A})\) does not contain trivial chains is essential. Indeed, if \(\mathcal {A}\) is non-trivial, then \(\mathbf {ISP}_u(\mathcal {A})\) does not contain trivial algebras.

References

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Aguzzoli, S., Bianchi, M. (2021). Amalgamation Property for Varieties of BL-algebras Generated by One Chain with Finitely Many Components. In: Fahrenberg, U., Gehrke, M., Santocanale, L., Winter, M. (eds) Relational and Algebraic Methods in Computer Science. RAMiCS 2021. Lecture Notes in Computer Science(), vol 13027. Springer, Cham. https://doi.org/10.1007/978-3-030-88701-8_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-88701-8_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-88700-1

  • Online ISBN: 978-3-030-88701-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics