In a recent work by Demri and Deters (CSL-LICS 2014), first-order separation logic restricted to two variables and separating implication was shown undecidable, where it was shown that even with only two variables, if the use of negations is unrestricted, then they can be nested with separating implication in a complex way to get the undecidability result. In this paper, we revisit the decidabi...

The purpose of this study was to determine the effect competence on performance village government officials through use financial applications. Research method: Quantitative using part analysis 285 employees system operator, treasurer, and planning in Pulang Pisau, Central Kalimantan. results show that has a direct employee information technology successfully mediates relationship between perf...

‎In this short note‎, ‎we present some inequalities for relative operator entropy which are generalizations of some results obtained by Zou [Operator inequalities associated with Tsallis relative operator entropy‎, ‎{em Math‎. ‎Inequal‎. ‎Appl.}‎ ‎{18} (2015)‎, ‎no‎. ‎2‎, ‎401--406]‎. ‎Meanwhile‎, ‎we also show some new lower and upper bounds for relative operator entropy and Tsallis relative o...

This paper presents a recent formalization of Henkin-style completeness proof for the propositional modal logic S5 using Lean theorem prover. The formalized is close to that Hughes and Cresswell [], but system, based on different choice axioms, better described as Mendelson system augmented with axiom schemes K, T, S4, B, necessitation rule inference. language has false implication only primiti...

A comparison is made of two approaches to approximate reasoning: Mamdani's interpolation method and the implication method. Both approaches are variants of Zadeh's compositional rule of inference. It is shown that the approaches are not equivalent. A correspondence between the approaches is established via the inverse of the implied fuzzy relation. The interpolation method has the lowest time-c...

For (C(t))t≥0 being a strongly continuous cosine family on a Banach space, we show that the estimate lim supt→0+ ‖C(t) − I‖ < 2 implies that C(t) converges to I in the operator norm. This implication has become known as the zero-two law. We further prove that the stronger assumption of supt≥0 ‖C(t) − I‖ < 2 yields that C(t) = I for all t ≥ 0. For discrete cosine families, the assumption supn∈N ...

In this paper we consider the merging of rules or conditionals. In contrast to other approaches, we do not invent a new approach from scratch, for one particular kind of rule, but we are interested in ways to generalize existing revision and merging operators from belief merging to rule merging. First, we study ways to merge rules based on only a notion of consistency of a set of rules, and ill...

Fuzzy modus ponens (briefly, FMP) is the most fundamental form of fuzzy reasoning and has been extensively discussed by diverse researchers. The aim of the present paper is to propose a formalized form of FMP, called generalized modus ponens, in the fuzzy logic system L and solve it in L, and then provide its numerical version as a new algorithm for solving FMP. As a preparation, some related q...

In this paper we provide a reconstruction of access control logics within constructive conditional logics, by regarding the assertion A says φ, whose intended meaning is that principal A says that φ, as a conditional implication. We identify the conditional axioms needed to capture the basic properties of the “says” operator and to provide a proper definition of boolean principals. Most of thes...

We study the residuated basic logic (RBL) of residuated basic algebra in which the basic implication of Visser’s basic propositional logic (BPL) is interpreted as the right residual of a non-associative binary operator · (product). We develop an algebraic system SRBL of residuated basic algebra by which we show that RBL is a conservative extension of BPL. We present the sequent formalization LR...