Related papers: A van Benthem Theorem for Fuzzy Modal Logic

In contrast to the existing approaches to bisimulation for fuzzy systems, we introduce a behavioral distance to measure the behavioral similarity of states in a nondeterministic fuzzy-transition system. This behavioral distance is defined…

A modal logic based on quantum logic is formalized in its simplest possible form. Specifically, a relational semantics and a sequent calculus are provided, and the soundness and the completeness theorems connecting both notions are…

We study multimodal logics over universally first-order definable classes of frames. We show that even for bimodal logics, there are universal Horn formulas that define set of frames such that the satisfiability problem is undecidable, even…

The authors introduced in a previous paper the notion of fuzzy Gromov-Hausdorff distance between non-Archimedean compact fuzzy metric spaces, presenting a fuzzy version of the Gromov's completeness theorem. In this paper we present a fuzzy…

In this note we show that the usual notion of fuzzy norm defined on a linear space is equivalent to that of quasiconcave function, in the sense that every fuzzy norm $N:X\times\mathbb{R}[0,1]$ defined on a (real or complex) linear space X…

Fine's influential Canonicity Theorem states that if a modal logic is determined by a first-order definable class of Kripke frames, then it is valid in its canonical frames. This article reviews the background and context of this result,…

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…

We classify the propositional modal validities arising from the category of sets under its natural classes of morphisms. The resulting validities depend on the morphism class, the size of the world, and the permitted substitution instances.…

This paper investigates first-order game logic and first-order modal mu-calculus, which extend their propositional modal logic counterparts with first-order modalities of interpreted effects such as variable assignments. Unlike in the…

A key problem in the application of first-order probabilistic methods is the enormous size of graphical models they imply. The size results from the possible worlds that can be generated by a domain of objects and relations. One of the…

I investigate the superintuitionistic analogue of the modal logic of chequered subsets of $\mathbb{R}^\infty$ introduced by van Benthem et al. It is observed that this logic possesses the disjunction property, contains the Scott axiom,…

Succinctness is a natural measure for comparing the strength of different logics. Intuitively, a logic L_1 is more succinct than another logic L_2 if all properties that can be expressed in L_2 can be expressed in L_1 by formulas of…

First-order logic is typically presented as the study of deduction in a setting with elementary quantification. In this paper, we take another vantage point and conceptualize first-order logic as a linear space that encodes "plausibility".…

This paper proposes two kinds of fuzzy abductive inference in the framework of fuzzy rule base. The abductive inference processes described here depend on the semantic of the rule. We distinguish two classes of interpretation of a fuzzy…

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…

While modal extensions of decidable fragments of first-order logic are usually undecidable, their monodic counterparts, in which formulas in the scope of modal operators have at most one free variable, are typically decidable. This only…

An interval-valued fuzzy answer set programming paradigm is proposed for nonmonotonic reasoning with vague and uncertain information. The set of sub-intervals of $[0,1]$ is considered as truth-space. The intervals are ordered using…

Linear representations for a subclass of boolean symmetric functions selected by a parity condition are shown to constitute a generalization of the linear constraints on probabilities introduced by Boole. These linear constraints are…

In this talk a brief survey of basic ideas of Idempotent Mathematics is presented. Relations between this theory and the theory of fuzzy sets as well as the possibility theory and some applications (including computer applications) are…

We introduce and investigate a weighted propositional configuration logic over De Morgan algebras. This logic is able to describe software architectures with quantitative features such as the uncertainty of the interactions that occur in…