The finite model property for semilinear substructural logics

In this paper, we show that the finite model property fails for certain non‐integral semilinear substructural logics including Metcalfe and Montagna's uninorm logic and involutive uninorm logic, and a suitable extension of Metcalfe, Olivetti and Gabbay's pseudo‐uninorm logic. Algebraically, the results show that certain classes of bounded residuated lattices that are generated as varieties by their linearly ordered members are not generated as varieties by their finite members.     

Idempotent uninorms

Uninorms are an important generalization of t-norms and t-conorms, having a neutral element lying anywhere in the unit interval. Two broad classes of idempotent uninorms are fully characterized: the class of left-continuous ones and the class of right-continuous ones. In particular, the important subclasses of conjunctive left-continuous idempotent uninorms and of disjunctive right-continuous idempotent uninorms are characterized by means of super-involutive and sub-involutive decreasing unary operators. As a consequence, it is shown that any involutive negator gives rise to a conjunctive left-continuous idempotent uninorm and to a disjunctive right-continuous idempotent uninorm.     

Bipolar aggregation using the Uninorms

In bipolar aggregation the total score depends not just on previous score and the value of additional argument but on distribution of all other arguments as well. In addition the process of bipolar aggregation is not Markovian, i.e. aggregation is not associative. To model bipolar aggregation was introduced general R_G^*{R_{G}^\ast} aggregation based on uninorms. By discarding associativity we built a variation of the uninorm using generating functions that can be applied as an intuitively appealing bipolar aggregation operator. This modified uninorm operator will allow us to control the aggregation depending on distribution of the arguments above and below the neutral element: the closer proportion of arguments below the neutral value to 1 or to 0 the closer bipolar aggregation is to some t-norm or t-conorm with desirable properties.     

Densification of FL chains via residuated frames

We introduce a systematic method for densification, i.e., embedding a given chain into a dense one preserving certain identities, in the framework of FL algebras (pointed residuated lattices). Our method, based on residuated frames, offers a uniform proof for many of the known densification and standard completeness results in the literature. We propose a syntactic criterion for densification, called semianchoredness. We then prove that the semilinear varieties of integral FL algebras defined by semi-anchored equations admit densification, so that the corresponding fuzzy logics are standard complete. Our method also applies to (possibly non-integral) commutative FL chains. We prove that the semilinear varieties of commutative FL algebras defined by knotted axioms \({x^{m} \leq x^{n}}\) (with \({m, n > 1}\)) admit densification. This provides a purely algebraic proof to the standard completeness of uninorm logic as well as its extensions by knotted axioms.     

模态条件方程的一类新解

研究了仅涉及幂等uninorm和t-operator的模态条件方程的解．证明了如下三种情况：(i)一个t-operator与一个幂等uninorm是模态的当且仅当存在唯一新的非平凡解；(ii)一个幂等uninorm与一个t-operator是模态的也当且仅当存在唯一新的非平凡解；(iii)给出了两个幂等uninorm满足模态条件方程的充要条件．     

Recovering a Logic from Its Fragments by Meta-Fibring

In this paper we address the question of recovering a logic system by combining two or more fragments of it. We show that, in general, by fibring two or more fragments of a given logic the resulting logic is weaker than the original one, because some meta-properties of the connectives are lost after the combination process. In order to overcome this problem, the categories Mcon and Seq of multiple-conclusion consequence relations and sequent calculi, respectively, are introduced. The main feature of these categories is the preservation, by morphisms, of meta-properties of the consequence relations, which allows, in several cases, to recover a logic by fibring of its fragments. The fibring in this categories is called meta−fibring. Several examples of well-known logics which can be recovered by meta-fibring its fragments (in opposition to fibring in the usual categories) are given. Finally, a general semantics for objects in Seq (and, in particular, for objects in Mcon) is proposed, obtaining a category of logic systems called Log. A general theorem of preservation of completeness by fibring in Log is also obtained.     

Densification via polynomials,languages, and frames

It is known that every countable totally ordered set can be embedded into a countable dense one. We extend this result to totally ordered commutative monoids and to totally ordered commutative residuated lattices (the latter result fails in the absence of commutativity). The latter has applications to density elimination of semilinear substructural logics. In particular we obtain as a corollary a purely algebraic proof of the standard completeness of uninorm logic; the advantage over the known proof-theoretic proof and the semantical proof is that it is extremely short and transparent and all details can be verified easily using standard algebraic constructions.     

