Skip to main content
SpringerLink
Log in

The finite embeddability property for residuated groupoids

  • Published:
Algebra universalis Aims and scope Submit manuscript

Abstract

A very simple proof of the finite embeddability property for residuated distributive-lattice-ordered groupoids and some related classes of structures is presented. In particular, this gives an answer to the question, posed by Blok and van Alten, whether the class of residuated ordered groupoids has the property. The presented construction improves the computational-complexity upper bound of the universal theory of residuated distributive-lattice-ordered groupoids given by Buszkowski and Farulewski; for chains in the class, a tight bound is obtained.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bílková, M., Horčík, R., Velebil, J.: Distributive substructural logics as coalgebraic logics over posets. In: T. Bolander, T. Brauner, S. Ghilardi, L. Moss (eds.) Advances in Modal Logic, pp. 119–142. College Publications, Copenhagen (2012)

  2. Blok W.J, van Alten C.J.: The finite embeddability property for residuated lattices, pocrims and BCK-algebras. Algebra Universalis 48, 253–271 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  3. Blok W.J, van Alten C.J.: On the finite embeddability property for residuated ordered groupoids. Trans. Amer. Math. Soc. 357, 4141–4157 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bloniarz, P.A., Hunt, H.B., III, Rosenkrantz, D.J.: Algebraic structures with hard equivalence and minimization problems. J. ACM 31, 879–904 (1984)

  5. Buszkowski, W.: Lambek Calculus with Nonlogical Axioms. In: Casadio, C., Scott, P. J., Seely, R. (eds.) Languages and Grammar. Studies in Mathematical Linguistics and Natural Language, pp. 77–93. CSLI Publications, Stanford (2005)

  6. Buszkowski, W., Farulewski, M.: Nonassociative lambek calculus with additives and context-free languages. In: O. Grumberg, M. Kaminski, S. Katz, S. Wintner (eds.) Languages: From Formal to Natural, Lecture Notes in Computer Science, vol. 5533. Springer, Berlin (2009)

  7. Cintula, P., Horčík, R., Noguera, C.: Non-associative substructural logics and their semilinear extensions: Axiomatization and completeness properties. The Review of Symbolic Logic (in press)

  8. Cintula, P., Noguera, C.: A general framework for mathematical fuzzy logic. In: P. Cintula, P. Hájek, C. Noguera (eds.) Handbook of Mathematical Fuzzy Logic – Volume 1, Studies in Logic, Mathematical Logic and Foundations, vol. 37. 103–207, London (2011)

  9. Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (1990)

    MATH  Google Scholar 

  10. Evans T.: Some connections between residual finiteness, finite embeddability and the word problem. J. London Math. Soc. 1, 399–403 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  11. Farulewski, M.: Finite embeddabilty property for residuated groupoids. Rep. on Math. Logic 43, 25–42 (2008)

    MATH  MathSciNet  Google Scholar 

  12. Grätzer, G.: General lattice theory, 2nd edn. Birkhäuser, Basel (1998). New appendices by the author with B. A. Davey, R. Freese, B. Ganter, M. Greferath, P. Jipsen, H. A. Priestley, H. Rose, E. T. Schmidt, S. E. Schmidt, F. Wehrung and R. Wille

  13. Papadimitriou, C.H.: Computational Complexity. Theoretical Computer Science. Addison Wesley (1993)

  14. Restall, G.: An Introduction to Substructural Logics. Routledge, New York (2000)

    Google Scholar 

  15. Routley, R., Meyer, R.K.: Semantics of Entailment. In: Leblanc, H. (ed.) Truth Syntax and Modality, Proceedings of the Temple University Conference on Alternative Semantics, pp. 194–243. North Holland, 1973.

  16. Urquhart, A.: Semantics for Relevant Logics. J. Symbolic Logic 37, 159–169 (1972)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Academy of Sciences of the Czech Republic, Pod Vodárenskou věží 2, 182 07, Prague, Czech Republic

    Zuzana Haniková & Rostislav Horčík

Authors
  1. Zuzana Haniková
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rostislav Horčík
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rostislav Horčík.

Additional information

Presented by J. Raftery.

The work of the authors was partly supported by the grant P202/11/1632 of the Czech Science Foundation and partly by the long-term strategic development financing of the Institute of Computer Science (RVO:67985807).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Haniková, Z., Horčík, R. The finite embeddability property for residuated groupoids. Algebra Univers. 72, 1–13 (2014). https://doi.org/10.1007/s00012-014-0284-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00012-014-0284-1

2010 Mathematics Subject Classification

Key words and phrases

Search

Navigation