Conditional logics were originally developed for the purpose of modeling intuitively correct modes of reasoning involving conditional—especially counterfactual—expressions in natural language. While the debate over the logic of conditionals is as old as propositional logic, it was the development of worlds semantics for modal logic in the past century that catalyzed the rapid maturation of the field. Moreover, like modal logic, conditional logic has subsequently found a wide array of uses, from the traditional (e.g. counterfactuals) to the exotic (e.g. conditional (...) obligation). Despite the close connections between conditional and modal logic, both the technical development and philosophical exploitation of the latter has outstripped that of the former, with the result that noticeable lacunae exist in the literature on conditional logic. My dissertation addresses a number of these underdeveloped frontiers, producing new technical insights and philosophical applications. -/- I contribute to the solution of a problem posed by Priest of finding sound and complete labeled tableaux for systems of conditional logic from Lewis' V-family. To develop these tableaux, I draw on previous work on labeled tableaux for modal and conditional logic; errors and shortcomings in recent work on this problem are identified and corrected. While modal logic has by now been thoroughly studied in non-classical contexts, e.g. intuitionistic and relevant logic, the literature on conditional logic is still overwhelmingly classical. Another contribution of my dissertation is a thorough analysis of intuitionistic conditional logic, in which I utilize both algebraic and worlds semantics, and investigate how several novel embedding results might shed light on the philosophical interpretation of both intuitionistic logic and conditional logic extensions thereof. -/- My dissertation examines deontic and connexive conditional logic as well as the underappreciated history of connexive notions in the analysis of conditional obligation. The possibility of interpreting deontic modal logics in such systems (via embedding results) serves as an important theoretical guide. A philosophically motivated proscription on impossible obligations is shown to correspond to, and justify, certain (weak) connexive theses. Finally, I contribute to the intensifying debate over counterpossibles, counterfactuals with impossible antecedents, and take—in contrast to Lewis and Williamson—a non-vacuous line. Thus, in my view, a counterpossible like "If there had been a counterexample to the law of the excluded middle, Brouwer would not have been vindicated" is false, not (vacuously) true, although it has an impossible antecedent. I exploit impossible (non-normal) worlds—originally developed to model non-normal modal logics—to provide non-vacuous semantics for counterpossibles. I buttress the case for non-vacuous semantics by making recourse to both novel technical results and theoretical considerations. (shrink)

A system for the modal logic K furnishes a simple mechanical process for proving theorems.

In this paper, I explore a question about deductive reasoning: why am I in a position to immediately infer some deductive consequences of what I know, but not others? I show why the question cannot be answered in the most natural ways of answering it, in particular in Descartes’s way of answering it. I then go on to introduce a new approach to answering the question, an approach inspired by Hume’s view of inductive reasoning.

Predicates are term-to-sentence devices, and operators are sentence-to-sentence devices. What Kaplan and Montague's Paradox of the Knower demonstrates is that necessity and other modalities cannot be treated as predicates, consistent with arithmetic; they must be treated as operators instead. Such is the current wisdom.A number of previous pieces have challenged such a view by showing that a predicative treatment of modalities neednot raise the Paradox of the Knower. This paper attempts to challenge the current wisdom in another way as well: (...) to show that mere appeal to modal operators in the sense of sentence-to-sentence devices is insufficient toescape the Paradox of the Knower. A family of systems is outlined in which closed formulae can encode other formulae and in which the diagonal lemma and Paradox of the Knower are thereby demonstrable for operators in this sense. (shrink)

One of the most interesting and entertaining philosophical discussions of the last few decades is the discussion between Daniel Dennett and John Searle on the existence of intrinsic intentionality. Dennett denies the existence of phenomena with intrinsic intentionality. Searle, however, is convinced that some mental phenomena exhibit intrinsic intentionality. According to me, this discussion has been obscured by some serious misunderstandings with regard to the concept ‘intrinsic intentionality’. For instance, most philosophers fail to realize that it is possible that the (...) intentionality of a phenomenon is partly intrinsic and partly observer relative. Moreover, many philosophers are mixing up the concepts ‘original intentionality’ and ‘intrinsic intentionality’. In fact, there is, in the philosophical literature, no strict and unambiguous definition of the concept ‘intrinsic intentionality’. In this article, I will try to remedy this. I will also try to give strict and unambiguous definitions of the concepts ‘observer relative intentionality’, ‘original intentionality’, and ‘derived intentionality’. These definitions will be used for an examination of the intentionality of formal mathematical systems. In conclusion, I will make a comparison between the (intrinsic) intentionality of formal mathematical systems on the one hand, and the (intrinsic) intentionality of human beings on the other hand. (shrink)

