Most probabilistic extensions of description logics focus on the terminological apparatus. While some allow for expressing probabilistic knowledge about concept assertions, systems which can express… (More)

We study the proof theoretic relationship between several deductive systems for the modal mu-calculus. This results in a completeness proof for a system that is suitable for deciding the validity… (More)

An ontologically transparent semantics for justifications that interprets justifications as sets of formulas they justify has been recently presented by Artemov. However, this semantics of modular… (More)

In relational database systems a combination of privileges and views is employed to limit a user’s access and to hide non-public data. The data privacy problem is to decide whether the views leak… (More)

This paper presents a new model construction for a natural cut-free infinitary version Kω (μ) of the propositional modal μ-calculus. Based on that the completeness of Kω (μ) and the related system… (More)

Starting off from the infinitary system for common knowledge over multi-modal epistemic logic presented in Alberucci and Jäger [1], we apply the finite model property to “finitize” this deductive… (More)

In this paper we discuss extensions of Feferman’s theory T0 for explicit mathematics by the so-called limit and Mahlo axioms and present a novel approach to constructing natural recusion-theoretic… (More)

We show that the addition of name induction to the theory EETJ + (LEM-IN) of explicit elementary types with join yields a theory proof-theoretically equivalent to ID1.

This paper deals with universes in explicit mathematics. After introducing some basic definitions, the limit axiom and possible ordering principles for universes are discussed. Later, we turn to… (More)