Bosbach and Riečan states on residuated lattices both are generalizations of probability measures on Boolean algebras. Just from the observation that both of them can be defined by using the canonical structure of the standard MV-algebra on the unit interval [0, 1], generalized Riečan states and two types of generalized Bosbach states on residuated lattices were recently introduced by Georgescu and Mureşan through replacing the standard MV-algebra with arbitrary residuated lattices as codomains. In the present paper, the Glivenko theorem is (...) first extended to residuated lattices with a nucleus, which gives several necessary and sufficient conditions for the underlying nucleus to be a residuated lattice homomorphism. Then it is proved that every generalized Bosbach state (of type I, or of type II) compatible with the nucleus on a nucleus-based-Glivenko residuated lattice is uniquely determined by its restriction on the nucleus image of the underlying residuated lattice, and every relatively generalized Riečan state compatible with the double relative negation on an arbitrary residuated lattice is uniquely determined by its restriction on the double relative negation image of the residuated lattice. Our results indicate that many-valued probability theory compatible with nuclei on residuated lattices reduces in essence to probability theory on algebras of fixpoints of the underlying nuclei. (shrink)

For each continuous t-norm &, a class of fuzzy topological spaces, called &-topological spaces, is introduced. The motivation stems from the idea that to each many-valued logic there may correspond a theory of many-valued topology, in particular, each continuous t-norm may lead to a theory of fuzzy topology. It is shown that for each continuous t-norm &, the subcategory consisting of &-topological spaces is simultaneously reflective and coreflective in the category of fuzzy topological spaces, hence gives rise to an autonomous (...) theory of fuzzy topology. Topologizing a fuzzy pre-ordered set with the fuzzy Scott topology yields a functor from the category of fuzzy pre-ordered sets and maps that preserve suprema of flat ideals to the category of &-topological spaces. It is proved that this functor is a full one if and only if the t-norm & is Archimedean. (shrink)

ABSTRACT The Gödel–Dummett logic and Łukasiewicz one are two main many-valued logics used by the fuzzy logic community. Our goal is a quantitative comparison of these two. In this paper, we will mostly consider the 3-valued Gödel–Dummett logic as well as the 3-valued Łukasiewicz one. We shall concentrate on their implicational-negation fragments which are limited to formulas formed with a fixed finite number of variables. First, we investigate the proportion of the number of true formulas of a certain length n (...) to the number of all formulas of such length built with exactly one variable. Then, we investigate such proportion for satisfiable formulas. Second, we generalise our investigation on formulas written with $ k\ge 1 $ k ≥ 1 variables. The primary goal of the paper is the research on the asymptotic behaviour of these fractions when the length n tends to infinity. If such limits exists, they are real numbers between 0 and 1, which are called the density of truth or the density of SAT. To compare the density of truth and the density of satisfiable formulas for both fragments of 3-valued Gödel–Dummett's and Łukasiewicz's logics we use the powerful theory of analytic combinatorics. This paper is a natural continuation of the previous brief conference note by Kostrzycka and Zaionc (2020) as well as enriched with some previous results from Kostrzycka and Zaionc (2003). In the conference note we computed analytically the density of truth and the density of SAT (with a determined precision) for 3-valued Łukasiewicz's logic restricted to a language with only one variable. In Kostrzycka and Zaionc (2003) we computed the same values for exactly the same fragment of the 3-valued Gödel–Dummett logic. This paper answers the more general questions of the existence of density of truth and density of SAT for both many-valued logics with an arbitrary finite number of variables. Therefore this paper gives an an interesting picture of two main families of finite-valued fuzzy logics problems treated quantitatively. This picture is taken from the perspective of classical logic. It shows that unexpectedly there is quantitatively a little distance between these two approaches. (shrink)

In ${\mathbf{H}}$ , a set theory with the comprehension principle within Łukasiewicz infinite-valued predicate logic, we prove that a statement which can be interpreted as “there is an infinite descending sequence of initial segments of ω” is truth value 1 in any model of ${\mathbf{H}}$ , and we prove an analogy of Hájek’s theorem with a very simple procedure.

