Proof theory for lattice-ordered groups

DOI10.1016/j.apal.2016.04.004zbMath1348.06011OpenAlexW2343933684MaRDI QIDQ287483

Nikolaos Galatos, George Metcalfe

Publication date: 20 May 2016

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2016.04.004

zbMATH Keywords

cut eliminationproof theoryco-NP completenesshypersequent calculilattice-ordered groups

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Equational logic, Mal'tsev conditions (08B05) Ordered groups (06F15) Ordered abelian groups, Riesz groups, ordered linear spaces (06F20) Word problems (aspects of algebraic structures) (08A50)

Related Items (3)

From distributive \(\ell\)-monoids to \(\ell\)-groups, and back again ⋮ Integrally closed residuated lattices ⋮ Ordering groups and validity in lattice-ordered groups

Cites Work

• Unnamed Item
• Unnamed Item
• Algebraic proof theory for substructural logics: cut-elimination and completions
• Residuated lattices. An algebraic glimpse at substructural logics
• Density elimination
• Ordered groups with a conucleus
• Mapping Abelian \(\ell\)-groups with strong unit one-one into MV algebras
• The complexity of the word problem for abelian l-groups
• Analytic calculi for product logics
• Generalized MV-algebras
• Proof theory for fuzzy logics
• The lattice-ordered group of automorphisms of an ordered set
• Proof Theory for Casari's Comparative Logics
• On the Computational Complexity of Algebra on Lattices
• Proving termination with multiset orderings
• The Largest Proper Variety of Lattice Ordered Groups
• Pseudo MV-algebras are intervals in ℓ-groups
• Sequent and hypersequent calculi for abelian and łukasiewicz logics
• Substructural fuzzy logics

This page was built for publication: Proof theory for lattice-ordered groups