A completeness theorem for the general interpreted modal calculus of A. Bressan
A completeness theorem in the modal logic of programs
A criterion for admissibility of inference rules in some class of S4-logics without the branching property.
A First-Order Conditional Probability Logic With Iterations
A formalization of the Lewis system S1 without rules of substitution.
In the Lewis and Langford formalization of system S1 (1932), besides the deduction rules, the substitution rules are as well used: the uniform substitution and the substitution of strict equivalents. They then obtain systems S2, S3, S4 and S5 adding to the axioms of S1 a new axiom, respectively, without changing the deduction rules. Lemmon (1957) gives a new formalization of systems S1-S5, calling them P1-P5. Is is worthwhile to remark that in the formalization of P2-P5 one does not use any more...
A general deduction theorem.
In this paper we present a very general deduction theorem which -based upon a uniform notion of proof from hypotheses- holds for a very large class of logical systems. Most of the known results for classical and modal logics, as well as new results, are immediate corollaries of this theorem.
A logical analysis of the truth-reaction paradox
A modal logic of consistency
A note on categories enriched in quantaloids and modal and temporal logic
A possible modal reformulation of comprehension scheme
A Semantical Analysis of Implicational System I and of the First Degree of Entailment.
A semantical hierarchy for modal formulas.
In this paper a semantical partition, relative to Kripke models, is introduced for sets of formulas. Secondly, this partition is used to generate a semantical hierarchy for modal formulas. In particular some results are given for the propositional calculi T and S4.
A Tableaux System in Modal Logic
Absence of the interpolation property in the calculi and .
Algebraic and relational semantics for tense logics
An admissibility criterion for inference rules with metavariables in the modal logic S4.
An axiom system for incidence spatial geometry.
Incidence spatial geometry is based on three-sorted structures consisting of points, lines and planes together with three intersort binary relations between points and lines, lines and planes and points and planes. We introduce an equivalent one-sorted geometrical structure, called incidence spatial frame, which is suitable for modal considerations. We are going to prove completeness by SD-Theorem. Extensions to projective, affine and hyperbolic geometries are also considered.
An explicit basis for the admissible inference rules in the Gödel-Löb logic GL.
An explicit basis for the admissible inference rules of the modal logics extending S4.1 and Grz.
An inheritance criterion for the admissible inference rules of K4.