Skip to main content

Finitely Presented Abelian Lattice-Ordered Groups

  • Chapter
  • 601 Accesses

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

Abstract

We give necessary and sufficient conditions for the first-order theory of a finitely presented abelian lattice-ordered group to be decidable. We also show that if the number of generators is at most 3, then elementary equivalence implies isomorphism. We deduce from our methods that the theory of the free MV-algebra on at least 2 generators is undecidable.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baker, K.A.: Free vector lattices. Canad. J. Math. 20, 58–66 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  2. Beynon, W.M.: Duality theorems for finitely generated vector lattices. Proc. London Math. Soc. 31(3), 114–128 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  3. Beynon, W.M.: Applications of duality in the theory of finitely generated lattice-ordered abelian groups. Can. J. Math. 29(2), 243–254 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  4. Cignoli, R., d’Ottaviano, I., Mundici, D.: Algebraic foundations of many-valued reasoning. Trends in Logic, vol. 7. Kluwer Academic publishers, Dordrecht (2000)

    MATH  Google Scholar 

  5. Glass, A.M.W.: Partially ordered groups. Series in Algebra, vol. 7. World Scientific Pub. Co., Singapore (1999)

    MATH  Google Scholar 

  6. Glass, A.M.W., Macintyre, A.J., Point, F.: Free abelian lattice-ordered groups. Annals of Pure and Applied Logic 134, 265–283 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  7. Glass, A.M.W., Madden, J.J.: The word problem versus the isomorphism problem. J. London Math. Soc. 30(1), 53–61 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  8. Grzegorczyk, A.: Undecidability of some topological theories. Fund. Math. 38, 137–152 (1951)

    MathSciNet  Google Scholar 

  9. Marra, V., Mundici, D.: Combinatorial fans, lattice-ordered groups, and their neighbours: a short excursion. Séminaire Lotharingien de Combinatoire 47, B47 (2002)

    Google Scholar 

  10. Semmes, S.: Real analysis, quantitative topology and geometric complexity. Publicacions matematiques (Barcelona) 45, 3–67, 265–333 (2001)

    Google Scholar 

  11. Whittlesey, E.F.: Classification of finite 2-complexes. Proc. Amer. Math. Soc. 9, 841–845 (1958)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Stefano Aguzzoli Agata Ciabattoni Brunella Gerla Corrado Manara Vincenzo Marra

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Glass, A.M.W., Point, F. (2007). Finitely Presented Abelian Lattice-Ordered Groups. In: Aguzzoli, S., Ciabattoni, A., Gerla, B., Manara, C., Marra, V. (eds) Algebraic and Proof-theoretic Aspects of Non-classical Logics. Lecture Notes in Computer Science(), vol 4460. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75939-3_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75939-3_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75938-6

  • Online ISBN: 978-3-540-75939-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics