•  59
    Sentential calculus for logical falsehoods
    Notre Dame Journal of Formal Logic 14 (3): 347-353. 1973.
  •  93
    Truth, falsehood, and contingency in first-order predicate calculus
    Notre Dame Journal of Formal Logic 14 (4): 536-542. 1973.
  •  120
    A Sound and Complete Proof Theory for Propositional Logical Contingencies
    with Alexander Hertel and Philipp Hertel
    Notre Dame Journal of Formal Logic 48 (4): 521-530. 2007.
    There are simple, purely syntactic axiomatic proof systems for both the logical truths and the logical falsehoods of propositional logic. However, to date no such system has been developed for the logical contingencies, that is, formulas that are both satisfiable and falsifiable. This paper formalizes the purely syntactic axiomatic proof systems for the logical contingencies and proves its soundness as well as completeness.
  •  104
    Probabilistic Canonical Models for Partial Logics
    Notre Dame Journal of Formal Logic 44 (3): 125-138. 2003.
    The aim of the paper is to develop the notion of partial probability distributions as being more realistic models of belief systems than the standard accounts. We formulate the theory of partial probability functions independently of any classical semantic notions. We use the partial probability distributions to develop a formal semantics for partial propositional calculi, with extensions to predicate logic and higher order languages. We give a proof theory for the partial logics and obtain soun…Read more
  •  132
    Weak Conditional Comparative Probability as a Formal Semantic Theory
    Mathematical Logic Quarterly 30 (13-16): 199-212. 1984.
  •  85
    Introduction
    Studia Logica 52 (2). 1993.
  •  240
    The nature of nonmonotonic reasoning
    Minds and Machines 10 (3): 321-360. 2000.
    Conclusions reached using common sense reasoning from a set of premises are often subsequently revised when additional premises are added. Because we do not always accept previous conclusions in light of subsequent information, common sense reasoning is said to be nonmonotonic. But in the standard formal systems usually studied by logicians, if a conclusion follows from a set of premises, that same conclusion still follows no matter how the premise set is augmented; that is, the consequence rela…Read more
  •  198
    Conditionals, probability, and nontriviality
    Journal of Philosophical Logic 24 (5): 455-467. 1995.
    We show that the implicational fragment of intuitionism is the weakest logic with a non-trivial probabilistic semantics which satisfies the thesis that the probabilities of conditionals are conditional probabilities. We also show that several logics between intuitionism and classical logic also admit non-trivial probability functions which satisfy that thesis. On the other hand, we also prove that very weak assumptions concerning negation added to the core probability conditions with the restric…Read more
  •  153
    Weak liberated versions of T and S
    Journal of Symbolic Logic 40 (1): 25-30. 1975.
    The usual semantics for the modal systems T, S4, and S5 assumes that the set of possible worlds contains at least one member. Recently versions of these modal systems have been developed in which this assumption is dropped. The systems discussed here are obtained by slightly weakening the liberated versions of T and S4. The semantics does not assume the existence of possible worlds, and the accessibility relation between worlds is only required to be quasi-reflexive instead of reflexive. Complet…Read more
  •  110
    Tuomela on deductive explanation
    Journal of Philosophical Logic 5 (4). 1976.
    Almost every formal model of explanation thus far proposed has been demonstrated to be faulty. In this paper, a new model, proposed by Raimo Tuomela, is also demonstrated to be faulty. In particular, one condition of the model is shown to be too restrictive, and another condition of the model is shown to be too permissive
  •  151
    In this paper we examine the thesis that the probability of the conditional is the conditional probability. Previous work by a number of authors has shown that in standard numerical probability theories, the addition of the thesis leads to triviality. We introduce very weak, comparative conditional probability structures and discuss some extremely simple constraints. We show that even in such a minimal context, if one adds the thesis that the probability of a conditional is the conditional proba…Read more
  •  135
    Systems of modal logic for impossible worlds
    Inquiry: An Interdisciplinary Journal of Philosophy 16 (1-4). 1973.
    The intuitive notion behind the usual semantics of most systems of modal logic is that of ?possible worlds?. Loosely speaking, an expression is necessary if and only if it holds in all possible worlds; it is possible if and only if it holds in some possible world. Of course, contradictory expressions turn out to hold in no possible worlds, and logically true expressions turn out to hold in every possible world. A method is presented for transforming standard modal systems into systems of modal l…Read more
  •  5
    Drawing Dichotomies Via Formal Languages
    Southern Journal of Philosophy 11 (3): 216-227. 2010.
  •  210