This paper deals with one kind of Kripke-style semantics, which we shall call algebraic Kripke-style semantics, for relevance logics. We first recall the logic R of relevant implication and some closely related systems, their corresponding algebraic structures, and algebraic completeness results. We provide simpler algebraic completeness proofs. We then introduce various types of algebraic Kripke-style semantics for these systems and connect them with algebraic semantics.

Jeff Paris proves a generalized Dutch Book theorem. If a belief state is not a generalized probability then one faces ‘sure loss’ books of bets. In Williams I showed that Joyce’s accuracy-domination theorem applies to the same set of generalized probabilities. What is the relationship between these two results? This note shows that both results are easy corollaries of the core result that Paris appeals to in proving his dutch book theorem. We see that every point of accuracy-domination defines a (...) dutch book, but we only have a partial converse. (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.

The article presents several adaptive fuzzy hedge logics. These logics are designed to perform a specific kind of hedge detection. Given a premise set Γ that represents a series of communicated statements, the logics can check whether some predicate occurring in Γ may be interpreted as being (implicitly) hedged by technically, strictly speaking or loosely speaking, or simply non-hedged. The logics take into account both the logical constraints of the premise set as well as conceptual information concerning the meaning of (...) potentially hedged predicates (stored in the memory of the interpreter in question). The proof theory of the logics is non-monotonic in order to enable the logics to deal with possible non-monotonic interpretation dynamics (this is illustrated by means of several concrete proofs). All the adaptive fuzzy hedge logics are also sound and strongly complete with respect to their [0,1]-semantics. (shrink)

Alternative set theory was created by the Czech mathematician Petr Vopěnka in 1979 as an alternative to Cantor’s set theory. Vopěnka criticised Cantor’s approach for its loss of correspondence with the real world. Alternative set theory can be partially axiomatised and regarded as a nonstandard theory of natural numbers. However, its intention is much wider. It attempts to retain a correspondence between mathematical notions and phenomena of the natural world. Through infinity, Vopěnka grasps the phenomena of vagueness. Infinite sets are (...) defined as sets containing proper semisets, i.e. vague parts of sets limited by the horizon. The new interpretation extends the field of applicability of mathematics and simultaneously indicates its limits. Compared to strict finitism and other attempts at a reduction of the infinite to the finite Vopěnka’s theory reverses the process: he models the finite in the infinite. (shrink)

In this paper, we develop a duality for the varieties of a Łukasiewicz n + 1-valued modal System. This duality is an extension of Stone duality for modal algebras. Some logical consequences (such as completeness results, correspondence theory...) are then derived and we propose some ideas for future research.

We investigate the initial segments of the Medvedev lattice as Brouwer algebras, and study the propositional logics connected to them.

From Fine and Kamp in the 70’s—through Osherson and Smith in the 80’s, Williamson, Kamp and Partee in the 90’s and Keefe in the 00’s—up to Sauerland in the present decade, the objection continues to be run that fuzzy logic based theories of vagueness are incompatible with ordinary usage of compound propositions in the presence of borderline cases. These arguments against fuzzy theories have been rebutted several times but evidently not put to rest. I attempt to do so in this (...) paper. (shrink)

Vagueness is one of the most persistent and challenging topics in the intersection of philosophy and logic. At least five other noteworthy books on vagueness have been written by philosophers since 1991 [2, 6, 11, 12, 15]. A (necessarily incomplete) bibliography that has been compiled for the Arché project Vagueness: its Nature and Logic (2004-2006) of the University of St Andrews lists more than 350 articles and books on vagueness until 2005.1 Many new and interesting contributions have appeared since. The (...) book under review is much more than yet another addition to this prolific discourse. Nicholas Smith manages to tackle two different tasks that are potentially in tension. On the one hand, he provides a comprehensive, systematic and well written account of various approaches to vagueness that have been debated so far. On the other hand, Smith carefully explains and defends his own theory of vagueness, called fuzzy plurivaluationism. Given the complex and almost unsurmountably large amount of relevant literature and the fact that theories of vagueness based on fuzzy logic have almost universally been rejected by philosophers so far this is no simple feat. In the comments below, I will largely follow the structure of book. If along the way I cannot resist to make side remarks or even take issue with some of.. (shrink)

In many applications we have a set of objects together with their properties. Since the available information is usually incomplete and/or imprecise, the true knowledge about subsets of objects can be determined approximately only. In this paper, we discuss a fuzzy generalisation of two pairs of relation-based operators suitable for fuzzy set approximations, which have been recently investigated by Düntsch and Gediga. Double residuated lattices, introduced by Orlowska and Radzikowska, are taken as basic algebraic structures. Main properties of these operators (...) are presented. (shrink)

1.1 In standard modal logics, the worlds are 2-valued in the following sense: there are 2 values that a sentence may take at a world. Technically, however, there is no reason why this has to be the case. The worlds could be many-valued. This paper presents one simple approach to a major family of many-valued modal logics, together with an illustration of why this family is philosophically interesting.

We introduce Łukasiewicz-Moisil relation algebras, obtained by considering a relational dimension over Łukasiewicz-Moisil algebras. We prove some arithmetical properties, provide a characterization in terms of complex algebras, study the connection with relational Post algebras and characterize the simple structures and the matrix relation algebras.

ABSTRACTIn this paper, we consider non-associative generalisations of Hájek's logics BL and psBL. As it was shown by Cignoli, Esteva, Godo, and Torrens, the former is the logic of continuous t-norms and their residua. Botur introduced logic naBL which is the logic of non-associative continuous t-norms and their residua. Thus, naBL can be viewed as a non-associative generalisation of BL. However, Botur has not presented axiomatization of naBL. We fill this gap by constructing an adequate Hilbert-style calculus for naBL. Although, (...) as was shown by Flondor, Georgescu, and Iorgulescu, there are no non-commutative continuous t-norms, Hájek's psBL can be viewed as BL's non-commutative generalisation. We present the logic psnaBL of psnaBL-algebras which can be viewed as naBL's non-commutative generalisation as well as psBL's non-associative generalisation and BL's both non-commutative and non-associative generalisation. (shrink)

A logic for classical conditional events was investigated by Dubois and Prade. In their approach, the truth value of a conditional event may be undetermined. In this paper we extend the treatment to many-valued events. Then we support the thesis that probability over partially undetermined events is a conditional probability, and we interpret it in terms of bets in the style of de Finetti. Finally, we show that the whole investigation can be carried out in a logical and algebraic setting, (...) and we find a logical characterization of coherence for assessments of partially undetermined events. (shrink)

In this paper we investigate fuzzy propositional and first order logics which are complete or strongly complete with respect to a single chain, and we relate this properties with the existence of a universal chain for the logic.

We show that for an arbitrary logic being locally tabular is a strictly weaker property than being locally finite. We describe our hunt for a logic that allows us to separate the two properties, revealing weaker and weaker conditions under which they must coincide, and showing how they are intertwined. We single out several classes of logics where the two notions coincide, including logics that are determined by a finite set of finite matrices, selfextensional logics, algebraizable and equivalential logics. Furthermore, (...) we identify a closure property on models of a logic that, in the presence of local tabularity, is equivalent to local finiteness. (shrink)

We investigate the expressivity of many-valued modal logics based on an algebraic structure with a complete linearly ordered lattice reduct. Necessary and sufficient algebraic conditions for admitting a suitable Hennessy–Milner property are established for classes of image-finite and modally saturated models. Full characterizations are obtained for many-valued modal logics based on complete BL-chains that are finite or have the real unit interval [0, 1] as a lattice reduct, including Łukasiewicz, Gödel, and product modal logics.

Mundici has recently established a characterization of free finitely generated MV-algebras similar in spirit to the representation of the free Boolean algebra with a countably infinite set of free generators as any Boolean algebra that is countable and atomless. No reference to universal properties is made in either theorem. Our main result is an extension of Mundici’s theorem to the whole class of MV-algebras that are free over some finite distributive lattice.

We present nested sequent systems for propositional Gödel-Dummett logic and its first-order extensions with non-constant and constant domains, built atop nested calculi for intuitionistic logics. To obtain nested systems for these Gödel-Dummett logics, we introduce a new structural rule, called the linearity rule, which (bottom-up) operates by linearising branching structure in a given nested sequent. In addition, an interesting feature of our calculi is the inclusion of reachability rules, which are special logical rules that operate by propagating data and/or checking (...) if data exists along certain paths within a nested sequent. Such rules require us to generalise our nested sequents to include signatures (i.e. finite collections of variables) in the first-order cases, thus giving rise to a generalisation of the usual nested sequent formalism. Our calculi exhibit favourable properties, admitting the height-preserving invertibility of every logical rule and the (height-preserving) admissibility of a large collection of structural and reachability rules. We prove all of our systems sound and cut-free complete, and show that syntactic cut-elimination obtains for the intuitionistic systems. We conclude the paper by discussing possible extensions and modifications, putting forth an array of structural rules that could be used to provide a sizable class of intermediate logics with cut-free nested sequent systems. (shrink)

This paper continues the investigation, started in Lávička and Noguera : 521–551, 2017), of infinitary propositional logics from the perspective of their algebraic completeness and filter extension properties in abstract algebraic logic. If follows from the Lindenbaum Lemma used in standard proofs of algebraic completeness that, in every finitary logic, intersection-prime theories form a basis of the closure system of all theories. In this article we consider the open problem of whether these properties can be transferred to lattices of filters (...) over arbitrary algebras of the logic. We show that in general the answer is negative, obtaining a richer hierarchy of pairwise different classes of infinitary logics that we separate with natural examples. As by-products we obtain a characterization of subdirect representation for arbitrary logics, develop a fruitful new notion of natural expansion, and contribute to the understanding of semilinear logics. (shrink)

We defend a set of acceptance rules that avoids the lottery paradox, that is closed under classical entailment, and that accepts uncertain propositions without ad hoc restrictions. We show that the rules we recommend provide a semantics that validates exactly Adams’ conditional logic and are exactly the rules that preserve a natural, logical structure over probabilistic credal states that we call probalogic. To motivate probalogic, we first expand classical logic to geo-logic, which fills the entire unit cube, and then we (...) project the upper surfaces of the geo-logical cube onto the plane of probabilistic credal states by means of standard, linear perspective, which may be interpreted as an extension of the classical principle of indifference. Finally, we apply the geometrical/logical methods developed in the paper to prove a series of trivialization theorems against question-invariance as a constraint on acceptance rules and against rational monotonicity as an axiom of conditional logic in situations of uncertainty. (shrink)

We sharpen Hájek’s Completeness Theorem for theories extending predicate product logic, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Pi\forall}$$\end{document}. By relating provability in this system to embedding properties of ordered abelian groups we construct a universal BL-chain L in the sense that a sentence is provable from \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Pi\forall}$$\end{document} if and only if it is an L-tautology. As well we characterize the class of lexicographic sums that have this universality property.

This paper deals with good fuzzy preorders on fuzzy power structures. It is shown that a fuzzy preorder R on an algebra ${(X,\mathbb{F})}$ is compatible if and only if it is Hoare good, if and only if it is Smyth good.

