Necessity and Relative Contingency

Abstract

The paper introduces a contingential language extended with a propositional constant τ axiomatized in a system named KΔτ , which receives a semantical analysis via relational models. A definition of the necessity operator in terms of Δ and τ allows proving (i) that KΔτ is equivalent to a modal system named K□τ (ii) that both KΔτ and K□τ are tableau-decidable and complete with respect to the defined relational semantics (iii) that the modal τ -free fragment of KΔτ is exactly the deontic system KD. In §4 it is proved that the modal τ -free fragment of a system KΔτw weaker than KΔτ is exactly the minimal normal system K.