Partiality and Its Dual

This paper explores allowing truth value assignments to be undetermined or "partial" (no truth values) and overdetermined or "inconsistent" (both truth values), thus returning to an investigation of the four-valued semantics that I initiated in the sixties. I examine some natural consequence relations and show how they are related to existing logics, including ukasiewicz's three-valued logic, Kleene's three-valued logic, Anderson and Belnap's (first-degree) relevant entailments, Priest's "Logic of Paradox", and the first-degree fragment of the Dunn-McCall system "R-mingle". None of these systems have nested implications, and I investigate twelve natural extensions containing nested implications, all of which can be viewed as coming from natural variations on Kripke's semantics for intuitionistic logic. Many of these logics exist antecedently in the literature, in particular Nelson's "constructible falsity".     

Supererogation in Deontic Logic: Metatheory for DWE and Some Close Neighbours

In "Doing Well Enough: Toward a Logic for Common Sense Morality", Paul McNamara sets out a semantics for a deontic logic which contains the operator It is supererogatory that. As well as having a binary accessibility relation on worlds, that semantics contains a relative ordering relation, . For worlds u, v and w, we say that u w v when v is at least as good as u according to the standards of w. In this paper we axiomatize logics complete over three versions of the semantics. We call the strongest of these logics DWE for Doing Well Enough.     

A Projective Geometry for Separation Experiences

I present a projective geometry for out-of-body separation experiences, built up out of a series of higher space analogies and resulting diagrams. The model draws upon recent understandings of cosmic symmetries linking relativity theory to quantum physics. This perspective is grounded inside a more general hyperspace theory, supposing that our three dimensional space is embedded within a hierarchy of higher dimensions. Only the next higher space, the fourth dimension, is directly utilized in this exposition. At least two degrees of consciousness expansion are identified as prerequisites to a comprehensive phenomenological taxonomy of ecstatic out-of-body, near-death, and mystical/visionary experiences. The first assumes a partial spatiotemporalization of consciousness into a fractional domain located between three and four dimensions. The second assumes a complete spatiotemporalization into four dimensions. Partial expansions are associated with separation experiences and with thematically related activities of a seeming paranormal character. Complete expansions are associated with timeless life panoramas and with excursions into hyperphysical realms. The paper concentrates on partial expansions, in analyzing the psychodynamics underlying, and ostensive paranormal activities accompanying, separation experiences.     

The Definition of Moral Dilemmas: A Logical Confusion and a Clarification

This discussion note deals with Jurriaan de Haan's paper The Definition of Moral Dilemmas: A Logical Problem (Ethical Theory and Moral Practice 4(3), 2001, pp. 267–284). In the first, critical part I will point out a confusion in the logical analysis of the paper in question. In the second, constructive part I will indicate how the analysis of moral dilemmas should proceed within the framework of a possible world semantics.     

Interactions between Knowledge,Action and Commitment within Agent Dynamic Logic

This paper considers a new class of agent dynamic logics which provide a formal means of specifying and reasoning about the agents activities and informational, motivational and practical aspects of the behaviour of the agents. We present a Hilbert-style deductive system for a basic agent dynamic logic and consider a number of extensions of this logic with axiom schemata formalising interactions between knowledge and commitment (expressing an agent s awareness of her commitments), and interactions between knowledge and actions (expressing no learning and persistence of knowledge after actions). The deductive systems are proved sound and complete with respect to a Kripke-style semantics. Each of the considered logics is shown to have the small model property and therefore decidable.Presented by Ewa Orlowska     

Decidability of Quantified Propositional Intuitionistic Logic and S4 on Trees of Height and Arity ≤ω

Quantified propositional intuitionistic logic is obtained from propositional intuitionistic logic by adding quantifiers p, p, where the propositional variables range over upward-closed subsets of the set of worlds in a Kripke structure. If the permitted accessibility relations are arbitrary partial orders, the resulting logic is known to be recursively isomorphic to full second-order logic (Kremer, 1997). It is shown that if the Kripke structures are restricted to trees of at height and width at most , the resulting logics are decidable. This provides a partial answer to a question by Kremer. The result also transfers to modal S4 and some Gödel–Dummett logics with quantifiers over propositions.     

Disjunctive Quantum Logic in Dynamic Perspective

In Coecke (2002) we proposed the intuitionistic or disjunctive representation of quantum logic, i.e., a representation of the property lattice of physical systems as a complete Heyting algebra of logical propositions on these properties, where this complete Heyting algebra goes equipped with an additional operation, the operational resolution, which identifies the properties within the logic of propositions. This representation has an important application towards dynamic quantum logic, namely in describing the temporal indeterministic propagation of actual properties of physical systems. This paper can as such by conceived as an addendum to Quantum Logic in Intuitionistic Perspective that discusses spin-off and thus provides an additional motivation. We derive a quantaloidal semantics for dynamic disjunctive quantum logic and illustrate it for the particular case of a perfect (quantum) measurement.     

FOIL Axiomatized

In an earlier paper, [5], I gave semantics and tableau rules for a simple firstorder intensional logic called FOIL, in which both objects and intensions are explicitly present and can be quantified over. Intensions, being non-rigid, are represented in FOIL as (partial) functions from states to objects. Scoping machinery, predicate abstraction, is present to disambiguate sentences like that asserting the necessary identity of the morning and the evening star, which is true in one sense and not true in another.In this paper I address the problem of axiomatizing FOIL. I begin with an interesting sublogic with predicate abstraction and equality but no quantifiers. In [2] this sublogic was shown to be undecidable if the underlying modal logic was at least K4, though it is decidable in other cases. The axiomatization given is shown to be complete for standard logics without a symmetry condition. The general situation is not known. After this an axiomatization for the full FOIL is given, which is straightforward after one makes a change in the point of view.This paper is a version of the invited talk given by the author at the conference Trends in Logic III, dedicated to the memory of A. MOSTOWSKI, H. RASIOWA and C. RAUSZER, and held in Warsaw and Ruciane-Nida from 23rd to 25th September 2005.     

Dynamic Topological Completeness for

Dynamic topological logic (DTL) combines topological and temporalmodalities to express asymptotic properties of dynamic systemson topological spaces. A dynamic topological model is a tripleX ,f , V , where X is a topological space, f : X X a continuousfunction and V a truth valuation assigning subsets of X to propositionalvariables. Valid formulas are those that are true in every model,independently of X or f. A natural problem that arises is toidentify the logics obtained on familiar spaces, such as . It [9] it was shown that any satisfiable formulacould be satisfied in some for n large enough, but the question of how the logic varieswith n remained open. In this paper we prove that any fragment of DTL that is completefor locally finite Kripke frames is complete for . This includes DTL; it also includes some largerfragments, such as DTL₁, where "henceforth" may not appear inthe scope of a topological operator. We show that satisfiabilityof any formula of our language in a locally finite Kripke frameimplies satisfiability in by constructing continuous, open maps from the plane intoarbitrary locally finite Kripke frames, which give us a typeof bisimulation. We also show that the results cannot be extendedto arbitrary formulas of DTL by exhibiting a formula which isvalid in but not in arbitrarytopological spaces.     

Axiomatizing collective judgment sets in a minimal logical language

We investigate under what conditions a given set of collective judgments can arise from a specific voting procedure. In order to answer this question, we introduce a language similar to modal logic for reasoning about judgment aggregation procedures. In this language, the formula expresses that is collectively accepted, or that is a group judgment based on voting. Different judgment aggregation procedures may be underlying the group decision making. Here we investigate majority voting, where holds if a majority of individuals accepts, consensus voting, where holds if all individuals accept, and dictatorship. We provide complete axiomatizations for judgment sets arising from all three aggregation procedures.     

Varisim: A new machine method for orthogonal rotation

The derivative of Kaiser's Varimax criterion, if set to zero, yields a set of equations which are quite similar to those obtained for a least-squares problem of the Procrustes type. This similarity suggested an iterative technique for orthogonal rotation, dubbed Varisim, which was programmed for the IBM 7094 in FORTRAN. An empirical comparison between Varimax and Varisim, which was based on a number of data sets taken from the literature yielded three major results so far: (i) Varisim is slower than Varimax, roughly by a factor of 3, (ii) Varisim yields factors which in general contribute more evenly to the common test variance than Varimax factors, and which (iii) line up more closely with oblique configurations obtained with Binormamin than Varimax factors.This paper is based on parts of a thesis submitted to the Graduate College of the University of Illinois in partial fulfillment of the requirements for a degree in Psychology. Some of its contents were read at the joint meeting of the Psychonomic and the Psychometric Society, Niagara Falls, Ontario, 1964. Most of the computer-bound work was carried out while the author was employed by the Statistical Service Unit, University of Illinois; it was written up while the author held a Postdoctoral Fellowship at the Psychometric Laboratory of the University of North Carolina. Although space limitations forbid more complete acknowledgments, I am bound to record my deep gratitude to my advisor, Prof. H. F. Kaiser.     

The Undecidability of Propositional Adaptive Logic