Arguments from analogy are pervasive in everyday reasoning, mathematics, philosophy, and science. Informal logic studies everyday argumentation in ordinary language. A branch of fuzzy logic, approximate reasoning, seeks to model facets of everyday reasoning with vague concepts in ill-defined situations. Ways of combining the results from these fields will be suggested by introducing a new argumentation scheme—a fuzzy analogical argument from classification—with the associated critical questions. This will be motivated by a case study of analogical reasoning in the virtual friendship (...) debate within information ethics. The virtual friendship debate is a disagreement over whether virtual friendships are genuine friendships. It will be argued that the debate could move away from its current impasse, caused by unproductive metaphysical and logical assumptions, if extant arguments are reinterpreted as fuzzy analogical arguments from classification, and subjected to a new set of critical questions which would replace the quest for facts of essence about friendship with an emphasis on empirical data, persuasion, and definitional power. (shrink)

ABSTRACTIn this paper, we present a generalisation of proof simulation procedures for Frege systems by Bonet and Buss to some logics for which the deduction theorem does not hold. In particular, we study the case of finite-valued Łukasiewicz logics. To this end, we provide proof systems and which augment Avron's Frege system HŁuk with nested and general versions of the disjunction elimination rule, respectively. For these systems, we provide upper bounds on speed-ups w.r.t. both the number of steps in proofs (...) and the length of proofs. We also consider Tamminga's natural deduction and Avron's hypersequent calculus GŁuk for 3-valued Łukasiewicz logic and generalise our results considering the disjunction elimination rule to all finite-valued Łukasiewicz logics. (shrink)

