On representable ordered residuated semigroups

12 years 11 months ago

Download www.dcs.bbk.ac.uk

We show that the equational theory of representable lattice-ordered residuated semigroups is not ﬁnitely axiomatizable. We apply this result to the problem of completeness of substructural logics.

Szabolcs Mikulás

Real-time Traffic

Equational Theory | IGPL 2011 | Information Technology | Lattice-ordered Residuated Semigroups | Substructural Logics |

claim paper

» Finding coevolving amino acid residues using row and column weighting of mutual informatio...

» A twostage approach for improved prediction of residue contact maps

» DigitRecurrence Algorithm for Computing Euclidean Norm of a 3D Vector

» Verification of Java Bytecode using Analysis and Transformation of Logic Programs

» SABERTOOTH protein structural alignment based on a vectorial structure representation

» Docking protein domains in contact space

» Clustering protein environments for function prediction finding PROSITE motifs in 3D

» The nullspace method a unifying paradigm to fault detection

Post Info
More Details (n/a)

Added	14 May 2011
Updated	14 May 2011
Type	Journal
Year	2011
Where	IGPL
Authors	Szabolcs Mikulás

Comments (0)

Sciweavers

On representable ordered residuated semigroups

Equational Theory | IGPL 2011 | Information Technology | Lattice-ordered Residuated Semigroups | Substructural Logics |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers