We investigate axiomatizations of Kripke’s [18] theory of truth based on the Strong Kleene evaluation scheme for treating sentences lacking a truth value. Feferman’s axiomatization KF formulated in classical logic is an indirect approach, because it is not sound with respect to Kripke’s semantics in the straightforward sense; only the sentences provably true in KF are valid in Kripke’s partial ...

We propose a combination of Bochvar’s strict three-valued logic, McCarthy’s sequential three-valued logic, and process algebra via the conditional guard construct. This combination entails the introduction of a new constant meaningless in process algebra. We present an operational semantics in SOS-style, and a completeness result for ACP with conditional guard construct and the proposed logic.

We study the international standard XACML 3.0 for describing security access control policy in a compositional way. Our main contribution is to derive a logic that precisely captures the idea behind the standard and to formally define the semantics of the policy combining algorithms of XACML. To guard against modelling artifacts we provide an alternative way of characterizing the policy combini...

Path-sensitive data flow analysis pairs classical data flow analysis with an analysis of feasibility of paths to improve precision. In this paper we propose a framework for path-sensitive backward data flow analysis that is enhanced with an abstraction of the predicate domain. The abstraction is based on a three-valued logic. It follows the strategy that path predicates are simplified if possib...

We study the international standard XACML 3.0 for describing security access control policy in a compositional way. Our main contribution is to derive a logic that precisely captures the idea behind the standard and to formally define the semantics of the policy combining algorithms of XACML. To guard against modelling artefacts we provide an alternative way of characterizing the policy combini...

A critical view of the alleged significance of Belnap four-valued logic for reasoning under inconsistent and incomplete information is provided. The difficulty lies in the confusion between truth-values and information states, when reasoning about Boolean propositions. So our critique is along the lines of previous debates on the relevance of many-valued logics and especially of the extension o...

We provide a methodology to introduce proof search oriented calculi for a large class of many-valued logics, and a sufficient condition for their Co-NP completeness. Our results apply to many well known logics including Gödel, Lukasiewicz and Product Logic, as well as Hájek’s Basic Fuzzy Logic.

In fuzzy logic in wider sense t norms got a prominent r ole in recent times In many valued logic the Lukasiewicz systems the G odel sytems and also the product logic are t norm based The present paper discusses the more general problem of the adequate axiomatizability for such t norm based logical systems in general survey ing results of the last years

As in binary, a multiple-valued programmable logic array (PLA) realises a sum-ofproducts expression specified by the user. However, in multiple-valued logic, there are many more operations than in binary, and an important question is the choice of operations which provides the greatest number of functions for a given chip area. In this paper, we analyse various PLA configurations using operatio...