This paper presents two classes of propositional logics (understood as a consequence relation). First we generalize the well-known class of implicative logics of Rasiowa and introduce the class of weakly implicative logics. This class is broad enough to contain many “usual” logics, yet easily manageable with nice logical properties. Then we introduce its subclass–the class of weakly implicative fuzzy logics. It contains the majority of logics studied in the literature under the name fuzzy logic. We present many general theorems for (...) both classes, demonstrating their usefulness and importance. (shrink)
Dave Ripley has recently argued against the plausibility of multiset consequence relations and of contraction-free approaches to paradox. For Ripley, who endorses a nontransitive theory, the best arguments that buttress transitivity also push for contraction—whence it is wiser for the substructural logician to go nontransitive from the start. One of Ripley’s allegations is especially insidious, since it assumes the form of a trivialisation result: it is shown that if a multiset consequence relation can be associated to a closure operator in (...) the expected way, then it necessarily contracts. We counter Ripley’s objection by presenting an approach to multiset consequence that escapes this trap. This approach is multiple-conclusioned in a heterodox way, for multiple succedents are given a conjunctive, rather than a disjunctive reading. Finally, we address a further objection by French and Ripley to the effect that the informational interpretation of sequents in linear logic does not motivate cut. (shrink)
This paper is a contribution to Mathematical fuzzy logic, in particular to the algebraic study of t-norm based fuzzy logics. In the general framework of propositional core and Δ-core fuzzy logics we consider three properties of completeness with respect to any semantics of linearly ordered algebras. Useful algebraic characterizations of these completeness properties are obtained and their relations are studied. Moreover, we concentrate on five kinds of distinguished semantics for these logics–namely the class of algebras defined over the real unit (...) interval, the rational unit interval, the hyperreals , the strict hyperreals and finite chains, respectively–and we survey the known completeness methods and results for prominent logics. We also obtain new interesting relations between the real, rational and hyperreal semantics, and good characterizations for the completeness with respect to the semantics of finite chains. Finally, all completeness properties and distinguished semantics are also considered for the first-order versions of the logics where a number of new results are proved. (shrink)
Uniform infinite bases are defined for the single-conclusion and multiple-conclusion admissible rules of the implication–negation fragments of intuitionistic logic and its consistent axiomatic extensions . A Kripke semantics characterization is given for the structurally complete implication–negation fragments of intermediate logics, and it is shown that the admissible rules of this fragment of form a PSPACE-complete set and have no finite basis.
In the last few decades many formal systems of fuzzy logics have been developed. Since the main differences between fuzzy and classical logics lie at the propositional level, the fuzzy predicate logics have developed more slowly (compared to the propositional ones). In this text we aim to promote interest in fuzzy predicate logics by contributing to the model theory of fuzzy predicate logics. First, we generalize the completeness theorem, then we use it to get results on conservative extensions of theories (...) and on witnessed models. (shrink)
This paper is a contribution to the study of the rôle of disjunction inAlgebraic Logic. Several kinds of (generalized) disjunctions, usually defined using a suitable variant of the proof by cases property, were introduced and extensively studied in the literature mainly in the context of finitary logics. The goals of this paper are to extend these results to all logics, to systematize the multitude of notions of disjunction (both those already considered in the literature and those introduced in this paper), (...) and to show several interesting applications allowed by the presence of a suitable disjunction in a given logic. (shrink)
In abstract algebraic logic, the general study of propositional non-classical logics has been traditionally based on the abstraction of the Lindenbaum-Tarski process. In this process one considers the Leibniz relation of indiscernible formulae. Such approach has resulted in a classification of logics partly based on generalizations of equivalence connectives: the Leibniz hierarchy. This paper performs an analogous abstract study of non-classical logics based on the kind of generalized implication connectives they possess. It yields a new classification of logics expanding Leibniz (...) hierarchy: the hierarchy of implicational logics. In this framework the notion of implicational semilinear logic can be naturally introduced as a property of the implication, namely a logic L is an implicational semilinear logic iff it has an implication such that L is complete w.r.t. the matrices where the implication induces a linear order, a property which is typically satisfied by well-known systems of fuzzy logic. The hierarchy of implicational logics is then restricted to the semilinear case obtaining a classification of implicational semilinear logics that encompasses almost all the known examples of fuzzy logics and suggests new directions for research in the field. (shrink)
Structural completeness properties are investigated for a range of popular t-norm based fuzzy logics—including Łukasiewicz Logic, Gödel Logic, Product Logic, and Hájek's Basic Logic—and their fragments. General methods are defined and used to establish these properties or exhibit their failure, solving a number of open problems.
Łu logic plays a fundamental role among many-valued logics. However, the expressive power of this logic is restricted to piecewise linear functions. In this paper we enrich the language of Łu logic by adding a new connective which expresses multiplication. The resulting logic, PŁ, is defined, developed, and put into the context of other well-known many-valued logics. We also deal with several extensions of this propositional logic. A predicate version of PŁ logic is introduced and developed too.
This is the continuation of the paper :417–446, 2010). We continue the abstract study of non-classical logics based on the kind of generalized implication connectives they possess and we focus on semilinear logics, i.e. those that are complete with respect to the class of models where the implication defines a linear order. We obtain general characterizations of semilinearity in terms of the intersection-prime extension property, the syntactical semilinearity metarule and the class of finitely subdirectly irreducible models. Moreover, we consider extensions (...) of the language with lattice connectives and generalized disjunctions, study their interplay with implication and obtain axiomatizations and further descriptions of semilinear logics in terms of disjunctions and the proof by cases property. (shrink)
This paper presents an abstract study of completeness properties of non-classical logics with respect to matricial semantics. Given a class of reduced matrix models we define three completeness properties of increasing strength and characterize them in several useful ways. Some of these characterizations hold in absolute generality and others are for logics with generalized implication or disjunction connectives, as considered in the previous papers. Finally, we consider completeness with respect to matrices with a linear dense order and characterize it in (...) terms of an extension property and a syntactical metarule. This is the final part of the investigation started and developed in the papers :417–446, 2010; Arch Math Logic 53:353–372, 2016). (shrink)
Substructural logics extending the full Lambek calculus FL have largely benefited from a systematical algebraic approach based on the study of their algebraic counterparts: residuated lattices. Recently, a nonassociative generalization of FL has been studied by Galatos and Ono as the logic of lattice-ordered residuated unital groupoids. This paper is based on an alternative Hilbert-style presentation for SL which is almost MP -based. This presentation is then used to obtain, in a uniform way applicable to most substructural logics, a form (...) of local deduction theorem, description of filter generation, and proper forms of generalized disjunctions. A special stress is put on semilinear substructural logics. Axiomatizations of the weakest semilinear logic over SL and other prominent substructural logics are provided and their completeness with respect to chains defined over the real unit interval is proved. (shrink)
This paper is a contribution to the general study of consequence relations which contain (definable) connective of “disjunction”. Our work is centered around the “proof by cases property”, we present several of its equivalent definitions, and show some interesting applications, namely in constructing axiomatic systems for intersections of logics and recognizing weakly implicative fuzzy logics among the weakly implicative ones.
Formal systems of fuzzy logic are well-established logical systems and respected members of the broad family of the so-called substructural logics closely related to the famous logic BCK. The study of fragments of logical systems is an important issue of research in any class of non-classical logics. Here we study the fragments of nine prominent fuzzy logics to all sublanguages containing implication. However, the results achieved in the paper for those nine logics are usually corollaries of theorems with much wider (...) scope of applicability. In particular, we show how many of these fragments are really distinct and we find axiomatic systems for most of them. In fact, we construct strongly separable axiomatic systems for eight of our nine logics. We also fully answer the question for which of the studied fragments the corresponding class of algebras forms a variety. Finally, we solve the problem how to axiomatize predicate versions of logics without the lattice disjunction. (shrink)
Transfer theorems are central results in abstract algebraic logic that allow to generalize properties of the lattice of theories of a logic to any algebraic model and its lattice of filters. Their proofs sometimes require the existence of a natural extension of the logic to a bigger set of variables. Constructions of such extensions have been proposed in particular settings in the literature. In this paper we show that these constructions need not always work and propose a wider setting in (...) which they can still be used. (shrink)
In this position paper we present a logical framework for modelling reasoning with graded predicates. We distinguish several types of graded predicates and discuss their ubiquity in rational interaction and the logical challenges they pose. We present mathematical fuzzy logic as a set of logical tools that can be used to model reasoning with graded predicates, and discuss a philosophical account of vagueness that makes use of these tools. This approach is then generalized to other kinds of graded predicates. Finally, (...) we propose a general research program towards a logic-based account of reasoning with graded predicates. (shrink)
This paper provides a finer analysis of the well-known form of the Local Deduction Theorem in contraction-free logics . An infinite hierarchy of its natural strengthenings is introduced and studied. The main results are the separation of its initial four members and the subsequent collapse of the hierarchy.
The ŁΠ and logics were introduced by Godo, Esteva and Montagna. These logics extend many other known propositional and predicate logics, including the three mainly investigated ones (Gödel, product and Łukasiewicz logic). The aim of this paper is to show some advances in this field. We will see further reduction of the axiomatic systems for both logics. Then we will see many other logics contained in the ŁΠ family of logics (namely logics induced by the continuous finitely constructed t-norms and (...) Takeuti and Titani's fuzzy predicate logic). (shrink)
In general, there is only one fuzzy logic in which the standard interpretation of the strong conjunction is a strict triangular norm, namely, the product logic. We study several equations which are satisfied by some strict t-norms and their dual t-conorms. Adding an involutive negation, these equations allow us to generate countably many logics based on strict t-norms which are different from the product logic.
In this paper we explore the following question: how weak can a logic be for Rosser's essential undecidability result to be provable for a weak arithmetical theory? It is well known that Robinson's Q is essentially undecidable in intuitionistic logic, and P. Hajek proved it in the fuzzy logic BL for Grzegorczyk's variant of Q which interprets the arithmetic operations as non-total non-functional relations. We present a proof of essential undecidability in a much weaker substructural logic and for a much (...) weaker arithmetic theory, a version of Robinson's R (with arithmetic operations also interpreted as mere relations). Our result is based on a structural version of the undecidability argument introduced by Kleene and we show that it goes well beyond the scope of the Boolean, intuitionistic, or fuzzy logic. (shrink)
In this paper we explore the following question: how weak can a logic be for Rosser’s essential undecidability result to be provable for a weak arithmetical theory? It is well known that Robinson’s Q is essentially undecidable in intuitionistic logic, and P. Hájek proved it in the fuzzy logic BL for Grzegorczyk’s variant of Q which interprets the arithmetic operations as nontotal nonfunctional relations. We present a proof of essential undecidability in a much weaker substructural logic and for a much (...) weaker arithmetic theory, a version of Robinson’s R (with arithmetic operations also interpreted as mere relations). Our result is based on a structural version of the undecidability argument introduced by Kleene and we show that it goes well beyond the scope of the Boolean, intuitionistic, or fuzzy logic. (shrink)
A method is described for obtaining conjunctive normal forms for logics using Gentzen-style rules possessing a special kind of strong invertibility. This method is then applied to a number of prominent fuzzy logics using hypersequent rules adapted from calculi defined in the literature. In particular, a normal form with simple McNaughton functions as literals is generated for łukasiewicz logic, and normal forms with simple implicational formulas as literals are obtained for Gödel logic, Product logic, and Cancellative hoop logic.
Compactness is an important property of classical propositional logic. It can be defined in two equivalent ways. The first one states that simultaneous satisfiability of an infinite set of formulae is equivalent to the satisfiability of all its finite subsets. The second one states that if a set of formulae entails a formula, then there is a finite subset entailing this formula as well. In propositional many-valued logic, we have different degrees of satisfiability and different possible definitions of entailment, hence (...) the questions of compactness is more complex. In this paper we will deal with compactness of Gödel, GödelΔ, and Gödel∼ logics. (shrink)
Vague language and corresponding models of inference and information processing is an important and challenging topic as witnessed by a number of recent monographs and collections of essays devoted to the topic. This volume collects fifteen papers, the majority of which originated with talks presented at the conference "Logical Models of Reasoning with Vague Information ", September 14-17, 2009, in Čejkovice, that initiated a EUROCORES/LogICCC project with the same title. At least two features set the current volume apart from other (...) texts: first, the interdisciplinary nature of the topic is nicely reflected by the wide range of interests of the authors, who include philosophers, linguists, logicians, as well as mathematicians and computer scientists. Secondly, all the papers are accompanied by comments written by other authors and a few outside experts. These comments and corresponding replies by the authors document the very lively ongoing debate on adequate models of vague language. (shrink)