A new characterization of all the MV-algebras embedded in a CL-algebra has been presented. A new sequent calculus for Lukasiewicz ℵ0-valued logic is introduced. Some links between this calculus and the sequent calculus for multiplicative additive linear logic are established. It has been shown that Lukasiewicz ℵ0-valued logic can be embedded in a suitable extension of MALL.

The infinite-valued logic of ukasiewicz was originally defined by means of an infinite-valued matrix. ukasiewicz took special forms of negation and implication as basic connectives and proposed an axiom system that he conjectured would be sufficient to derive the valid formulas of the logic; this was eventually verified by M. Wajsberg. The algebraic counterparts of this logic have become know as Wajsberg algebras. In this paper we show that a Wajsberg algebra is complete and atomic (as a lattice) if (...) and only if it is a direct product of finite Wajsberg chains. The classical characterization of complete and atomic Boolean algebras as fields of sets is a particular case of this result. (shrink)

This paper explores the modal interpretation of ?ukasiewicz's n -truth-values, his conditional and the puzzles they generate by exploring his suggestion that by ?necessity? he intends the concept used in traditional philosophy. Scalar adjectives form families with nested extensions over the left and right fields of an ordering relation described by an associated comparative adjective. Associated is a privative negation that reverses the ?rank? of a predicate within the field. If the scalar semantics is interpreted over a totally ordered domain (...) of cardinality n and metric ?, an n-valued Lukasiewicz algebra is definable. Privation is analysed in terms of non-scalar adjectives. Any Boolean algebra of 2 n ?properties? determines an n + 1 valued Lukasiewicz algebra. The Neoplatonic ?hierarchy of Being? is essentially the order presupposed by natural language modal scalars. ?ukasiewicz's ≈ is privative negation, and ? proves to stand for the extensional (antitonic) dual if ? then for scalar adjectives, especially modals. Relations to product logics and frequency interpretations of probability are sketched. (shrink)

Is there any link between the doctrine of logical fatalism and prime numbers? What do logic and prime numbers have in common? The book adopts truth-functional approach to examine functional properties of finite-valued Łukasiewicz logics Łn+1. Prime numbers are defined in algebraic-logical terms and represented as rooted trees. The author designs an algorithm which for every prime number n constructs a rooted tree where nodes are natural numbers and n is a root. Finite-valued logics Kn+1 are specified that (...) they have tautologies if and only if n is a prime number. It is discovered that Kn+1 have the same functional properties as Łn+1 whenever n is a prime number. Thus, Kn+1 are 'logics' of prime numbers. Amazingly, combination of logics of prime numbers led to uncovering a law of generation of classes of prime numbers. Along with characterization of prime numbers author also gives characterization, in terms of Łukasiewicz logical matrices, of powers of primes, odd numbers, and even numbers. (shrink)

In a recent issue of this Bulletin, S. Meskhi cites 7 additional conditions for Heyting algebras with involution and linearly ordered matrix [10, p. 11]. In [2], R. Cignoli indicates 3 additional conditions for P-algebras [5] with normal involution [9]. The equivalence of these conditions is shown.

We study probabilistic logic under the viewpoint of the coherence principle of de Finetti. In detail, we explore how probabilistic reasoning under coherence is related to model- theoretic probabilistic reasoning and to default reasoning in System . In particular, we show that the notions of g-coherence and of g-coherent entailment can be expressed by combining notions in model-theoretic probabilistic logic with concepts from default reasoning. Moreover, we show that probabilistic reasoning under coherence is a generalization of default reasoning in System (...) . That is, we provide a new probabilistic semantics for System , which neither uses infinitesimal probabilities nor atomic bound (or big-stepped) probabilities. These results also provide new algorithms for probabilistic reasoning under coherence and for default reasoning in System , and they give new insight into default reasoning with conditional objects. (shrink)

We present new probabilistic generalizations of Pearl’s entailment in System Z and Lehmann’s lexicographic entailment, called Zλ- and lexλ-entailment, which are parameterized through a value λ ∈ [0,1] that describes the strength of the inheritance of purely probabilistic knowledge. In the special cases of λ = 0 and λ = 1, the notions of Zλ- and lexλ-entailment coincide with probabilistic generalizations of Pearl’s entailment in System Z and Lehmann’s lexicographic entailment that have been recently introduced by the author. We show (...) that the notions of Zλ- and lexλ-entailment have similar properties as their classical counterparts. In particular, they both satisfy the rationality postulates of System P and the property of Rational Monotonicity. Moreover, Zλ-entailment is weaker than lexλ-entailment, and both Zλ- and lexλ-entailment are proper generalizations of their classical counterparts. (shrink)

