In  a semantics for implication is offered that makes use of stories — sets of sentences assembled under various constraints. Sentences are evaluated at an actual world and in each member of a set of stories. A sentence B is true in a story s just when B s. A implies B iff for all stories and the actual world, whenever A is true, B is true. In this article the first-order language of  is extended by the addition (...) of the operator the story... says that..., as in The story Flashman among the Redskins says that Flashman met Sitting Bull. The resulting language is shown to be sound and complete. (shrink)
By the standards presented in the Introduction, CMFC2 is deficient on at least one ontological ground: ‘∀’ is a syncategorematic expression and so CMFC2 is not an ideal language. To some there may be an additional difficulty: any two wffs provably equivalent in the classical sense are provably identical. We hope in sequel to present systems free of these difficulties, free either of one or the other, or perhaps both.This work was done with the aid of Canada Council Grant S74-0551-S1.
Three views on definite descriptions are summarized and discussed, including that of P. F. Strawson in which reference failure results in lack of truth value. When reference failure is allowed, a problem arises concerning Universal Instantiation. Van Fraassen solves the problem by the use of supervaluations, preserving as well such theorems as a=a, and Fa or ~Fa, even when the term a fails to refer. In the present paper a form of relevant, quasi-analytic implication is set out which allows reference (...) failure to infect even a=a and Fa or ~Fa with lack of truth-value. Reference failure causes lack of truth-value in a subwff to spread throughout any wff built up by the classical connectives. As a result none of the classical first-order axiom schemes remain as axiom schemes in the system presented. (shrink)
In this paper a system, RPF, of second-order relevance logic with S5 necessity is presented which contains a defined, notion of identity for propositions. A complete semantics is provided. It is shown that RPF allows for more than one necessary proposition. RPF contains primitive syntactic counterparts of the following semantic notions: (1) the reflexive, symmetrical, transitive binary alternativeness relation for S5 necessity, (2) the ternary Routley-Meyer alternativeness relation for implication, and (3) the Routley-Meyer notion of a prime intensional theory, as (...) well as defined syntactic counterparts, of the semantic notions of a possible world and the Routley-Meyer * operator. (shrink)
In ‘Reincarnation and Relativized Identity’ 1 J. J. MacIntosh argues that reincarnation is impossible. I wish to make a slightly backhanded defence of reincarnation by showing that MacIntosh's argument does not succeed. I do not follow his recipe for defence of reincarnation exactly.