The last years have seen an exponential increase in the interest for the development of methods for combining probability with Description Logics (DLs). These methods are very useful to model real world domains, where incompleteness and uncertainty are common. This combination has become a fundamental component of the Semantic Web. Our work started with the development of a probabilistic semant...

This article continues our study of axiom systems that can verify their own consistency and prove all Peano Arithmetic’s Π1 theorems. We will develop some new types of exceptions for the Semantic Tableaux Version of the Second Incompleteness Theorem.

the existing literature on bantu verbal semantics demonstrated that inherent semantic content of verbs pairs directly with the selection of tense, aspect and modality formatives in bantu languages like chasu, lucazi, lusamia, and shiyeyi. thus, the gist of this paper is the articulation of semantic classification of verbs in kiswahili based on the selection of tam types. this is because the sem...

Modal correspondence theory is a powerful and effective way to guarantee that adding specific syntactic axioms to a modal logic is mirrored by requiring ‘corresponding’ properties of the underlying Kripke models. However, such axioms not only quantify over all formulas, but they are also global in the sense that the corresponding semantic property is assumed to hold for all states. However, in ...

We call a modal logic “pseudo-transitive” if it obeys the axiom A ⊃ A. The question whether the modal logic K extended with this axiom is decidable, is a known open problem. In this paper, I will present a cut-free deductive system which is sound and complete for that logic, and which is suitable for proof search. In fact, the system induces a terminating proof search procedure, which entails d...

The accomplishment model of average mental workload--a formal axiomatic measurement theory--was used as a basis for developing and testing secondary task indices of mental workload (H. A. Colle & G. B. Reid, 1997). Its cancellation axiom implies global sensitivity, which is an important theoretical and practical criterion for mental workload indices. Performance levels of different secondary ta...

We show that L(R) absoluteness for semi-proper forcings is equiconsistent with the existence of a remarkable cardinal, and hence by [6] with L(R) absoluteness for proper forcings. By [7], L(R) absoluteness for stationary set preserving forcings gives an inner model with a strong cardinal. By [3], the Bounded Semi-Proper Forcing Axiom (BSPFA) is equiconsistent with the Bounded Proper Forcing Axi...

Here we say that a real polynomial is hyperbolic or Axiom A, if the real line is the union of a repelling hyperbolic set, the basin of hyperbolic attracting periodic points and the basin of infinity. We call a C1 endomorphism of the compact interval (or the circle) hyperbolic if it has finitely many hyperbolic attracting periodic points and the complement of the basin of attraction of these poi...