This work extend to residuated lattices the results of [ 7 ]. It also provides a possible generalization to this context of frontal operators in the sense of [ 9 ]. Let L be a residuated lattice, and f : L k → L a function. We give a necessary and sufficient condition for f to be compatible with respect to every congruence on L . We use this characterization of compatible functions in order to prove that the variety of (...) residuated lattices is locally affine complete. We study some compatible functions on residuated lattices which are a generalization of frontal operators. We also give conditions for two operations P ( x , y ) and Q ( x , y ) on a residuated lattice L which imply that the function $${x \mapsto min\{y \in L : P(x, y) \leq Q(x, y)\}}$$ when defined, is equational and compatible. Finally we discuss the affine completeness of residuated lattices equipped with some additional operators. (shrink)

This paper studies, by way of an example, the intuitionistic propositional connective * defined in the language of second order propositional logic by. In full topological models * is not generally definable, but over Cantor-space and the reals it can be classically shown that; on the other hand, this is false constructively, i.e. a contradiction with Church's thesis is obtained. This is comparable with some well-known results on the completeness of intuitionistic first-order predicate logic.Over [0, 1], the operator * is (...) (constructively and classically) undefinable. We show how to recast this argument in terms of intuitive intuitionistic validity in some parameter. The undefinability argument essentially uses the connectedness of [0, 1]; most of the work of recasting consists in the choice of a suitable intuitionistically meaningful parameter, so as to imitate the effect of connectedness. (shrink)

It is shown that axiomatic extensions of intuitionistic propositional calculus defining univocally new connectives, including those proposed by Gabbay, are strongly complete with respect to valuations in Heyting algebras with additional operations. In all cases, the double negation of such a connective is equivalent to a formula of intuitionistic calculus. Thus, under the excluded third law it collapses to a classical formula, showing that this condition in Gabbay's definition is redundant. Moreover, such connectives can not be interpreted in all Heyting (...) algebras, unless they are already equivalent to a formula of intuitionistic calculus. These facts relativize to connectives over intermediate logics. In particular, the intermediate logic with values in the chain of length n may be "completed" conservatively by adding a single unary connective, so that the expanded system does not allow further axiomatic extensions by new connectives. (shrink)

In this paper we define an augmentation mHC of the Heyting propositional calculus HC by a modal operator ?. This modalized Heyting calculus mHC is a weakening of the Proof-Intuitionistic Logic KM of Kuznetsov and Muravitsky. In Section 2 we present a short selection of attractive (algebraic, relational, topological and categorical) features of mHC. In Section 3 we establish some close connections between mHC and certain normal extension K4.Grz of the modal system K4. We define a translation of mHC into (...) K4.Grz and prove that this translation is exact, i. e. theorem-preserving and deducibility-invariant. We have established (however, in this note we do not present a proof of this) that the lattice of all extensions of mHC is isomorphic to the lattice of normal extensions of K4.Grz (a generalization of the Kuznetsov and Muravitsky theorem). (shrink)

In this paper we introduce and study a variety of algebras that properly includes integral distributive commutative residuated lattices and weak Heyting algebras. Our main goal is to give a characterization of the principal congruences in this variety. We apply this description in order to study compatible functions.

Intuitionistic modal logics are extensions of intuitionistic propositional logic with modal axioms. We treat with two modal languages ${\mathscr{L}}_\Diamond $ and $\mathscr{L}_{\Diamond,\Box }$ which extend the intuitionistic propositional language with $\Diamond $ and $\Diamond,\Box $, respectively. Gentzen sequent calculi are established for several intuitionistic modal logics. In particular, we introduce a Gentzen sequent calculus for the well-known intuitionistic modal logic $\textsf{MIPC}$. These sequent calculi admit cut elimination and subformula property. They are decidable.

We study some operations that may be defined using the minimum operator in the context of a Heyting algebra. Our motivation comes from the fact that 1) already known compatible operations, such as the successor by Kuznetsov, the minimum dense by Smetanich and the operation G by Gabbay may be defined in this way, though almost never explicitly noted in the literature; 2) defining operations in this way is equivalent, from a logical point of view, to two clauses, one corresponding (...) to an introduction rule and the other to an elimination rule, thus providing a manageable way to deal with these operations. Our main result is negative: all operations that arise turn out to be Heyting terms or the mentioned already known operations or operations interdefinable with them. However, it should be noted that some of the operations that arise may exist even if the known operations do not. We also study the extension of Priestley duality to Heyting algebras enriched with the new operations. (shrink)

We pay attention to the concept of univocal connective. Considering the corresponding definition in the context of the sequent calculus a problem arises in a paper by Belnap. We provide an explanation by Belnap and finally give some examples and non-examples of univocal connectives.