Professor Merrie Bergmann presents an accessible introduction to the subject of many-valued and fuzzy logic designed for use on undergraduate and graduate courses in non-classical logic. Bergmann discusses the philosophical issues that give rise to fuzzy logic - problems arising from vague language - and returns to those issues as logical systems are presented. For historical and pedagogical reasons, three-valued logical systems are presented as useful intermediate systems for studying the principles and theory behind fuzzy logic. The major fuzzy logical (...) systems - Lukasiewicz, Gödel, and product logics - are then presented as generalisations of three-valued systems that successfully address the problems of vagueness. A clear presentation of technical concepts, this book includes exercises throughout the text that pose straightforward problems, that ask students to continue proofs begun in the text, and that engage students in the comparison of logical systems. (shrink)

We propose a combination of probabilistic reasoning from conditional constraints with approaches to default reasoning from conditional knowledge bases. In detail, we generalize the notions of Pearl's entailment in system Z, Lehmann's lexicographic entailment, and Geffner's conditional entailment to conditional constraints. We give some examples that show that the new notions of z-, lexicographic, and conditional entailment have similar properties like their classical counterparts. Moreover, we show that the new notions of z-, lexicographic, and conditional entailment are proper generalizations of (...) both their classical counterparts and the classical notion of logical entailment for conditional constraints. (shrink)

The equivalence connective in ukasiewicz logic has its algebraic counterpart which is the distance function d(x,y) =|x–y| of a positive cone of a commutative -group. We make some observations on logically motivated algebraic structures involving the distance function.

This paper is concerned with decision proceedures for the 0-valued ukasiewicz logics,. It is shown how linear algebra can be used to construct an automated theorem checker. Two decision proceedures are described which depend on a linear programming package. An algorithm is given for the verification of consequence relations in, and a connection is made between theorem checking in two-valued logic and theorem checking in which implies that determing of a -free formula whether it takes the value one is (...) NP-complete problem. (shrink)

The ability to conduct logical reasoning is a fundamental aspect of intelligent behavior, and thus an important problem along the way to human-level artificial intelligence. Traditionally, symbolic methods from the field of knowledge representation and reasoning have been used to equip agents with capabilities that resemble human reasoning qualities. More recently, however, there has been an increasing interest in applying alternative approaches based on machine learning rather than logic-based formalisms to tackle this kind of tasks. Here, we make use of (...) state-of-the-art methods for training deep neural networks to devise a novel model that is closely coupled to symbolic reasoning methods, and thus able to learn how to effectively perform basic ontology reasoning. This term describes an important and at the same time very natural kind of problem settings where the rules for conducting reasoning are specified alongside with the actual information. Many problems in practice may be viewed as such reasoning tasks, which is why the presented approach is applicable to a plethora of important real-world problems. To demonstrate the effectiveness of the suggested method, we present the outcomes of several experiments that have been conducted on both toy datasets as well as real-world data, which show that our model learned to perform precise reasoning on a number of diverse inference tasks that require comprehensive deductive proficiencies. Furthermore, it turned out that the suggested model suffers much less from different obstacles that prohibit symbolic reasoning. (shrink)

The ability to conduct logical reasoning is a fundamental aspect of intelligent behavior, and thus an important problem along the way to human-level artificial intelligence. Traditionally, symbolic methods from the field of knowledge representation and reasoning have been used to equip agents with capabilities that resemble human reasoning qualities. More recently, however, there has been an increasing interest in applying alternative approaches based on machine learning rather than logic-based formalisms to tackle this kind of tasks. Here, we make use of (...) state-of-the-art methods for training deep neural networks to devise a novel model that is closely coupled to symbolic reasoning methods, and thus able to learn how to effectively perform basic ontology reasoning. This term describes an important and at the same time very natural kind of problem settings where the rules for conducting reasoning are specified alongside with the actual information. Many problems in practice may be viewed as such reasoning tasks, which is why the presented approach is applicable to a plethora of important real-world problems. To demonstrate the effectiveness of the suggested method, we present the outcomes of several experiments that have been conducted on both toy datasets as well as real-world data, which show that our model learned to perform precise reasoning on a number of diverse inference tasks that require comprehensive deductive proficiencies. Furthermore, it turned out that the suggested model suffers much less from different obstacles that prohibit symbolic reasoning. (shrink)

