Meeting strength in substructural logics

This paper contributes to the theory of hybrid substructural logics, i.e. weak logics given by a Gentzen-style proof theory in which there is only alimited possibility to use structural rules. Following the literture, we use an operator to mark formulas to which the extra structural rules may be applied. New in our approach is that we do not see this as a modality, but rather as themeet of the marked formula with a special typeQ. In this way we can make the specific structural behaviour of marked formulas more explicit.The main motivation for our approach is that we can provide a nice, intuitive semantics for hybrid substructural logics. Soundness and completeness for this semantics are proved; besides this we consider some proof-theoretical aspects like cut-elimination and embeddings of the strong system in the hybrid one.Presented byMelvin Fitting     

Modal companions of intermediate propositional logics

This paper is a survey of results concerning embeddings of intuitionistic propositional logic and its extensions into various classical modal systems.     

Modal logics with the Macintosh rule

Conclusion Having gained some idea of what MacIntosh logics there are, we conclude this paper with a remark about the totality of them. Let theterritory of a rule or condition be the class of all modal logics that have the rule or satisfy the condition. What is MacIntosh territory, the class of all normal logics with the MacIntosh rule, like? What is its structure?We are especially indebted to Max Cresswell, Rob Goldblatt, Steve Kuhn, Jack MacIntosh, Tamara Ollenberg, and Tim Williamson for very helpful contributions along the way to the present version of this essay. Elements of it were presented by Chellas at a miniconference on Issues in Philosophical and Mathematical Logic, in Devonport, New Zealand, 11–12 May 1991, at a South West Logic Workshop in Seattle, Washington, 20 July 1991, and at a meeting of the Florida Philosophical Association in Boca Raton, Florida, 8 November 1991. We wish to thank all who offered comments at those gatherings. An earlier version of the paper appeared in the Auckland Philosophy Papers series of the Department of Philosophy, University of Auckland, in May 1991.     

Modal logics with no minimal proper extensions

We show that neither the descending chain property nor the finite model property is a necessary condition for a model logic having no minimal proper extension. This answers in the negative two questions raised by G. E. Hughes.     

Modal logics of domains on the real plane

This paper concerns modal logics appearing from the temporal ordering of domains in two-dimensional Minkowski spacetime. As R. Goldblatt has proved recently, the logic of the whole plane isS4.2. We consider closed or open convex polygons and closed or open domains bounded by simple differentiable curves; this leads to the logics:S4,S4.1,S4.2 orS4.1.2.     

Criteria for admissibility of inference rules. Modal and intermediate logics with the branching property

The main result of this paper is the following theorem: each modal logic extendingK4 having the branching property belowm and the effective m-drop point property is decidable with respect to admissibility. A similar result is obtained for intermediate intuitionistic logics with the branching property belowm and the strong effective m-drop point property. Thus, general algorithmic criteria which allow to recognize the admissibility of inference rules for modal and intermediate logics of the above kind are found. These criteria are applicable to most modal logics for which decidability with respect to admissibility is known and to many others, for instance, to the modal logicsK4,K4.1,K4.2,K4.3,S4.1,S4.2,GL.2; to all smallest and greatest counterparts of intermediate Gabbay-De-Jong logicsD _n; to all intermediate Gabbay-De-Jong logicsD _n; to all finitely axiomatizable modal and intermediate logics of finite depth etc. Semantic criteria for recognizing admissibility for these logics are offered as well.The results of this paper were obtained by the author during a stay at the Free University of Berlin with support of the Alexander von Humboldt Foundation in 1992 – 1993.Presented byWolfgang Rauntenberg     

Justification logics and hybrid logics

Hybrid logics internalize their own semantics. Members of the newer family of justification logics internalize their own proof methodology. It is an appealing goal to combine these two ideas into a single system, and in this paper we make a start. We present a hybrid/justification version of the modal logic T. We give a semantics, a proof theory, and prove a completeness theorem. In addition, we prove a Realization Theorem, something that plays a central role for justification logics generally. Since justification logics are newer and less well known than hybrid logics, we sketch their background, and give pointers to their range of applicability. We conclude with suggestions for future research. Indeed, the main goal of this paper is to encourage others to continue the investigation begun here.     

Protoalgebraic logics

There exist important deductive systems, such as the non-normal modal logics, that are not proper subjects of classical algebraic logic in the sense that their metatheory cannot be reduced to the equational metatheory of any particular class of algebras. Nevertheless, most of these systems are amenable to the methods of universal algebra when applied to the matrix models of the system. In the present paper we consider a wide class of deductive systems of this kind called protoalgebraic logics. These include almost all (non-pathological) systems of prepositional logic that have occurred in the literature. The relationship between the metatheory of a protoalgebraic logic and its matrix models is studied. The following results are obtained for any finite matrix model U of a filter-distributive protoalgebraic logic : (I) The extension _U of is finitely axiomatized (provided has only finitely many inference rules); (II) _U has only finitely many extensions.     

Interpolation in non-classical logics

We discuss the interpolation property on some important families of non classical logics, such as intuitionistic, modal, fuzzy, and linear logics. A special paragraph is devoted to a generalization of the interpolation property, uniform interpolation. Supported by PRIN project 2006/2007 ‘Large-scale development of certified mathematical proofs’.     

An algebraic approach to intuitionistic modal logics in connection with intermediate predicate logics

Modal counterparts of intermediate predicate logics will be studied by means of algebraic devise. Our main tool will be a construction of algebraic semantics for modal logics from algebraic frames for predicate logics. Uncountably many examples of modal counterparts of intermediate predicate logics will be given. Dedicated to Prof. T. Umezawa on his 60th birthday     

Many-valued computational logics

This research was supported by the Natural Sciences and Engineering Research Council of Canada under grant A9136.     

Filter distributive logics

The present paper is thought as a formal study of distributive closure systems which arise in the domain of sentential logics. Special stress is laid on the notion of a C-filter, playing the role analogous to that of a congruence in universal algebra. A sentential logic C is called filter distributive if the lattice of C-filters in every algebra similar to the language of C is distributive. Theorem IV.2 in Section IV gives a method of axiomatization of those filter distributive logics for which the class Matr (C) _prime of C-prime matrices (models) is axiomatizable. In Section V, the attention is focused on axiomatic strengthenings of filter distributive logics. The theorems placed there may be regarded, to some extent, as the matrix counterparts of Baker's well-known theorem from universal algebra [9, § 62, Theorem 2].The contents of this paper were presented in a talk at the 7th International Congress of Logic, Methodology and Philosophy of Science held at Salzburg, Austria, in July 1983. In abstracted form the paper was published in Abstracts of the 7th Congress, Vol. 2, pp. 39– 42. We take this opportunity to thank Professor Paul Weingartner and Doctor Georg Dorn from Salzburg for their (not fulfilled) wish to publish the present version in a special volume containing a selection of contributions to the 7th Congress.     

Maximal weakly-intuitionistic logics

This article introduces the three-valuedweakly-intuitionistic logicI ¹ as a counterpart of theparaconsistent calculusP ¹ studied in [11].I ¹ is shown to be complete with respect to certainthree-valued matrices. We also show that in the sense that any proper extension ofI ¹ collapses to classical logic.The second part shows thatI ¹ is algebraizable in the sense of Block and Pigozzi (cf. [2]) in a way very similar to the algebraization ofP ¹ given in [8].In the last part of the paper we suggest the definition of certain hierarchies of finite-valued propositional paraconsistent and weakly-intuitionistic calculi, and comment on their intrinsic interest.