The paper investigates an evidence-based semantics for epistemic logics. It is shown that the properties of knowledge obtained from a potentially infinite body evidence are described by modal logic S5. At same time, only finite subset this S4. main technical result sound and complete bi-modal logical system describes these two modalities their interplay.

needed which are versatile, responsive to users’ sounds organised according to referential attributes. expectations, and have high audio quality. Moreover, model Nowadays, a common terminology is available for flexibility for human–machine interaction is a major issue. describing sound objects both from a phenomenoModels based on the physics of actual or virtual objects can logical or a referen...

Security properties are profitably expressed using notions of contextual equivalence, and logical relations are a powerful proof technique to establish contextual equivalence in typed lambda calculi, see e.g. Sumii and Pierce’s logical relation for a cryptographic lambda-calculus. We clarify Sumii and Pierce’s approach, showing that the right tool is prelogical relations, or lax logical relatio...

The computational method of parametric probability analysis is introduced. It is demonstrated how to embed logical formulas from the propositional calculus into parametric probability networks, thereby enabling sound reasoning about the probabilities of logical propositions. An alternative direct probability encoding scheme is presented, which allows statements of implication and quantification...

This paper presents a graph-based knowledge representation and reasoning language. This language benefits from an important syntactic operation, which is called a graph homomorphism. This operation is sound and complete with respect to logical deduction. Hence, it is possible to do logical reasoning without using the language of logic but only graphical, thus visual, notions. This paper present...

The methodology of fibring is a successful framework for combining logical systems based on combining their semantics. In this paper, we extend the fibring approach to calculi for logical systems: we describe how to uniformly construct a sound and complete tableau calculus for the combined logic from calculi for the component logics. We consider semantic tableau calculi that satisfy certain con...

This paper presents a graph-based knowledge representation and reasoning language. This language benefits from an important syntactic operation, which is called a graph homomorphism. This operation is sound and complete with respect to logical deduction. Hence, it is possible to do logical reasoning without using the language of logic but only graphical, thus visual, notions. This paper present...

Combined connectives arise in combined logics. In fibrings, such combined connectives are known as shared connectives and inherit the logical properties of each component. A new way of combining connectives (and other language constructors of propositional nature) is proposed by inheriting only the common logical properties of the components. A sound and complete calculus is provided for reason...