Related papers: Rational Lukasiewicz logic and DMV-algebras
We combine the concepts of modal logics and many-valued logics in a general and comprehensive way. Namely, given any finite linearly ordered set of truth values and any set of propositional connectives defined by truth tables, we define the…
We introduce the concept of fuzzy sheaf as a natural generalisation of a sheaf over a topological space in the context of fuzzy topologies. Then we prove a representation for a class of MV-algebras in which the representing object is an…
Logic programming is a flexible programming paradigm due to the use of predicates without a fixed data flow. To extend logic languages with the compact notation of functional programming, there are various proposals to map evaluable…
We introduce and develop propositional continuous intuitionistic logic and propositional continuous affine logic via complete algebraic semantics. Our approach centres on AC-algebras, which are algebras $USC(\mathcal{L})$ of sup-preserving…
Conjunctive table algebras are introduced and axiomatically characterized. A conjunctive table algebra is a variant of SPJR algebra (a weaker form of relational algebra), which corresponds to conjunctive queries with equality. The table…
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…
There is a polymodal provability logic $GLP$. We consider generalizations of this logic: the logics $GLP_{\alpha}$, where $\alpha$ ranges over linear ordered sets and play the role of the set of indexes of modalities. We consider the…
A real algebraic variety W of dimension m is said to be uniformly rational if each of its points has a Zariski open neighborhood which is biregularly isomorphic to a Zariski open subset of R^m. Let l be any nonnegative integer. We prove…
The study of essential and strongly essential variables in functions defined on finite sets is a part of $k$-valued logic. We extend the main definitions from functions to terms. This allows us to apply concepts and results of Universal…
This paper explores relational syllogistic logics, a family of logical systems related to reasoning about relations in extensions of the classical syllogistic. These are all decidable logical systems. We prove completeness theorems and…
This paper presents a systematic study of the structure of non-solvable cyclic metric Lie algebras. A cyclic metric is a symmetric bilinear form satisfying a cyclic cocycle condition, which arises naturally in the contexts of…
We introduce in this short note some aspects of the Moyal momentum algebra that we call the Das-Popowicz Mm algebra. Our interest on this algebra is motivated by the central role that it can play in the formulation of integrable models and…
DLV is an efficient logic programming and non-monotonic reasoning (LPNMR) system with advanced knowledge representation mechanisms and interfaces to classic relational database systems. Its core language is disjunctive datalog…
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…
In "A new proof of the completeness of the Lukasiewicz axioms"} (Transactions of the American Mathematical Society, 88) C.C. Chang proved that any totally ordered $MV$-algebra $A$ was isomorphic to the segment $A \cong \Gamma(A^*, u)$ of a…
We give a classification of real solvable Lie algebras whose non-trivial coadjoint orbits of corresponding simply connected Lie groups are all of codimension 2. These Lie algebras belong to a well-known class, called the class of…
The Lie conformal algebra of loop Virasoro algebra, denoted by $\mathscr{CW}$, is introduced in this paper. Explicitly, $\mathscr{CW}$ is a Lie conformal algebra with $\mathbb{C}[\partial]$-basis $\{L_i\,|\,i\in\mathbb{C}\}$ and…
Hybrid logic is a modal logic with additional operators specifying nominals and is highly expressive. For example, there is no formula corresponding to the irreflexivity of Kripke frames in basic modal logic, but there is in hybrid logic.…
We present a coalgebraic framework for studying generalisations of dynamic modal logics such as PDL and game logic in which both the propositions and the semantic structures can take values in an algebra $\mathbf{A}$ of truth-degrees. More…
In this work we propose a formal system for fuzzy algebraic reasoning. The sequent calculus we define is based on two kinds of propositions, capturing equality and existence of terms as members of a fuzzy set. We provide a sound semantics…