A Gentzen System And Decidability For Residuated Lattices (original) (raw)

On two fragments with negation and without implication of the logic of residuated lattices

Archive for Mathematical Logic, 2006

The logic of (commutative integral bounded) residuated lattices is known under different names in the literature: monoidal logic [Höh95], intuitionistic logic without contraction [AV00], H BCK [OK85] (nowadays called FL ew by Ono), etc. In this paper 1 we study the ∨, * , ¬, 0, 1-fragment and the ∨, ∧, * , ¬, 0, 1-fragment of the logical systems associated with residuated lattices, both from the perspective of Gentzen systems and from that of deductive systems. We stress that our notion of fragment considers the full consequence relation admitting hypotheses. It results that this notion of fragment is axiomatized by the rules of the sequent calculus FL ew for the connectives involved. We also prove that these deductive systems are non-protoalgebraic, while the Gentzen systems are algebraizable with equivalent algebraic semantics the varieties of pseudocomplemented (commutative integral bounded) semilatticed and latticed monoids, respectively. All the logical systems considered are decidable.

Residuated frames with applications to decidability

Transactions of the American Mathematical Society, 2012

Residuated frames provide relational semantics for substructural logics and are a natural generalization of Kripke frames in intuitionistic and modal logic, and of phase spaces in linear logic. We explore the connection between Gentzen systems and residuated frames and illustrate how frames provide a uniform treatment for semantic proofs of cut-elimination, the finite model property and the finite embeddability property, which imply the decidability of the equational/universal theories of the associated residuated lattice-ordered groupoids. In particular these techniques allow us to prove that the variety of involutive FL-algebras and several related varieties have the finite model property.

Logics preserving degrees of truth from varieties of residuated lattices

Journal of Logic and Computation, 2012

Let K be a variety of (commutative, integral) residuated lattices. The substructural logic usually associated with K is an algebraizable logic that has K as its equivalent algebraic semantics, and is a logic that preserves truth, i.e., 1 is the only truth value preserved by the inferences of the logic. In this paper we introduce another logic associated with K, namely the logic that preserves degrees of truth, in the sense that it preserves lower bounds of truth values in inferences. We study this second logic mainly from the point of view of abstract algebraic logic. We determine its algebraic models and we classify it in the Leibniz and the Frege hierarchies: we show that it is always fully selfextensional, that for most varieties K it is non-protoalgebraic, and that it is algebraizable if and only K is a variety of generalized Heyting algebras, in which case it coincides with the logic that preserves truth. We also characterize the new logic in three ways: by a Hilbert style axiomatic system, by a Gentzen style sequent calculus, and by a set of conditions on its closure operator. Concerning the relation between the two logics, we prove that the truth preserving logic is the extension of the one that preserves degrees of truth with either the rule of Modus Ponens or the rule of Adjunction for the fusion connective.

The Variety of Residuated Lattices is Generated by its Finite Simple Members

Reports on Mathematical Logic, 2000

In this paper, we will show that the variety of residuated lattices is generated by finite simple residuated lattices. The "simplicity" part of the proof is based on Grišin's idea from [5], whereas the "finiteness" part employs a kind of algebraic filtration argument. Since the set of formulas valid in all residuated lattices is equal to the set of formulas provable in the propositional logic FL ew , the propositional logic obtained from the intuitionistic logic by deleting contraction rule (see Ono [8] for instance), our result can be restated as follows: for any formula A, A is provable in FL ew if and only if it is valid in any finite simple residuated lattice.

Logics without the contraction rule and residuated lattices

The Australasian Journal of Logic, 2010

In this paper, we will develop an algebraic study of substructural propositional logics over FLew, i.e. the logic which is obtained from intuitionistic logics by eliminating the contraction rule. Our main technical tool is to use residuated lattices as the algebraic semantics for them. This enables us to study different kinds of nonclassical logics, including intermediate logics, BCK-logics, Lukasiewicz’s many-valued logics and fuzzy logics, within a uniform framework.

Substructural Logics and Residuated Lattices — an Introduction

Trends in Logic, 2003

This is an introductory survey of substructural logics and of residuated lattices which are algebraic structures for substructural logics. Our survey starts from sequent systems for basic substructural logics and develops the proof theory of them. Then, residuated lattices are introduced as algebraic structures for substructural logics, and some recent developments of their algebraic study are presented. Based on these facts, we conclude at the end that substructural logics are logics of residuated structures, and in this way explain why sequent systems are suitable for formalizing substructural logics.

Reductions in Intuitionistic Linear Logic

Mathematical Structures in Computer Science, 1995

In this work we show how some useful reductions known from ordinary intuitionistic propositional calculus can be modified for Intuitionistic Linear Logic (without modalities). The main reductions we consider are: (1) the reduction of the depth of formulas in the sequents by addition of new variables, and (2) the elimination of linear disjunction, tensor and constant F. Both transformations preserve deducibility, that is, a transformed sequent is deducible if and only if the initial one was deducible. The size of the sequent grows linearly in case (1) and ≤ On8 in case (2).

Permutability of Rules for Linear Lattices

2005

Abstract: The theory of linear lattices is presented as a system with multiple-conclusion rules. It is shown through the permutability of the rules that the system enjoys a subterm property: all terms in a derivation can be restricted to terms in the conclusion or in the assumptions. Decidability of derivability with the rules for linear lattices follows through the termination of proof-search. Key Words: lattice theory, proof analysis, decidability Category: F. 4.1