In the discussion at hand I have attempted to pave the way for such a treatment of the principle of contradiction. In a number of respects it seems to me worthwhile to relate my critical exposition to Aristotle's train of thought. Indeed, every critique must be raised against something substantial, otherwise it generally becomes the critic's leisurely game with his own cerebral phantasies. Now Aristotle's intuitions regarding the principle of contradiction are, for the most part and clear down to the (...) present day, the usual and traditional ones; and arguments for and against the principle can be found together in the Stagirite in greater completeness than in any one modern textbook of logic. My investigation will proceed with the Aristotelian text at hand and with regard to the results of symbolic logic. The most important results shall be sketched very briefly in the following. (shrink)

The paper discusses interpretations of Aristotle’s modal notions by modern commentators (J. Hintikka, J. Lukasiewiez, M. Mignucci). It is shown that the semantics of modal notions which the above mentioned authors attribute to Aristotle is based on the algebraic idea of multiplier.

In [9] it is proved the categorical isomorphism of two varieties: bounded commutative BCK-algebras and MV -algebras. The class of MV -algebras is the algebraic counterpart of the infinite valued propositional calculus L of Lukasiewicz . The main objective of the present paper is to study that isomorphism from the perspective of logic. The B-C-K logic is algebraizable and the quasivariety of BCKalgebras is the equivalent algebraic semantics for that logic . We call commutative B-C-K logic, (...) briefly cBCK, to the extension of B-C-K logic associated to the variety of commutative BCK–algebras. Moreover, we present the extension Boc of cBCK obtained by adding the axiom of “boundness”. We prove that the deductive system Boc is equivalent to L. We observe that cBCK admits two interesting extensions: the logic Boc, treated in this paper, which is equivalent to the system L of Lukasiewicz, and the logic Co that is naturally associated to the system Balo of `-groups . This constructions establish a link between L and Balo , that would be a logical approach to the categorical relationship between MV–algebras and `-groups. (shrink)

This work presents the concepts of translation and conservative translation between logics. By using algebraic semantics we introduce several conservative translations involving the classical propositional calculus and the many-valued calculi of Post and Lukasiewicz.

Hoop residuation algebras are the {, 1}-subreducts of hoops; they include Hilbert algebras and the {, 1}-reducts of MV-algebras (also known as Wajsberg algebras). The paper investigates the structure and cardinality of finitely generated free algebras in varieties of k-potent hoop residuation algebras. The assumption of k-potency guarantees local finiteness of the varieties considered. It is shown that the free algebra on n generators in any of these varieties can be represented as a union (...) of n subalgebras, each of which is a copy of the {, 1}-reduct of the same finite MV-algebra, i.e., of the same finite product of linearly ordered (simple) algebras. The cardinality of the product can be determined in principle, and an inclusion-exclusion type argument yields the cardinality of the free algebra. The methods are illustrated by applying them to various cases, both known (varieties generated by a finite linearly ordered Hilbert algebra) and new (residuation reducts of MV-algebras and of hoops). (shrink)

ukasiewicz''s four-valued modal logic is surveyed and analyzed, together with ukasiewicz''s motivations to develop it. A faithful interpretation of it in classical (non-modal) two-valued logic is presented, and some consequences are drawn concerning its classification and its algebraic behaviour. Some counter-intuitive aspects of this logic are discussed in the light of the presented results, ukasiewicz''s own texts, and related literature.

Duality in Logic and Language [draft--do not cite this article] Duality phenomena occur in nearly all mathematically formalized disciplines, such as algebra, geometry, logic and natural language semantics. However, many of these disciplines use the term ‘duality’ in vastly different senses, and while some of these senses are intimately connected to each other, others seem to be entirely … Continue reading Duality in Logic and Language →.

This paper contains a joint study of two sentential logics that combine a many-valued character, namely tetravalence, with a modal character; one of them is normal and the other one quasinormal. The method is to study their algebraic counterparts and their abstract models with the tools of Abstract Algebraic Logic, and particularly with those of Brown and Suszko's theory of abstract logics as recently developed by Font and Jansana in their "A General Algebraic Semantics for Sentential Logics". (...) The logics studied here arise from the algebraic and lattice-theoretical properties we review of Tetravalent Modal Algebras, a class of algebras studied mainly by Loureiro, and also by Figallo, Landini and Ziliani, at the suggestion of the late Antonio Monteiro. (shrink)

We study a generalization of the standard syntax and game-theoretic semantics of logic, which is based on a duality between two players, to a multiplayer setting. We define propositional and modal languages of multiplayer formulas, and provide them with a semantics involving a multiplayer game. Our focus is on the notion of equivalence between two formulas, which is defined by saying that two formulas are equivalent if under each valuation, the set of players with a winning strategy is the same (...) in the two respective associated games. We provide a derivation system which enumerates the pairs of equivalent formulas, both in the propositional case and in the modal case. Our approach is algebraic: We introduce multiplayer algebras as the analogue of Boolean algebras, and show, as the corresponding analog to Stone’s theorem, that these abstract multiplayer algebras can be represented as concrete ones which capture the game-theoretic semantics. For the modal case we prove a similar result. We also address the computational complexity of the problem whether two given multiplayer formulas are equivalent. In the propositional case, we show that this problem is co-NP-complete, whereas in the modal case, it is PSPACE-hard. (shrink)

IMTL logic was introduced in [12] as a generalization of the infinitely-valued logic of Lukasiewicz, and in [11] it was proved to be the logic of left-continuous t-norms with an involutive negation and their residua. The structure of such t-norms is still not known. Nevertheless, Jenei introduced in [20] a new way to obtain rotation-invariant semigroups and, in particular, IMTL-algebras and left-continuous t-norm with an involutive negation, by means of the disconnected rotation method. In order to give an (...) algebraic interpretation to this construction, we generalize the concepts of perfect, bipartite and local algebra used in the classification of MV-algebras to the wider variety of IMTL-algebras and we prove that perfect algebras are exactly those algebras obtained from a prelinear semihoop by Jenei's disconnected rotation. We also prove that the variety generated by all perfect IMTL-algebras is the variety of the IMTL-algebras that are bipartite by every maximal filter and we give equational axiomatizations for it. (shrink)

Abstract.This paper is devoted to a logical and algebraic treatment of conditional probability. The main ideas are the use of non-standard probabilities and of some kind of standard part function in order to deal with the case where the conditioning event has probability zero, and the use of a many-valued modal logic in order to deal probability of an event φ as the truth value of the sentence φ is probable, along the lines of Hájek’s book [H98] and of [EGH96]. (...) To this purpose, we introduce a probabilistic many-valued logic, called FP(SŁΠ), which is sound and complete with respect a class of structures having a non-standard extension [0,1]⋆ of [0,1] as set of truth values. We also prove that the coherence of an assessment of conditional probabilities is equivalent to the coherence of a suitably defined theory over FP(SŁΠ) whose proper axioms reflect the assessment itself. (shrink)

In this paper we shall give a characterization of D-algebras in terms of lattice ordered abelian groups. To make this paper self-contained we shall recall some notations from [4]. The symbols !; ^; _; serve as implication, conjunction, disjunction, and negation, respectively. By D we mean a set of connectives from the list above containing the implication connective !. By a D-formula we mean a formula built up in a usual way from an innite set of the propositional variables (...) and connectives from D. (shrink)

This volume presents the proceedings from the Eleventh Brazilian Logic Conference on Mathematical Logic held by the Brazilian Logic Society in Salvador, Bahia, Brazil. The conference and the volume are dedicated to the memory of professor Mario Tourasse Teixeira, an educator and researcher who contributed to the formation of several generations of Brazilian logicians. Contributions were made from leading Brazilian logicians and their Latin-American and European colleagues. All papers were selected by a careful refereeing processs and were revised and updated (...) by their authors for publication in this volume. There are three sections: Advances in Logic, Advances in Theoretical Computer Science, and Advances in Philosophical Logic. Well-known specialists present original research on several aspects of model theory, proof theory, algebraic logic, category theory, connections between logic and computer science, and topics of philosophical logic of current interest. Topics interweave proof-theoretical, semantical, foundational, and philosophical aspects with algorithmic and algebraic views, offering lively high-level research results. (shrink)

