Notes on conditional logic

This paper consists of some lecture notes in which conditional logic is treated as an extension of modal logic. Completeness and filtration theorems are provided for some basis systems. These notes were originally drafted for a course given at the University of Auckland in 1987 (Philosophy 29.308). The work reported in Section 5 is due to Michael Strevens, who took the course and presented his conception of a filtration in a term paper [5]. The author wishes to thank Strevens for many stimulating discussions and for permission to include his results here     

The dynamic turn in quantum logic

In this paper we show how ideas coming from two areas of research in logic can reinforce each other. The first such line of inquiry concerns the ??dynamic turn?? in logic and especially the formalisms inspired by Propositional Dynamic Logic (PDL); while the second line concerns research into the logical foundations of Quantum Physics, and in particular the area known as Operational Quantum Logic, as developed by Jauch and Piron (Helve Phys Acta 42:842?C848, 1969), Piron (Foundations of Quantum Physics, 1976). By bringing these areas together we explain the basic ingredients of Dynamic Quantum Logic, a new direction of research in the logical foundations of physics.     

A conditional logic for abduction

We propose a logic of abduction that (i) provides an appropriate formalization of the explanatory conditional, and that (ii) captures the defeasible nature of abductive inference. For (i), we argue that explanatory conditionals are non-classical, and rely on Brian Chellas’s work on conditional logics for providing an alternative formalization of the explanatory conditional. For (ii), we make use of the adaptive logics framework for modeling defeasible reasoning. We show how our proposal allows for a more natural reading of explanatory relations, and how it overcomes problems faced by other systems in the literature.     

Revision algebra semantics for conditional logic

The properties of belief revision operators are known to have an informal semantics which relates them to the axioms of conditional logic. The purpose of this paper is to make this connection precise via the model theory of conditional logic. A semantics for conditional logic is presented, which is expressed in terms of algebraic models constructed ultimately out of revision operators. In addition, it is shown that each algebraic model determines both a revision operator and a logic, that are related by virtue of the stable Ramsey test.The author is grateful for a correction and several other valuable suggestions of two anonymous referees. This work was supported by the McDonnell Douglas Independent Research and Development program.     

A gentzen system for conditional logic

Conditional logic is the deductive system , where is the set of propositional connectives {, ,} and is the structural finitary consequence relation on the absolutely free algebra that preserves degrees of truth over the structure of truth values C, . HereC is the non-commutative regular extension of the 2-element Boolean algebra to 3 truth values {t, u, f}, andf<u<t. In this paper we give a Gentzen type axiomatization for conditional logic.Presented byJan Zygmunt     

The principle of excluded middle in quantum logic

The principle of excluded middle is the logical interpretation of the law V A v in an orthocomplemented lattice and, hence, in the lattice of the subspaces of a Hilbert space which correspond to quantum mechanical propositions. We use the dialogic approach to logic in order to show that, in addition to the already established laws of effective quantum logic, the principle of excluded middle can also be founded. The dialogic approach is based on the very conditions under which propositions can be confirmed by measurements. From the fact that the principle of excluded middle can be confirmed for elementary propositions which are proved by quantum mechanical measurements, we conclude that this principle is inherited by all finite compound propositions. For this proof it is essential that, in the dialog-game about a connective, a finite confirmation strategy for the mutual commensurability of the subpropositions is used.     

Completeness of quantum logic

This paper is based on a semantic foundation of quantum logic which makes use of dialog-games. In the first part of the paper the dialogic method is introduced and under the conditions of quantum mechanical measurements the rules of a dialog-game about quantum mechanical propositions are established. In the second part of the paper the quantum mechanical dialog-game is replaced by a calculus of quantum logic. As the main part of the paper we show that the calculus of quantum logic is complete and consistent with respect to the dialogic semantics. Since the dialog-game does not involve the excluded middle the calculus represents a calculus of effective (intuitionistic) quantum logic.In a forthcoming paper it is shown that this calculus is equivalent to a calculus of sequents and more interestingly to a calculus of propositions. With the addition of the excluded middle the latter calculus is a model for the lattice of subspaces of a Hilbert space.On leave of absence from the Institut für Theoretische Physik der Universität zu Köln, W.-Germany.