We investigate and classify the notion of final derivability of two basic inconsistency-adaptive logics. Specifically, the maximal complexity of the set of final consequences of decidable sets of premises formulated in the language of propositional logic is described. Our results show that taking the consequences of a decidable propositional theory is a complicated operation. The set of final consequences according to either the Reliability Calculus or the Minimal Abnormality Calculus of a decidable propositional premise set is in general undecidable, and can be -complete. These classifications are exact. For first order theories even finite sets of premises can generate such consequence sets in either calculus.     

The Undecidability of Iterated Modal Relativization

In dynamic epistemic logic and other fields, it is natural to consider relativization as an operator taking sentences to sentences. When using the ideas and methods of dynamic logic, one would like to iterate operators. This leads to iterated relativization. We are also concerned with the transitive closure operation, due to its connection to common knowledge. We show that for three fragments of the logic of iterated relativization and transitive closure, the satisfiability problems are fi1 ¹₁–complete. Two of these fragments do not include transitive closure. We also show that the question of whether a sentence in these fragments has a finite (tree) model is fi0 ⁰₁–complete. These results go via reduction to problems concerning domino systems.     

Praise,blame, and demandingness

Consequentialism has been challenged on the grounds that it is too demanding. I will respond to the problem of demandingness differently from previous accounts. In the first part of the paper, I argue that consequentialism requires us to distinguish the justification of an act \(\varphi\) from the justification of an act \(\psi\), where \(\psi\) is an act of praise or blame. In the second part of the paper, I confront the problem of demandingness. I do not attempt to rule out the objection; instead, I argue that if certain plausible empirical claims about moral motivation are true, we morally ought not to blame people for failing to meet certain very demanding obligations. With this theory, we create a space in consequentialism for intuitions questioning the plausibility of demanding obligations. I conclude the paper by showing that separate justifications for \(\varphi\) and \(\psi\) may also give us a theoretical niche for intuitions about supererogation.     

Quantum Logic as a Fragment of Independence-Friendly Logic

The working assumption of this paper is that noncommuting variables are irreducibly interdependent. The logic of such dependence relations is the author's independence-friendly (IF) logic, extended by adding to it sentence-initial contradictory negation ¬ over and above the dual (strong) negation . Then in a Hilbert space turns out to express orthocomplementation. This can be extended to any logical space, which makes it possible to define the dimension of a logical space. The received Birkhoff and von Neumann quantum logic can be interpreted by taking their disjunction to be ¬(A & B). Their logic can thus be mapped into a Boolean structure to which an additional operator has been added.     

On Extensions of Intermediate Logics by Strong Negation

In this paper we will study the properties of the least extension n() of a given intermediate logic by a strong negation. It is shown that the mapping from to n() is a homomorphism of complete lattices, preserving and reflecting finite model property, frame-completeness, interpolation and decidability. A general characterization of those constructive logics is given which are of the form n (). This summarizes results that can be found already in [13,14] and [4]. Furthermore, we determine the structure of the lattice of extensions of n(LC).     

A Gabbay-Rule Free Axiomatization of T×W Validity

The semantical structures called T×W frames were introduced in (Thomason, 1984) for the Ockhamist temporal-modal language, _O, which consists of the usual propositional language augmented with the Priorean operators P and F and with a possibility operator . However, these structures are also suitable for interpreting an extended language, _SO, containing a further possibility operator ^s which expresses synchronism among possibly incompatible histories and which can thus be thought of as a cross-history simultaneity operator. In the present paper we provide an infinite set of axioms in _SO, which is shown to be strongly complete forT ×W-validity. Von Kutschera (1997) contains a finite axiomatization of T×W-validity which however makes use of the Gabbay Irreflexivity Rule (Gabbay, 1981). In order to avoid using this rule, the proof presented here develops a new technique to deal with reflexive maximal consistent sets in Henkin-style constructions.     

A Theory of Hypermodal Logics: Mode Shifting in Modal Logic

A hypermodality is a connective whose meaning depends on where in the formula it occurs. The paper motivates the notion and shows that hypermodal logics are much more expressive than traditional modal logics. In fact we show that logics with very simple K hypermodalities are not complete for any neighbourhood frames.     

The Logic and Meaning of Plurals. Part II

In this sequel to “The logic and meaning of plurals. Part I”, I continue to present an account of logic and language that acknowledges limitations of singular constructions of natural languages and recognizes plural constructions as their peers. To this end, I present a non-reductive account of plural constructions that results from the conception of plurals as devices for talking about the many. In this paper, I give an informal semantics of plurals, formulate a formal characterization of truth for the regimented languages that results from augmenting elementary languages with refinements of basic plural constructions of natural languages, and account for the logic of plural constructions by characterizing the logic of those regimented languages.