论文信息 - On representable ordered residuated semigroups

On representable ordered residuated semigroups

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

Szabolcs Mikulás | S. Mikulás

[1] Hajnal Andréka,et al. Representations of distributive lattice-ordered semigroups with binary relations , 1991 .

[2] Roger D. Maddux,et al. Nonfinite axiomatizability results for cylindric and relation algebras , 1989, Journal of Symbolic Logic.

[3] Szabolcs Mikulás,et al. POSITIVE FRAGMENTS OF RELEVANCE LOGIC AND ALGEBRAS OF BINARY RELATIONS , 2010, The Review of Symbolic Logic.

[4] Vaughan R. Pratt,et al. Action Logic and Pure Induction , 1990, JELIA.

[5] Vito F. Sinisi,et al. Entailment: The Logic of Relevance and Necessity , 1996 .

[6] Szabolcs Mikulás,et al. Algebras of Relations and Relevance Logic , 2009, J. Log. Comput..

[7] J. Lambek. The Mathematics of Sentence Structure , 1958 .

[8] Richard Sylvan,et al. The semantics of entailment—II , 1972, Journal of Philosophical Logic.

[9] Szabolcs Mikulás,et al. Lambek Calculus and its relational semantics: Completeness and incompleteness , 1994, J. Log. Lang. Inf..

[10] R. Meyer,et al. The semantics of entailment — III , 1973 .

[11] I. Hodkinson,et al. Relation Algebras by Games , 2002 .

[12] Reinhard Diestel,et al. Graph Theory , 1997 .

[13] Roger D. Maddux,et al. RELEVANCE LOGIC AND THE CALCULUS OF RELATIONS , 2010, The Review of Symbolic Logic.