On the predicate logics of continuous t-norm BL-algebras

Given a class C of t-norm BL-algebras, one may wonder which is the complexity of the set Taut(C) of predicate formulas which are valid in any algebra in C. We first characterize the classes C for which Taut(C) is recursively axiomatizable, and we show that this is the case iff C only consists of the Gödel algebra on [0,1]. We then prove that in all cases except from a finite number Taut(C) is not even arithmetical. Finally we consider predicate monadic logics Taut_M(C) of classes C of t-norm BL-algebras, and we prove that (possibly with finitely many exceptions) they are undecidable.Mathematics Subject Classification (2000): Primary: 03B50, Secondary: 03B47Acknowledgement The author is deeply indebted to Petr Hájek, whose results about the complexity problems of predicate fuzzy logics constitute the main motivation for this paper, and whose suggestions and remarks have been always stimulating. He is also indebted to Matthias Baaz, who pointed out to him a method used in [BCF] for the case of monadic Gödel logic which works with some modifications also in the case of monadic BL logic.     

Sémantique algébrique ďun système logique basé sur un ensemble ordonné fini

In order to modelize the reasoning of an intelligent agent represented by a poset T, H. Rasiowa introduced logic systems called “Approximation Logics”. In these systems a set of constants constitutes a fundamental tool. In this papers, we consider logic systems called L′_T without this kind of constants but limited to the case where T is a finite poset. We prove a weak deduction theorem. We introduce also an algebraic semantics using Hey ting algebra with operators. To prove the completeness theorem of the L′_T system with respect to the algebraic semantics, we use the method of H. Rasiowa and R. Sikorski for first order logic. In the propositional case, a corollary allows us to assert that it is decidable to know “if a propositional formula is valid”. We study also certain relations between the L′_T logic and the intuitionistic and classical logics.     

Loop-free calculus for modal logic S4. II

In [J. Andrikonis, Loop-free calculus for modal logic S4. I, Lith. Math. J., 52(1):1–12, 2012], loop-free calculus for modal logic S4 is presented. The calculus uses several types of indexes to avoid loops and obtain termination of derivation search. Although the mentioned article proves that derivation search in the calculus is finite, the proof of soundness and completeness is omitted and, therefore, is presented in this paper. Moreover, this paper presents loop-free calculus for modal logics K4, which is obtained by modifying the calculus for S4. Finally, some remarks for programming the given calculi are offered.     

Sequent calculi for branching time temporal logics of knowledge and beliefwith awareness: Completeness and decidability

In this paper, we consider branching time temporal logic CT L with epistemic modalities for knowledge (belief) and with awareness operators. These logics involve the discrete-time linear temporal logic operators “next” and “until” with the branching temporal logic operator “on all paths”. In addition, the temporal logic of knowledge (belief) contains an indexed set of unary modal operators “agent i knows” (“agent i believes”). In a language of these logics, there are awareness operators. For these logics, we present sequent calculi with a restricted cut rule. Thus, we get proof systems where proof-search becomes decidable. The soundness and completeness for these calculi are proved. Published in Lietuvos Matematikos Rinkinys, Vol. 47, No. 3, pp. 328–340, July–September, 2007.     

Strict core fuzzy logics and quasi-witnessed models

In this paper we prove strong completeness of axiomatic extensions of first-order strict core fuzzy logics with the so-called quasi-witnessed axioms with respect to quasi-witnessed models. As a consequence we obtain strong completeness of Product Predicate Logic with respect to quasi-witnessed models, already proven by M.C. Laskowski and S. Malekpour in [19]. Finally we study similar problems for expansions with ??, define ??-quasi-witnessed axioms and prove that any axiomatic extension of a first-order strict core fuzzy logic, expanded with ??, and ??-quasi-witnessed axioms are complete with respect to ??-quasi-witnessed models.     

The Disjunction Property in the Class of Paraconsistent Extensions of Minimal Logic

We consider the disjunction property, DP, in the class of extensions of minimal logic L _j . Conditions are described under which DP is translated from the class PAR of properly paraconsistent extensions of the logics of class L _j into the class INT of intermediate extensions and the class NEG of negative extensions, and conditions for its being translated back into PAR. The logic L _F in PAR, which specifies conditions for DP to be translated from PAR into NEG, is defined and is characterized in terms of j-algebras and Kripke frames. Moreover, we show that L _F is decidable and possesses the disjunction property.     

