Modal and Intensional Logic, Misc

This paper investigates the logic of reasons. Its aim is to provide an analysis of the sentences of the form ‘p is a reason for q’ that yields a coherent account of their logical properties. The idea that we will develop is that ‘p is a reason for q’ is acceptable just in case a suitably defined relation of incompatibility obtains between p and ¬q. As we will suggest, a theory of reasons based on this idea can solve three challenging (...) puzzles that concern, respectively, contraposing reasons, conflicting reasons, and supererogatory reasons, and opens a new perspective on some classical issues concerning non-deductive inferences. (shrink)

This paper investigates and develops generalizations of two-dimensional modal logics to any finite dimension. These logics are natural extensions of multidimensional systems known from the literature on logics for a priori knowledge. We prove a completeness theorem for propositional n-dimensional modal logics and show them to be decidable by means of a systematic tableau construction.

We employ a recently developed methodology -- called "structural refinement" -- to extract nested sequent systems for a sizable class of intuitionistic modal logics from their respective labelled sequent systems. This method can be seen as a means by which labelled sequent systems can be transformed into nested sequent systems through the introduction of propagation rules and the elimination of structural rules, followed by a notational translation. The nested systems we obtain incorporate propagation rules that are parameterized with formal grammars, (...) and which encode certain frame conditions expressible as first-order Horn formulae that correspond to a subclass of the Scott-Lemmon axioms. We show that our nested systems are sound, cut-free complete, and admit hp-admissibility of typical structural rules. (shrink)

We study the general problem of axiomatizing structures in the framework of modal logic and present a uniform method for complete axiomatization of the modal logics determined by a large family of classes of structures of any signature.

We propose a generalization of Sahlqvist formulas to polyadic modal languages by representing such languages in a combinatorial PDL style and thus, in particular, developing what we believe to be the right syntactic approach to Sahlqvist formulas at all. The class of polyadic Sahlqvist formulas PSF defined here expands essentially the so far known one. We prove first-order definability and canonicity for the class PSF.

A supplemental document for "Metalinguistic Gradability".