English
Related papers

Related papers: Satisfiability in {\L}ukasiewicz logic and its unb…

200 papers

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

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

We study a real valued propositional logic with unbounded positive and negative truth values that we call R-valued logic. Such logic slightly extends continuous propositional logic which, in turn, builds on Lukasiewicz many-valued logic.…

Logic · Mathematics 2015-12-16 Stefano Baratella , Domenico Zambella

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á

An algebraic setting for the validity of Pavelka style completeness for some natural expansions of \L ukasiewicz logic by new connectives and rational constants is given. This algebraic approach is based on the fact that the standard…

Logic · Mathematics 2008-07-01 Hector Freytes

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

We study the S5-modal expansion of the logic based on the Lukasiewicz t-norm. We exhibit a finitary propositional calculus and show that it is finitely strongly complete with respect to this logic. This propositional calculus is then…

Logic · Mathematics 2024-08-12 Diego Castaño , José Patricio Díaz Varela , Gabriel Savoy

We present two embeddings of infinite-valued Lukasiewicz logic L into Meyer and Slaney's abelian logic A, the logic of lattice-ordered abelian groups. We give new analytic proof systems for A and use the embeddings to derive corresponding…

Logic in Computer Science · Computer Science 2007-05-23 G. Metcalfe , N. Olivetti , D. Gabbay

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

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…

Logic · Mathematics 2024-02-16 Brunella Gerla

Building on the correspondence between finitely axiomatised theories in {\L}ukasieiwcz logic and rational polyhedra, we prove that the unification type of the fragment of {\L}ukasiewicz logic with $n\geq 2$ variables is nullary. This solves…

Logic · Mathematics 2025-07-23 Marco Abbadini , Luca Spada

In this paper we study $\mathcal{MV}^+$, i.e. the positive fragment of {\L}ukasiewicz Multi-Valued Logic $\mathcal{MV}$. In particular we describe all the finitary extensions of $\mathcal{MV}^+$ that are structurally complete and all the…

Logic · Mathematics 2023-10-02 Paolo Aglianò , Francesco Manfucci

Recently there have been some unexpected results concerning Fuzzy Description Logics (FDLs) with General Concept Inclusions (GCIs). They show that, unlike the classical case, the DL ALC with GCIs does not have the finite model property…

Logic in Computer Science · Computer Science 2011-07-28 Marco Cerami , Umberto Straccia

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…

Logic · Mathematics 2013-09-09 Antonio Di Nola , Ioana Leustean

In this note we prove that single-conclusion admissible rules of any proper axiomatic extension of the infnite valued Lukasiewicz logic are finitely based.

Logic · Mathematics 2015-12-14 Joan Gispert

We extend \L ukasiewicz logic obtaining the infinitary logic $\mathcal{IR}\L$ whose models are algebras $C(X,[0,1])$, where $X$ is a basically disconnected compact Hausdorff space. Equivalently, our models are unit intervals in…

Logic · Mathematics 2018-04-20 Antonio Di Nola , Serafina Lapenta , Ioana Leustean

The Blok-Esakia theorem states that there is an isomorphism from the lattice of intermediate logics onto the lattice of normal extensions of Grzegorczyk modal logic. The extension for multi-conclusion consequence relations was obtained by…

Logic · Mathematics 2018-10-23 Michał M. Stronkowski

We explore the problem of explaining observations in contexts involving statements with truth degrees such as `the lift is loaded', `the symptoms are severe', etc. To formalise these contexts, we consider infinitely-valued {\L}ukasiewicz…

Logic in Computer Science · Computer Science 2025-11-11 Katsumi Inoue , Daniil Kozhemiachenko

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

This paper investigates the satisfiability problem for Separation Logic, with unrestricted nesting of separating conjunctions and implications, for prenex formulae with quantifier prefix in the language $\exists^*\forall^*$, in the cases…

Logic in Computer Science · Computer Science 2018-02-19 Mnacho Echenim , Radu Iosif , Nicolas Peltier
‹ Prev 1 2 3 10 Next ›