Some find it plausible that a sufficiently long duration of torture is worse than any duration of mild headaches. Similarly, it has been claimed that a million humans living great lives is better than any number of worm-like creatures feeling a few seconds of pleasure each. Some have related bad things to good things along the same lines. For example, one may hold that a future in which a sufficient number of beings experience a lifetime of torture is bad, regardless (...) of what else that future contains, while minor bad things, such as slight unpleasantness, can always be counterbalanced by enough good things. Among the most common objections to such ideas are sequence arguments. But sequence arguments are usually formulated in classical logic. One might therefore wonder if they work if we instead adopt many-valued logic. I show that, in a common many-valued logical framework, the answer depends on which versions of transitivity are used as premises. We get valid sequence arguments if we grant any of several strong forms of transitivity of 'is at least as bad as' and a notion of completeness. Other, weaker forms of transitivity lead to invalid sequence arguments. The plausibility of the premises is largely set aside here, but I tentatively note that almost all of the forms of transitivity that lead to valid sequence arguments seem intuitively problematic. Still, a few moderately strong forms of transitivity that might be acceptable lead to valid sequence arguments, although weaker statements of the initial value claims avoid these arguments at least to some extent. (shrink)

Hahn’s embedding theorem asserts that linearly ordered abelian groups embed in some lexicographic product of real groups. Hahn’s theorem is generalized to a class of residuated semigroups in this paper, namely, to odd involutive commutative residuated chains which possess only finitely many idempotent elements. To this end, the partial lexicographic product construction is introduced to construct new odd involutive commutative residuated lattices from a pair of odd involutive commutative residuated lattices, and a representation theorem for odd involutive commutative residuated chains (...) which possess only finitely many idempotent elements, by means of linearly ordered abelian groups and the partial lexicographic product construction is presented. (shrink)

In the present paper we show that any at most countable linearly-ordered commutative residuated lattice can be embedded into a commutative residuated lattice on the real unit interval [0, 1]. We use this result to show that Esteva and Godo''s logic MTL is complete with respect to interpretations into commutative residuated lattices on [0, 1]. This solves an open problem raised in.

Classification of certain group-like FL $_e$ -chains is given: We define absorbent-continuity of FL $_e$ -algebras, along with the notion of subreal chains, and classify absorbent-continuous, group-like FL $_e$ -algebras over subreal chains: The algebra is determined by its negative cone, and the negative cone can only be chosen from a certain subclass of BL-chains, namely, one with components which are either cancellative (that is, those components are negative cones of totally ordered Abelian groups) or two-element MV-algebras, and with no (...) two consecutive cancellative components. It is shown that the classification theorem does not hold if we drop the absorbent-continuity condition. Our result is the first classification theorem in the literature on FL $_e$ -algebras that does not assume the condition of being naturally ordered (which, under certain conditions, corresponds to continuity of the monoid operation). In our classification theorem, continuity is replaced by the much weaker absorbent-continuity. (shrink)

