Skip to main content
SpringerLink
Log in

Proof Theory and Ordered Groups

  • Conference paper
  • First Online:
Logic, Language, Information, and Computation (WoLLIC 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10388))

Abstract

Ordering theorems, characterizing when partial orders of a group extend to total orders, are used to generate hypersequent calculi for varieties of lattice-ordered groups (\(\ell \)-groups). These calculi are then used to provide new proofs of theorems arising in the theory of ordered groups. More precisely: an analytic calculus for abelian \(\ell \)-groups is generated using an ordering theorem for abelian groups; a calculus is generated for \(\ell \)-groups and new decidability proofs are obtained for the equational theory of this variety and extending finite subsets of free groups to right orders; and a calculus for representable \(\ell \)-groups is generated and a new proof is obtained that free groups are orderable.

Supported by Swiss National Science Foundation grant 200021_146748 and the EU Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 689176.

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

Access this chapter

Log in via an institution
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 EPUB and 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

References

  1. Anderson, M.E., Feil, T.H.: Lattice-Ordered Groups: An Introduction. Springer, Heidelberg (1988)

    Book  MATH  Google Scholar 

  2. Burris, S., Sankappanavar, H.P.: A Course in Universal Algebra. Springer, Heidelberg (1981)

    Book  MATH  Google Scholar 

  3. Ciabattoni, A., Galatos, N., Terui, K.: Algebraic proof theory for substructural logics: cut-elimination and completions. Ann. Pure Appl. Logic 163(3), 266–290 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  4. Ciabattoni, A., Galatos, N., Terui, K.: Algebraic proof theory: hypersequents and hypercompletions. Ann. Pure Appl. Logic 168(3), 693–737 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  5. Cignoli, R., D’Ottaviano, I.M.L., Mundici, D.: Algebraic foundations of many-valued reasoning. Kluwer, Berlin (1999)

    MATH  Google Scholar 

  6. Clay, A., Smith, L.H.: Corrigendum to [19]. J. Symb. Comput. 44(10), 1529–1532 (2009)

    Article  MATH  Google Scholar 

  7. Dantzig, G.B.: Linear Programming and Extensions. Princeton University, Press (1963)

    Book  MATH  Google Scholar 

  8. Fuchs, L.: Partially Ordered Algebraic Systems. Pergamon Press, Oxford (1963)

    MATH  Google Scholar 

  9. Galatos, N., Metcalfe, G.: Proof theory for lattice-ordered groups. Ann. Pure Appl. Logic 8(167), 707–724 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  10. Holland, W.C.: The lattice-ordered group of automorphisms of an ordered set. Mich. Math. J. 10, 399–408 (1963)

    Article  MathSciNet  MATH  Google Scholar 

  11. Holland, W.C.: The largest proper variety of lattice-ordered groups. Proc. Am. Math. Soc. 57, 25–28 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  12. Holland, W.C., McCleary, S.H.: Solvability of the word problem in free lattice-ordered groups. Houston J. Math. 5(1), 99–105 (1979)

    MathSciNet  MATH  Google Scholar 

  13. Jipsen, P., Montagna, F.: Embedding theorems for classes of GBL-algebras. J. Pure Appl. Algebra 214(9), 1559–1575 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  14. Kopytov, V.M., Medvedev, N.Y.: The Theory of Lattice-Ordered Groups. Kluwer, Alphen aan den Rijn (1994)

    Book  MATH  Google Scholar 

  15. Metcalfe, G., Olivetti, N., Gabbay, D.: Sequent and hypersequent calculi for abelian and Łukasiewicz logics. ACM Trans. Comput. Log. 6(3), 578–613 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  16. Metcalfe, G., Olivetti, N., Gabbay, D.: Proof Theory for Fuzzy Logics. Springer, Heidelberg (2008)

    MATH  Google Scholar 

  17. Montagna, F., Tsinakis, C.: Ordered groups with a conucleus. J. Pure Appl. Algebra 214(1), 71–88 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  18. Neumann, B.H.: On ordered groups. Am. J. Math. 71(1), 1–18 (1949)

    Article  MathSciNet  MATH  Google Scholar 

  19. Smith, L.H.: On ordering free groups. J. Symb. Comput. 40(6), 1285–1290 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  20. Terui, K.: Which structural rules admit cut elimination? – An algebraic criterion. J. Symbolic Logic 72(3), 738–754 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  21. Weinberg, E.C.: Free abelian lattice-ordered groups. Math. Ann. 151, 187–199 (1963)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Institute, University of Bern, Bern, Switzerland

    Almudena Colacito & George Metcalfe

Authors
  1. Almudena Colacito
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. George Metcalfe
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to George Metcalfe .

Editor information

Editors and Affiliations

  1. Department of Mathematics and Statistics, University of Helsinki, Helsinki, Finland

    Juliette Kennedy

  2. Centro de Informática, Recife, Pernambuco, Brazil

    Ruy J.G.B. de Queiroz

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer-Verlag GmbH Germany

About this paper

Cite this paper

Colacito, A., Metcalfe, G. (2017). Proof Theory and Ordered Groups. In: Kennedy, J., de Queiroz, R. (eds) Logic, Language, Information, and Computation. WoLLIC 2017. Lecture Notes in Computer Science(), vol 10388. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-55386-2_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-55386-2_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-55385-5

  • Online ISBN: 978-3-662-55386-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation