English
Related papers

Related papers: Super-\L ukasiewicz logics expanded by $\Delta$

200 papers

In this paper we give a new proof for the completeness of infinite valued propositional \L ukasiewicz logic introduced by \L ukasiewicz and Tarski in 1930. Our approach employs a Hilbert-style proof that relies on the concept of maximal…

Logic · Mathematics 2023-08-29 Doratossadat Dastgheib , Hadi Farahani

The first system of many-valued logic was introduced by J. Lukasiewicz, his motivation was of philosophical nature as he was looking for an interpretation of the concepts of possibility and necessity. Since then, plenty of research has been…

Logic · Mathematics 2012-04-20 A. V. Figallo , I. Pascual y A. Ziliani

In this article we introduce the variety of monadic BL-algebras as BL-algebras endowed with two monadic operators $\forall$ and $\exists$. After a study of the basic properties of this variety we show that this class is the equivalent…

In the framework of propositional {\L}ukasiewicz logic, a suitable notion of implicit definability, tailored to the intended real-valued semantics and referring to the elements of its domain, is introduced. Several variants of implicitly…

Logic in Computer Science · Computer Science 2018-02-26 Zuzana Haniková

Fuzzy logic extends the classical truth values "true" and "false" with additional truth degrees in between. More specifically, fuzzy modal logics in this sense are given by a choice of fuzzy modalities and a fuzzy propositional base. It has…

Logic in Computer Science · Computer Science 2026-02-13 Stefan Gebhart , Lutz Schröder , Paul Wild

MV-algebras are an algebraic semantics for Lukasiewicz logic and MV-algebras generated by a finite chain are Heyting algebras where the Godel implication can be written in terms of De Morgan and Moisil's modal operators. In our work, a…

Logic in Computer Science · Computer Science 2020-11-20 Aldo Figallo-Orellano , Juan Sebastian Slagter

Unbounded {\L}ukasiewicz logic is a substructural logic that combines features of infinite-valued {\L}ukasiewicz logic with those of abelian logic. The logic is finitely strongly complete w.r.t.~the additive $\ell$-group on the reals…

Logic · Mathematics 2026-05-28 Zuzana Haniková , Filip Jankovec

The paper explores properties of {\L}ukasiewicz mu-calculus, a version of the quantitative/probabilistic modal mu-calculus containing both weak and strong conjunctions and disjunctions from {\L}ukasiewicz (fuzzy) logic. We show that this…

Logic in Computer Science · Computer Science 2013-09-05 Matteo Mio , Alex Simpson

In 1929 Jan Lukasiewicz used, apparently for the first time, his Polish notation to represent the operations of formal logic. This is a parenthesis-free notation, which also implies that logical functions are operators preceding the…

History and Overview · Mathematics 2025-01-15 Eduardo Mizraji

We propose a doxastic \L ukasiewicz logic \textbf{B\L} that is sound and complete with respect to the class of Kripke-based models in which atomic propositions and accessibility relations are both infinitely valued in the standard…

Logic in Computer Science · Computer Science 2023-12-12 Doratossadat Dastgheib , Hadi Farahani

Fuzzy Epistemic Logic is an important formalism for approximate reasoning. It extends the well known basic propositional logic BL, introduced by H\'ajek, by offering the ability to reason about possibility and necessity of fuzzy…

Logic · Mathematics 2018-05-01 Manuela Busaniche , Penélope Cordero , Ricardo O. Rodríguez

From the viewpoint of provability, we compare some Gentzen-type hypersequent calculi for first-order infinite-valued {\L}ukasiewicz logic and for first-order rational Pavelka logic with each other and with H\'ajek's Hilbert-type calculi for…

Logic in Computer Science · Computer Science 2023-02-02 Alexander S. Gerasimov

This paper is focused on the study of modal logics defined from valued Kripke frames, and particularly, on computability and expressibility questions of modal logics of transitive Kripke frames evaluated over certain residuated lattices. It…

Logic in Computer Science · Computer Science 2019-04-03 Amanda Vidal

In this paper we present, by way of case studies, a proof of concept, based on a prototype working on a automotive data set, aimed at showing the potential usefulness of using formulas of {\L}ukasiewicz propositional logic to query…

Logic in Computer Science · Computer Science 2015-12-04 Stefano Aguzzoli , Pietro Codara , Tommaso Flaminio , Brunella Gerla , Diego Valota

We study \L ukasiewicz logic enriched with a scalar multiplication with scalars taken in $[0,1]$. Its algebraic models, called {\em Riesz MV-algebras}, are, up to isomorphism, unit intervals of Riesz spaces with a strong unit endowed with…

Logic · Mathematics 2017-09-26 Antonio Di Nola , Serafina Lapenta , Ioana Leustean

Moisil logic, having as algebraic counterpart \L ukasiewicz-Moisil algebras, provide an alternative way to reason about vague information based on the following principle: a many-valued event is characterized by a family of Boolean events.…

Logic · Mathematics 2014-12-10 Denisa Diaconescu , Ioana Leustean

Non-additive uncertainty theories, typically possibility theory, belief functions and imprecise probabilities share a common feature with modal logic: the duality properties between possibility and necessity measures, belief and…

Artificial Intelligence · Computer Science 2023-03-24 Didier Dubois , Lluis Godo , Henri Prade

In this paper we study the tensor product for MV-algebras, the algebraic structures of \L ukasiewicz $\infty$-valued logic. Our main results are: the proof that the tensor product is preserved by the categorical equivalence between the…

Logic · Mathematics 2016-05-05 Serafina Lapenta , Ioana Leustean

We discuss two two-layered logics formalising reasoning with paraconsistent probabilities that combine the Lukasiewicz $[0,1]$-valued logic with Baaz $\triangle$ operator and the Belnap--Dunn logic.

Logic · Mathematics 2023-09-01 Marta Bilkova , Sabine Frittella , Daniil Kozhemiachenko , Ondrej Majer

This paper presents a unified algebraic study of a family of logics related to Abelian logic (Ab), the logic of Abelian lattice-ordered groups. We treat Ab as the base system and refer to its expansions as superabelian logics. The paper…

Logic · Mathematics 2026-04-17 Petr Cintula , Filip Jankovec , Carles Noguera
‹ Prev 1 2 3 10 Next ›