- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Switch to: References
Citations of:
Add citations
You must login to add citations.
|
|
|
We study a system, μŁΠ, obtained by an expansion of ŁΠ logic with fixed points connectives. The first main result of the paper is that μŁΠ is standard complete, i.e., complete with regard to the unit interval of real numbers endowed with a suitable structure. We also prove that the class of algebras which forms algebraic semantics for this logic is generated, as a variety, by its linearly ordered members and that they are precisely the interval algebras of real closed (...) |
|
|
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, (...) |
|
|
Recently an expansion of Ł∏ logic with fixed points has been considered [23]. In the present work we study the algebraic semantics of this logic, namely μŁΠ algebras, from algebraic, model theoretic and computational standpoints. We provide a characterisation of free μŁΠ algebras as a family of particular functions from [0,1]n to [0,1]. We show that the first-order theory of linearly ordered μŁΠ algebras enjoys quantifier elimination, being, more precisely, the model completion of the theory of linearly ordered Ł∏ algebras. (...) |
|
|
Ł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. |
|
|
In this paper we solve the problem how to axiomatize a system of quantum computational gates known as the Poincaré irreversible quantum computational system. A Hilbert-style calculus is introduced obtaining a strong completeness theorem. |
|
|
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 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 (...) |
|
|
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]. (...) |
|
|
ABSTRACTWe introduce the variety of Many-Valued-Weak rigs. We provide an axiomatisation and establish, in this context, basic properties about ideals, homomorphisms, quotients and radicals. This new class contains the class of product MV-algebras presented by Di Nola and Dvurečenskij in 2001 and by Montagna in 2005. The main result is the compactness of the prime spectrum of this new class, endowed with the co-Zariski topology as defined by Dubuc and Poveda in 2010. |
|
|
An explicit categorical equivalence is defined between a proper subvariety of the class of \-algebras, as defined by Di Nola and Dvurečenskij, to be called \-algebras, and the category of semi-low \-rings. This categorical representation is done using the prime spectrum of the \-algebras, through the equivalence between \-algebras and \-groups established by Mundici, from the perspective of the Dubuc–Poveda approach, that extends the construction defined by Chang on chains. As a particular case, semi-low \-rings associated to Boolean algebras are (...) |
|
|
In many-valued logics with the unit interval as the set of truth values, from the standard negation and the product (or, more generally, from any strict Frank t-norm) all measurable logical functions can be derived, provided that also operations with countable arity are allowed. The question remained open whether there are other t-norms with this property or whether all strict t-norms possess this property. We give a full solution to this problem (in the case of strict t-norms), together with convenient (...) |
|
|
Franco Montagna, a prominent logician and one of the leaders of the Italian school on Mathematical Logic, passed away on February 18, 2015. We survey some of his results and ideas in the two disciplines he greatly contributed along his career: provability logic and many-valued logic. |
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6d9b7f7c4c-67rzb uwo