Propositional dynamic logic (PDL) provides a natural setting for semantics of means-end relations involving non-determinism, but such models do not include probabilistic features common to much practical reasoning involving means and ends. We alter the semantics for PDL by adding probabilities to the transition systems and interpreting dynamic formulas 〈α〉 ϕ as fuzzy predicates about the reliability of α as a means to ϕ. This gives our semantics a measure of efficacy for means-end relations.

The paper presents a particular example of a formula which is a standard tautology of Łukasiewicz but not its general tautology; an example of a model in which the formula is not true is explicitly constructed. Analogous example of a formula and its model is given for product logic.

In this paper, notions of fuzzy closure system and fuzzy closure L—system on L—ordered sets are introduced from the fuzzy point of view. We first explore the fundamental properties of fuzzy closure systems. Then the correspondence between fuzzy closure systems and fuzzy closure operators is established. Finally, we study the connections between fuzzy closure systems and fuzzy Galois connections. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

In 1907 Borel published a remarkable essay on the paradox of the Heap (“Un paradoxe économique: le sophisme du tas de blé et les vérités statistiques”), in which Borel proposes what is likely the first statistical account of vagueness ever written, and where he discusses the practical implications of the sorites paradox, including in economics. Borel’s paper was integrated in his book Le Hasard, published 1914, but has gone mostly unnoticed since its publication. One of the originalities of Borel’s essay (...) is that it puts forward a model of vagueness as imprecision, making particular use of the Gaussian law of measurement errors to model categorization. The aim of our paper is to give a presentation of the historical context of Borel’s essay, to spell out the mathematical details of his model, and to provide a critical assessment of his theory. Three aspects of Borel’s account are particularly discussed: the first concerns the comparison between Borel’s statistical account and posterior degree-theoretic accounts of vagueness. The second concerns the anti-epistemicist flavor of Borel’s approach, whereby the idea of statistical fluctuation is used to undermine the notion of sharp boundary for vague predicates. The third concerns the problematic link between Borel’s model of vagueness as imprecision and the notion of semantic indeterminacy. An English translation of Borel’s original essay is appended to this paper (Erkenntnis, this issue). (shrink)

Power structures are obtained by lifting some mathematical structure (operations, relations, etc.) from an universe X to its power set ${\mathcal{P}(X)}$ . A similar construction provides fuzzy power structures: operations and fuzzy relations on X are extended to operations and fuzzy relations on the set ${\mathcal{F}(X)}$ of fuzzy subsets of X. In this paper we study how this construction preserves some properties of fuzzy sets and fuzzy relations (similarity, congruence, etc.). We define the notions of good, very good, Hoare good (...) and Smith good fuzzy relation and establish some connections between them, generalizing some results of Brink, Bošnjak and Madarász on power structures. (shrink)

We introduce a relational semantics based on poset products, and provide sufficient conditions guaranteeing its soundness and completeness for various substructural logics. We also demonstrate that our relational semantics unifies and generalizes two semantics already appearing in the literature: Aguzzoli, Bianchi, and Marra’s temporal flow semantics for Hájek’s basic logic, and Lewis-Smith, Oliva, and Robinson’s semantics for intuitionistic Łukasiewicz logic. As a consequence of our general theory, we recover the soundness and completeness results of these prior studies in a uniform (...) fashion, and extend them to infinitely-many other substructural logics. (shrink)

An algebraic setting for the validity of Pavelka style completeness for some natural expansions of Łukasiewicz logic by new connectives and rational constants is given. This algebraic approach is based on the fact that the standard MV-algebra on the real segment [0, 1] is an injective MV-algebra. In particular the logics associated with MV-algebras with product and with divisible MV-algebras are considered.

This is a contribution to the discussion on the role of truth degrees in manyvalued logics from the perspective of abstract algebraic logic. It starts with some thoughts on the so-called Suszko’s Thesis (that every logic is two-valued) and on the conception of semantics that underlies it, which includes the truth-preserving notion of consequence. The alternative usage of truth values in order to define logics that preserve degrees of truth is presented and discussed. Some recent works studying these in the (...) particular cases of Łukasiewicz’s many-valued logics and of logics associated with varieties of residuated lattices are also presented. Finally the extension of this paradigm to other, more general situations is discussed, highlighting the need for philosophical or applied motivations in the selection of the truth degrees, due both to the interpretation of the idea of truth degree and to some mathematical difficulties. (shrink)

In this paper we consider the structure of the class FGModS of full generalized models of a deductive system S from a universal-algebraic point of view, and the structure of the set of all the full generalized models of S on a fixed algebra A from the lattice-theoretical point of view; this set is represented by the lattice FACSs A of all algebraic closed-set systems C on A such that (A, C) ε FGModS. We relate some properties of these structures (...) with tipically logical properties of the sentential logic S. The main algebraic properties we consider are the closure of FGModS under substructures and under reduced products, and the property that for any A the lattice FACSs A is a complete sublattice of the lattice of all algebraic closed-set systems over A. The logical properties are the existence of a fully adequate Gentzen system for S, the Local Deduction Theorem and the Deduction Theorem for S. Some of the results are established for arbitrary deductive systems, while some are found to hold only for deductive systems in more restricted classes like the protoalgebraic or the weakly algebraizable ones. The paper ends with a section on examples and counterexamples. (shrink)

Łukasiewicz’s infinite-valued logic is commonly defined as the set of formulas that take the value 1 under all evaluations in the Łukasiewicz algebra on the unit real interval. In the literature a deductive system axiomatized in a Hilbert style was associated to it, and was later shown to be semantically defined from Łukasiewicz algebra by using a “truth-preserving” scheme. This deductive system is algebraizable, non-selfextensional and does not satisfy the deduction theorem. In addition, there exists no Gentzen calculus fully adequate (...) for it. Another presentation of the same deductive system can be obtained from a substructural Gentzen calculus. In this paper we use the framework of abstract algebraic logic to study a different deductive system which uses the aforementioned algebra under a scheme of “preservation of degrees of truth”. We characterize the resulting deductive system in a natural way by using the lattice filters of Wajsberg algebras, and also by using a structural Gentzen calculus, which is shown to be fully adequate for it. This logic is an interesting example for the general theory: it is selfextensional, non-protoalgebraic, and satisfies a “graded” deduction theorem. Moreover, the Gentzen system is algebraizable. The first deductive system mentioned turns out to be the extension of the second by the rule of Modus Ponens. (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.

This paper introduces a logical analysis of convex combinations within the framework of Łukasiewicz real-valued logic. This provides a natural link between the fields of many-valued logics and decision theory under uncertainty, where the notion of convexity plays a central role. We set out to explore such a link by defining convex operators on MV-algebras, which are the equivalent algebraic semantics of Łukasiewicz logic. This gives us a formal language to reason about the expected value of bounded random variables. As (...) an illustration of the applicability of our framework we present a logical version of the Anscombe–Aumann representation result. (shrink)

In the 1970s, Robin Giles introduced a game combining Lorenzen-style dialogue rules with a simple scheme for betting on the truth of atomic statements, and showed that the existence of winning strategies for the game corresponds to the validity of formulas in Łukasiewicz logic. In this paper, it is shown that ‘disjunctive strategies’ for Giles’s game, combining ordinary strategies for all instances of the game played on the same formula, may be interpreted as derivations in a corresponding proof system. In (...) particular, such strategies mirror derivations in a hypersequent calculus developed in recent work on the proof theory of Łukasiewicz logic. (shrink)

We describe an infinitary logic for metric structures which is analogous to Lω1,ω. We show that this logic is capable of expressing several concepts from analysis that cannot be expressed in finitary continuous logic. Using topological methods, we prove an omitting types theorem for countable fragments of our infinitary logic. We use omitting types to prove a two-cardinal theorem, which yields a strengthening of a result of Ben Yaacov and Iovino concerning separable quotients of Banach spaces.