Un libro de texto de lógica, argumentación y razonamiento probabilístico que he estado escribiendo durante los últimos años. Lo he usado para clases en bachillerato, licenciatura y posgrado. Está incompleto todavía, pero las primeras tres partes (argumentación, lógica proposicional, y cuantificación) están completas a un 85%, aproximadamente. Si lo usas, me ayudarías mucho mandándome comentarios, críticas y cualquier sugerencia.

In this paper I discuss Ernst Zermelo’s ideas concerning the possibility of developing a system of infinitary logic that, in his opinion, should be suitable for mathematical inferences. The presentation of Zermelo’s ideas is accompanied with some remarks concerning the development of infinitary logic. I also stress the fact that the second axiomatization of set theory provided by Zermelo in 1930 involved the use of extremal axioms of a very specific sort.1.

One of Tarski’s stated aims was to give an explication of the classical conception of truth—truth as ‘saying it how it is’. Many subsequent commentators have felt that he achieved this aim. Tarski’s core idea of defining truth via satisfaction has now found its way into standard logic textbooks. This paper looks at such textbook definitions of truth in a model for standard first-order languages and argues that they fail from the point of view of explication of the classical notion (...) of truth. The paper furthermore argues that a subtly different definition—also to be found in classic textbooks but much less prevalent than the kind of definition that proceeds via satisfaction—succeeds from this point of view. (shrink)

An account of validity that makes what is invalid conditional on how many individuals there are is what I call a conditional account of validity. Here I defend conditional accounts against a criticism derived from Etchemendy’s well-known criticism of the model-theoretic analysis of validity. The criticism is essentially that knowledge of the size of the universe is non-logical and so by making knowledge of the extension of validity depend on knowledge of how many individuals there are, conditional accounts fail to (...) reflect that the former knowledge is basic, i.e., independent of knowledge derived from other sciences. Appealing to Russell’s pre-Principia logic, I defend conditional accounts against this criticism by sketching a rationale for thinking that there are infinitely many logical objects. (shrink)

What accounts for how we know that certain rules of reasoning, such as reasoning by Modus Ponens, are valid? If our knowledge of validity must be based on some reasoning, then we seem to be committed to the legitimacy of rule-circular arguments for validity. This paper raises a new difficulty for the rule-circular account of our knowledge of validity. The source of the problem is that, contrary to traditional wisdom, a universal generalization cannot be inferred just on the basis of (...) reasoning about an arbitrary object. I argue in favor of a more sophisticated constraint on reasoning by universal generalization, one which undermines a rule-circular account of our knowledge of validity. (shrink)

Bertrand Russell’s 1906 article ‘The Theory of Implication’ contains an algebraic weak completeness proof for classical propositional logic. Russell did not present it as such. We give an exposition of the proof and investigate Russell’s view of what he was about, whether he could have appreciated the proof for what it is, and why there is no parallel of the proof in Principia Mathematica.

A person who does not have good intellectual reasons for believing in God can, depending on his probabilities and values for consequences of believing, have good practical reasons. Pascalian wagers founded on a variety of possible probability/value profiles are examined from a Bayesian perspective central to which is the idea that states and options are pragmatically reasonable only if they maximize subjective expected value. Attention is paid to problems posed by representations of values by Cantorian infinities. An appendix attends to (...) Robinsonian hyperreals. Another appendix presents for comparison Newcomb's Problem and a problem in some ways like it suggested, I think, by ideas of John Calvin. (shrink)

The paper critically scrutinizes the widespread idea that Russell subscribes to a "Universalist Conception of Logic." Various glosses on this somewhat under-explained slogan are considered, and their fit with Russell's texts and logical practice examined. The results of this investigation are, for the most part, unfavorable to the Universalist interpretation.

Is formal logic a failure? It may be, if we accept the context-independent limits imposed by Russell, Frege, and others. In response to difficulties arising from such limitations I present a Toulmin-esque social recontextualization of formal logic. The results of my project provide a positive view of formal logic as a success while simultaneously reaffirming the social and contextual concerns of argumentation theorists, critical thinking scholars, and rhetoricians.

The article concerns two axiom systems of Słupecki for the functionally complete three-valued propositional logic: W1–W6 and A1–A9. The article proves that both of them are inadequate—W1–W6 is semantically incomplete, on the other hand, A1–A9 governs a functionally incomplete calculus, and thus, it cannot be a semantically complete axiom system for the functionally complete three-valued logic.

This paper argues that the difference between contemporary software intensive scientific practice and more traditional non-software intensive varieties results from the characteristically high conditionality of software. We explain why the path complexity of programs with high conditionality imposes limits on standard error correction techniques and why this matters. While it is possible, in general, to characterize the error distribution in inquiry that does not involve high conditionality, we cannot characterize the error distribution in inquiry that depends on software. Software intensive (...) science presents distinctive error and uncertainty modalities that pose new challenges for the epistemology of science. (shrink)

Danielle Macbeth's purpose in Macbeth 2005 is threefold. Her monograph proposes "to provide a logical justification for all aspects of Frege's peculiar notation, to motivate and explain the developments in Frege's views over the course of his intellectual life, and to explicate his most developed, critically reflective conception of his Begriffschrift, his formula language of pure thought" (p. vii). I shall focus here on a few selected aspects of the first and third points and leave on the side the discussion (...) of the historical development of Frege's views on logic, semantics and mathematics. The book's underlying claim is that although Frege's logical language, "can of course be read as a language of quantificational logic, [it] can also be read very differently" (p. vii), so much so, as a matter of fact, that although Frege's logic is usually thought of as a "notational variant of standard quantificational logic", it is nevertheless "unknown to us" (p. 1). This naturally prompts three questions : "What is Frege's logic?", "What is quantificational logic?", and given the way we understand formal languages for first and higher order predicate logic, most notably the notions of argument 2 place (for a predicate symbol), of scope and of binding (of variables - either individual or predicate of first or higher order): "How come Frege's logic says nothing about such notions, or something so different from what we say?". (shrink)

The recent, short debate over the alethic undecidability of a Liar Sentence between Stephen Barker and Mark Jago is revisited. It is argued that Jago’s objections succeed in refuting Barker’s alethic undecidability solution to the Liar Paradox, but that, nevertheless, this approach may be revived as the alethic indeterminacy solution to the Liar Paradox. According to the alethic indeterminacy solution, there is genuine metaphysical indeterminacy as to whether a Liar Sentence bears an alethic property, whether truth or falsity. While the (...) alethic indeterminacy solution is presented here, and some revenge cases are considered and addressed, the primary aim of this paper is to revive and defend this underexplored and auspicious approach to solving the Liar Paradox. (shrink)

Jan Łukasiewicz’s analysis of Aristotle’s syllogism drew attention to the nature of syllogisms as conditionals rather than premise-conclusion arguments. His further idea that syllogisms should be understood as theorems of an axiom system seems a step too far for many logicians. But there is evidence to suggest that Aristotle’s syllogism was to regularise some of the steps made in ‘dialogue games.’ This way of seeing the syllogism is explored in the framework of modern formal dialogue systems. A modern formal syllogistic (...) game, DLSyll, is set out and analysed in use. (shrink)

In honour of Bob Meyer, the paper extends the use of his concept of metacompleteness to include various classical systems, as much as we are able. To do this for the classical sentential calculus, we add extra axioms so as to treat the variables like constants. Further, we use a one-sorted and a two-sorted approach to add classical sentential constants to the logic DJ of my book, Universal Logic. It is appropriate to use rejection to represent classicality in the one-sorted (...) case. We then extend these methods to the quantified logics, but we use a finite domain of individual constants to do this. (shrink)