This is a short introduction to a special issue of the Journal on Logic, Language and Information, dealing with "recent advances in logical and algebraic approaches to computational linguistics".

(2) VoL ll3, l979 PROPERTIES OF SOME SUBSYSTEMS OF CLASSICAL AND INTUITIONISTIC PROPOSITIONAL CALCULI* MI SEMENENKO Preface In both classical and ...

This work presents some basic results on a theory of translations between logics and a short revision about Łukasiewicz's logics. Then, it is shown, using facts about algebraic semantics, that there is a conservative translation from every finite Łukasiewicz's logic into classical logic. However, this is not a constructive result.

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.

In this work we study the decidability of a class of global modal logics arising from Kripke frames evaluated over certain residuated lattices, known in the literature as modal many-valued logics. We exhibit a large family of these modal logics which are undecidable, in contrast with classical modal logic and propositional logics defined over the same classes of algebras. This family includes the global modal logics arising from Kripke frames evaluated over the standard Łukasiewicz (...) and Product algebras. We later refine the previous result, and prove that global modal Łukasiewicz and Product logics are not even recursively axiomatizable. We conclude by closing negatively the open question of whether each global modal logic coincides with its local modal logic closed under the unrestricted necessitation rule. (shrink)

This monograph presents a general theory of weakly implicative logics, a family covering a vast number of non-classical logics studied in the literature, concentrating mainly on the abstract study of the relationship between logics and their algebraic semantics. It can also serve as an introduction to algebraic logic, both propositional and first-order, with special attention paid to the role of implication, lattice and residuated connectives, and generalized disjunctions. Based on their recent work, the authors develop a powerful (...) uniform framework for the study of non-classical logics. In a self-contained and didactic style, starting from very elementary notions, they build a general theory with a substantial number of abstract results. The theory is then applied to obtain numerous results for prominent families of logics and their algebraic counterparts, in particular for superintuitionistic, modal, substructural, fuzzy, and relevant logics. The book may be of interest to a wide audience, especially students and scholars in the fields of mathematics, philosophy, computer science, or related areas, looking for an introduction to a general theory of non-classical logics and their algebraic semantics. (shrink)

We prove that algebras of binary relations whose similarity type includes intersection, union, and one of the residuals of relation composition form a nonfinitely axiomatizable quasivariety and that the equational theory is not finitely based. We apply this result to the problem of the completeness of the positive fragment of relevance logic with respect to binary relations.

We present a new notion of game equivalence that captures basic powers of interacting players. We provide a representation theorem, a complete logic, and a new game algebra for basic powers. In doing so, we establish connections with imperfect information games and epistemic logic. We also identify some new open problems concerning logic and games.

We study the general problem of axiomatizing structures in the framework of modal logic and present a uniform method for complete axiomatization of the modal logics determined by a large family of classes of structures of any signature.

We study the general problem of axiomatizing structures in the framework of modal logic and present a uniform method for complete axiomatization of the modal logics determined by a large family of classes of structures of any signature.

In [12] it was shown that the factor semantics based on the notion ofT-F-sequences is a correct model of the ukasiewicz's infinite-valued logics. But we could not consider some important aspects of the structure of this model because of the short size of paper. In this paper we give a more complete study of this problem: A new proof of the completeness of the factor semantic for ukasiewicz's logic using Wajsberg algebras [3] (and not MV-algebras in [1]) (...) and Symmetrical Heyting monoids [7] is proposed. Some consequences of such an approach are investigated. (shrink)

We present a new notion of game equivalence that captures basic powers of interacting players. We provide a representation theorem, a complete logic, and a new game algebra for basic powers. In doing so, we establish connections with imperfect information games and epistemic logic. We also identify some new open problems concerning logic and games.

In this paper we give an axiom system of a logic which we call an approximation logic (AL), whose Lindenbaum-Tarski algebra is a strong Bunge algebra (or simply s-Bunge algebra), and show thatFor every s-Bunge algebra , a quotient algebra by a maximal filter is isomorphic to the simplest nontrivial s-Bunge algebra ;The Lindenbaum algebra of AL is an s-Bunge algebra;AL is complete;AL is decidable.