Properties of convergence for -Bernstein polynomials

In this paper, we discuss properties of the ω,q-Bernstein polynomials introduced by S. Lewanowicz and P. Woźny in [S. Lewanowicz, P. Woźny, Generalized Bernstein polynomials, BIT 44 (1) (2004) 63–78], where fC[0,1], ω,q>0, ω≠1,q⁻¹,…,q⁻ⁿ⁺¹. When ω=0, we recover the q-Bernstein polynomials introduced by [G.M. Phillips, Bernstein polynomials based on the q-integers, Ann. Numer. Math. 4 (1997) 511–518]; when q=1, we recover the classical Bernstein polynomials. We compute the second moment of , and demonstrate that if f is convex and ω,q(0,1) or (1,∞), then are monotonically decreasing in n for all x[0,1]. We prove that for ω(0,1), q_n(0,1], the sequence converges to f uniformly on [0,1] for each fC[0,1] if and only if lim_n→∞q_n=1. For fixed ω,q(0,1), we prove that the sequence converges for each fC[0,1] and obtain the estimates for the rate of convergence of by the modulus of continuity of f, and the estimates are sharp in the sense of order for Lipschitz continuous functions.     

RU and (U,N)-implications satisfying Modus Ponens

In this paper it is investigated when some kinds of fuzzy implication functions derived from uninorms satisfy the Modus Ponens with respect to a continuous t-norm T, or equivalently, when they are T-conditionals. The study is done for RU-implications and $(U,N)$-implications with N a continuous fuzzy negation leading to a lot of solutions in both cases. For RU-implications T-conditionality only depends on the underlying t-norm of the uninorm used to derive the residual implication. On the contrary, for $(U,N)$-implications the underlying t-norm is never relevant and only the region out of the t-norm is so. Even the t-conorm can be not relevant also in some cases.     

Sémantique de type Kripke d'un système logique basé sur un ensemble ordonné fini

In order to modelize the reasoning of intelligent agents represented by a poset T, H. Rasiowa introduced logic systems called “Approximation Logics”. In these systems the use of a set of constants constitutes a fundamental tool. We have introduced in [8] a logic system called without this kind of constants but limited to the case that T is a finite poset. We have proved a completeness result for this system w.r.t. an algebraic semantics. We introduce in this paper a Kripke‐style semantics for a subsystem of for which there existes a deduction theorem. The set of “possible worldsr is enriched by a family of functions indexed by the elements of T and satisfying some conditions. We prove a completeness result for system with respect to this Kripke semantics and define a finite Kripke structure that characterizes the propositional fragment of logic . We introduce a reational semantics (found by E. Orlowska) which has the advantage to allow an interpretation of the propositionnal logic using only binary relations. We treat also the computational complexity of the satisfiability problem of the propositional fragment of logic .     

ANALYTIC COMPLETENESS THEOREM FOR ABSOLUTELY CONTINUOUS BIPROBABILITY MODELS

Hoover [2] proved a completeness theorem for the logic L(∫)??. The aim of this paper is to prove a similar completeness theorem with respect to product measurable biprobability models for a logic L(∫₁, ∫₂) with two integral operators. We prove: If T is a ∑₁ definable theory on ?? (a countable admissible set and ω ∈) and consistent with the axioms of L(∫₁, ∫₂), then there is an analytic absolutely continuous biprobability model in which every sentence in T is satified.     

Analytic Calculi for Product Logics

Product logic is an important t-norm based fuzzy logic with conjunction interpreted as multiplication on the real unit interval [0,1], while Cancellative hoop logic CHL is a related logic with connectives interpreted as for but on the real unit interval with 0 removed (0,1]. Here we present several analytic proof systems for and CHL, including hypersequent calculi, co-NP labelled calculi and sequent calculi.     

Separability of normalizable superintuitionistic propositional logics

The problem of separability of superintuitionistic propositional logics that are extensions of the intuitionistic propositional logic is studied. A criterion of separability of normal superintuitionistic propositional logics, as well as results concerning the completeness of their subcalculi is obtained. This criterion makes it possible to determine whether a normalizable superintuitionistic propositional logic is separable. By means of these results, the mistakes discovered by the author in the proofs of certain statements by McKay and Hosoi are corrected.Translated fromMatematicheskie Zametki, Vol. 64, No. 4, pp. 606–615, October, 1998.This research was supported by the Russian Foundation for Basic Research under grant No. 94-01-00944.