Proof theory for lattice-ordered groups
| Data(s) |
01/08/2016
31/12/1969
|
|---|---|
| Resumo |
Proof-theoretic methods are developed and exploited to establish properties of the variety of lattice-ordered groups. In particular, a hypersequent calculus with a cut rule is used to provide an alternative syntactic proof of the generation of the variety by the lattice-ordered group of automorphisms of the real number chain. Completeness is also established for an analytic (cut-free) hypersequent calculus using cut elimination and it is proved that the equational theory of the variety is co-NP complete. |
| Formato |
application/pdf application/pdf |
| Identificador |
http://boris.unibe.ch/82312/1/GM16_final.pdf http://boris.unibe.ch/82312/8/1-s2.0-S0168007216300343-main.pdf Galatos, Nikolaos; Metcalfe, George (2016). Proof theory for lattice-ordered groups. Annals of pure and applied logic, 167(8), pp. 707-724. Elsevier 10.1016/j.apal.2016.04.004 <http://dx.doi.org/10.1016/j.apal.2016.04.004> doi:10.7892/boris.82312 info:doi:10.1016/j.apal.2016.04.004 urn:issn:0168-0072 |
| Idioma(s) |
eng |
| Publicador |
Elsevier |
| Relação |
http://boris.unibe.ch/82312/ |
| Direitos |
info:eu-repo/semantics/embargoedAccess info:eu-repo/semantics/restrictedAccess |
| Fonte |
Galatos, Nikolaos; Metcalfe, George (2016). Proof theory for lattice-ordered groups. Annals of pure and applied logic, 167(8), pp. 707-724. Elsevier 10.1016/j.apal.2016.04.004 <http://dx.doi.org/10.1016/j.apal.2016.04.004> |
| Palavras-Chave | #510 Mathematics |
| Tipo |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion PeerReviewed |
