SearcharxivSearch

arXiv · 1307.2042

On Fragments without Implications of both the Full Lambek Logic and some of its Substructural Extensions

Abstract

In this paper we study some fragments without implications of the (Hilbert) full Lambek logic $\mathbf{HFL}$ and also some fragments without implications of some of the substructural extensions of that logic. To do this, we perform an algebraic analysis of the Gentzen systems defined by the substructural calculi $\FL_σ$. Such systems are extensions of the full Lambek calculus $\FL$ with the rules codified by a subsequence, $σ$, of the sequence $e w_l w_r c$; where $e$ stands for \emph{exchange}, $w_l$ for \emph{left weakening}, $w_r$ for \emph{right weakening}, and $c$ for \emph{contraction}. We prove that these Gentzen systems (in languages without implications) are algebraizable by obtaining their equivalent algebraic semantics. All these classes of algebras are varieties of pointed semilatticed monoids and they can be embedded in their ideal completions. As a consequence of these results, we reveal that the fragments of the Gentzen systems associated with the calculi $\FL_σ$ are the restrictions of them to the sublanguages considered, and we also reveal that in these languages, the fragments of the external systems associated with $\FL[σ]$ are the external systems associated with the restricted Gentzen systems (i.e., those obtained by restriction of $\FL_σ]$ to the implication-less languages considered). We show that all these external systems without implication have algebraic semantics but they are not algebraizable (and are not even protoalgebraic). Results concerning fragments without implication of intuitionistic logic without contraction were already reported in Bou et al.(2006): On two fragments with negation and without implication of the logic of residuated lattices. Archive for Mathematical Logic 45(5) and in Adillón et al. (2007): On three implication-less fragments of t-norm based fuzzy logics. Fuzzy Sets and Systems 158(23).

Explore related subjects

Keep this discovery

BibTeXRIS

Àngel García-Cerdaña, Ventura Verdú. 2013-07-08. On Fragments without Implications of both the Full Lambek Logic and some of its Substructural Extensions. https://arxiv.org/abs/1307.2042

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO