中文
相关论文

相关论文: Pavelka-style completeness in expansions of \L uka…

200 篇论文

In this paper we present some results on the variety of divisible MV-algebras. Any free divisible MV-algebra is an algebra of continuous piecewise linear functions with rational coefficients. Correspondingly, Rational {\L}ukasiewicz logic…

逻辑 · 数学 2024-02-16 Brunella Gerla

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…

计算机科学中的逻辑 · 计算机科学 2023-12-12 Doratossadat Dastgheib , Hadi Farahani

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…

逻辑 · 数学 2026-05-28 Zuzana Haniková , Filip Jankovec

Our main issue was to understand the connection between \L ukasiewicz logic with product and the Pierce-Birkhoff conjecture, and to express it in a mathematical way. To do this we define the class of \textit{f}MV-algebras, which are…

逻辑 · 数学 2016-05-05 Serafina Lapenta , Ioana Leustean

This paper aims at connecting the various classes that provide an algebraic semantics for three different conservative expansions of Lukasiewicz logic, using algebraic and category-theoretical techniques. We connect such classes of algebras…

逻辑 · 数学 2018-09-20 Serafina Lapenta , Ioana Leustean

We initiate a deep study of {\em Riesz MV-algebras} which are MV-algebras endowed with a scalar multiplication with scalars from $[0,1]$. Extending Mundici's equivalence between MV-algebras and $\ell$-groups, we prove that Riesz MV-algebras…

逻辑 · 数学 2013-09-09 Antonio Di Nola , Ioana Leustean

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…

计算机科学中的逻辑 · 计算机科学 2018-02-26 Zuzana Haniková

We present a logic for reasoning about graded inequalities which generalizes the ordinary inequational logic used in universal algebra. The logic deals with atomic predicate formulas of the form of inequalities between terms and formalizes…

计算机科学中的逻辑 · 计算机科学 2015-03-24 Vilem Vychodil

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…

逻辑 · 数学 2016-05-05 Serafina Lapenta , Ioana Leustean

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…

逻辑 · 数学 2023-08-29 Doratossadat Dastgheib , Hadi Farahani

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…

逻辑 · 数学 2017-09-26 Antonio Di Nola , Serafina Lapenta , Ioana Leustean

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…

计算机科学中的逻辑 · 计算机科学 2020-11-20 Aldo Figallo-Orellano , Juan Sebastian Slagter

We present a logic for reasoning with if-then formulas which involve constants for rational truth degrees from the unit interval. We introduce graded semantic and syntactic entailment of formulas. We prove the logic is complete in Pavelka…

计算机科学中的逻辑 · 计算机科学 2015-02-26 Vilem Vychodil

The first contribution of this paper is the presentation of a Pavelka - like formulation of possibilistic logic in which the language is naturally enriched by two connectives which represent negation (eg) and a new type of conjunction…

人工智能 · 计算机科学 2013-02-21 Luca Boldrin , Claudio Sossai

This comparative survey explores three formal approaches to reasoning with partly true statements and degrees of truth, within the family of {\L}ukasiewicz logic. These approaches are represented by infinite-valued {\L}ukasiewicz logic…

计算机科学中的逻辑 · 计算机科学 2021-12-14 Zuzana Haniková

In this paper, we introduce a foundation for computable model theory of rational Pavelka logic (an extension of {\L}ukasiewicz logic) and continuous logic, and prove effective versions of some theorems in model theory. We show how to reduce…

逻辑 · 数学 2010-06-14 Farzad Didehvar , Kaveh Ghasemloo , Massoud Pourmahdian

For any MV-algebra $A$ we equip the set $I(A)$ of intervals in $A$ with pointwise \L ukasiewicz negation $\neg x=\{\neg \alpha\mid \alpha\in x\}$, (truncated) Minkowski sum, $x\oplus y=\{\alpha\oplus \beta\mid \alpha \in x,\,\,\beta\in…

逻辑 · 数学 2014-03-05 Leonardo Manuel Cabrer , Daniele Mundici

The present paper investigates proof-theoretical and algebraic properties for the probability logic FP(L,L), meant for reasoning on the uncertainty of Lukasiewicz events. Methodologically speaking, we will consider a translation function…

逻辑 · 数学 2023-03-14 Tommaso Flaminio , Sara Ugolini

In this paper, once recalled some properties of CMV-algebras, we introduce an expansion of the one-variable fragment of Lukasiewicz propositional logic whose algebraic semantics is the variety of CMV-algebras.

逻辑 · 数学 2011-09-21 Antonio Di Nola , Brunella Gerla , Ciro Russo

General theory determines the notion of separable MV-algebra (equivalently, of separable unital lattice-ordered Abelian group). We establish the following structure theorem: An MV-algebra is separable if, and only if, it is a finite product…

环与代数 · 数学 2023-07-28 Vincenzo Marra , Matías Menni
‹ 上一页 1 2 3 10 下一页 ›