Writings in consequently.org: Greg Restall’s website Greg Restall's publications on logic and philosophyGreg RestallGreg Restallgreg@consequently.orgPhilosophy, Logic, mathematics, pdf, research, University, Greg Restall, Melbourne, Australia, VictorianoHugo
http://consequently.org/writing/
en-usTue, 19 Dec 2017 00:00:00 UTCGenerality and Existence I: Quantification and Free Logic
http://consequently.org/writing/generality-and-existence-1/
Tue, 19 Dec 2017 00:00:00 UTChttp://consequently.org/writing/generality-and-existence-1/<![CDATA[<p>In this paper, I motivate a cut free sequent calculus for classical logic with first order quantification, allowing for singular terms free of existential import. Along the way, I motivate a criterion for rules designed to answer Prior’s question about what distinguishes rules for logical concepts, like ‘conjunction’ from apparently similar rules for putative concepts like ‘tonk’, and I show that the rules for the quantifiers—and the existence predicate—satisfy that condition.</p>
]]>Two Negations are More than One
http://consequently.org/writing/two-negations/
Fri, 11 Aug 2017 00:00:00 UTChttp://consequently.org/writing/two-negations/<![CDATA[<p>In models for paraconsistent logics, the semantic values of sentences and their negations are less tightly connected than in classical logic. In “American Plan” logics for negation, truth and falsity are, to some degree, independent. The truth of \({\mathord\sim}p\) is given by the falsity of \(p\), and the falsity of \({\mathord\sim}p\) is given by the truth of \(p\). Since truth and falsity are only loosely connected, \(p\) and \({\mathord\sim}p\) can both hold, or both fail to hold. In “Australian Plan” logics for negation, negation is treated rather like a modal operator, where the truth of \({\mathord\sim}p\) in a situation amounts to \(p\) failing in <em>certain other situations</em>. Since those situations can be different from this one, \(p\) and \({\mathord\sim}p\) might both hold here, or might both fail here.</p>
<p>So much is well known in the semantics for paraconsistent logics, and for first degree entailment and logics like it, it is relatively easy to translate between the American Plan and the Australian Plan. It seems that the choice between them seems to be a matter of taste, or of preference for one kind of semantic treatment or another. This paper explores some of the differences between the American Plan and the Australian Plan by exploring the tools they have for modelling a language in which we have <em>two</em> negations.</p>
<p>This paper is dedicated to my friend and mentor, Professor Graham Priest.</p>
]]>Proof Theory and Philosophy
http://consequently.org/writing/ptp/
Wed, 26 Jul 2017 00:00:00 UTChttp://consequently.org/writing/ptp/<![CDATA[<p>This is my next book-length writing project. I am writing a book which aims to do these things:</p>
<ol>
<li /> Be a useable textbook in philosophical logic, accessible to someone who’s done only an intro course in logic, covering at least some model theory and proof theory of propositional logic, and maybe predicate logic.
<li /> Be a user-friendly, pedagogically useful and philosophically motivated presentation of cut-elimination, normalisation and conservative extension, both (a) why they’re important to meaning theory and (b) how to actually <em>prove</em> them. (I don’t think there are any books like this available, but I’d be happy to be shown wrong.)
<li /> Present the duality between model theory and proof theory in a philosophically illuminating fashion.
<li /> Teach both formal philosophical logic in such a way that is not doctrinaire or logically partisan. That is, I will <em>not</em> argue that classical logic, or that intuitionistic logic, or that My Favourite Logic is the One True Logic. (Of course, hearing me say this is <a href="http://consequently.org/writing/logical_pluralism/">not a surprise</a>.)
<li /> I am (at this stage, at least) planning to make the book <a href="http://consequently.org/news/2004/03/18/publishing_a_book">available for download</a> as well as published by an academic publisher.
</ol></p>
]]>Fixed Point Models for Theories of Properties and Classes
http://consequently.org/writing/fixed-point-models/
Tue, 28 Feb 2017 00:00:00 UTChttp://consequently.org/writing/fixed-point-models/<![CDATA[<p>There is a vibrant (but minority) community among philosophical logicians seeking to resolve the paradoxes of classes, properties and truth by way of adopting some non-classical logic in which trivialising paradoxical arguments are not valid. There is also a long tradition in theoretical computer science–going back to Dana Scott’s fixed point model construction for the untyped lambda-calculus–of models allowing for fixed points. In this paper, I will bring these traditions closer together, to show how these model constructions can shed light on what we could hope for in a non-trivial model of a theory for classes, properties or truth featuring fixed points.</p>
]]>First Degree Entailment, Symmetry and Paradox
http://consequently.org/writing/fde-symmetry-paradox/
Thu, 23 Feb 2017 00:00:00 UTChttp://consequently.org/writing/fde-symmetry-paradox/<![CDATA[<p>Here is a puzzle, which I learned from Terence Parsons in his paper “True Contradictions”. First Degree Entailment (FDE) is a logic which allows for truth value gaps as well as truth value gluts. If you are agnostic between assigning paradoxical sentences gaps and gluts (and there seems to be no very good reason to prefer gaps over gluts or gluts over gaps if you are happy with FDE), then this looks no different, in effect, from assigning them a gap value? After all, on both views you end up with a theory that doesn’t commit you to the paradoxical sentence or its negation. How is the FDE theory any different from the theory with gaps alone?</p>
<p>In this paper, I will present a clear answer to this puzzle—an answer that explains how being agnostic between gaps and gluts is a genuinely different position than admitting gaps alone, by using the formal notion of a bi-theory, and showing that while such positions might agree on what is to be accepted, they differ on what is to be rejected.</p>
]]>Proof Terms for Classical Derivations
http://consequently.org/writing/proof-terms-for-classical-derivations/
Sun, 12 Feb 2017 00:00:00 UTChttp://consequently.org/writing/proof-terms-for-classical-derivations/<![CDATA[<p>I give an account of proof terms for derivations in a sequent calculus for classical propositional logic. The term for a derivation \(\delta\) of a sequent \(\Sigma \succ\Delta\) encodes how the premises \(\Sigma\) and conclusions \(\Delta\) are related in \(\delta\). This encoding is many–to–one in the sense that different derivations can have the same proof term, since different derivations may be different ways of representing the same underlying connection between premises and conclusions. However, not all proof terms for a sequent \(\Sigma\succ\Delta\) are the same. There may be different ways to connect those premises and conclusions.</p>
<p>Proof terms can be simplified in a process corresponding to the elimination of cut inferences in sequent derivations. However, unlike cut elimination in the sequent calculus, each proof term has a unique normal form (from which all cuts have been eliminated) and it is straightforward to show that term reduction is strongly normalising—every reduction process terminates in that unique normal form. Further- more, proof terms are invariants for sequent derivations in a strong sense—two derivations \(\delta_1\) and \(\delta_2\) have the same proof term if and only if some permutation of derivation steps sends \(\delta_1\) to \(\delta_2\) (given a relatively natural class of permutations of derivations in the sequent calculus). Since not every derivation of a sequent can be permuted into every other derivation of that sequent, proof terms provide a non-trivial account of the identity of proofs, independent of the syntactic representation of those proofs.</p>
]]>Existence and Definedness: the semantics of possibility and necessity
http://consequently.org/writing/existence-definedness/
Mon, 03 Oct 2016 00:00:00 UTChttp://consequently.org/writing/existence-definedness/<![CDATA[<p>In this paper, I will address just some of Professor Williamson’s treatment of necessitism in his <em>Modal Logic as Metaphysics</em>. I will give an account of what space might remain for a principled and logically disciplined contingentism. I agree with Williamson that those interested in the metaphysics of modality would do well to take quantified modal logic—and its semantics—seriously in order to be clear, systematic and precise concerning the commitments we undertake in adopting an account of modality and ontology. Where we differ is in how we present the semantics of that modal logic. I will illustrate how <em>proof theory</em> may play a distinctive role in elaborating a quantified modal logic, and in the development of theories of meaning, and in the metaphysics of modality.</p>
<p>The paper was first written for presentation in a <a href="http://www.philo.ntu.edu.tw/lmmgroup/?mode=events_detail&n=1">workshop on Tim Williamson’s work, at the Asian Workshop in Philosophical Logic and the Taiwan Philosophical Logic Colloquium</a> at the National Taiwan University. The slides from that talk are <a href="http://consequently.org/presentation/2016/existence-definedness-awpl-tplc">available here</a>.</p>
]]>Review of Thomas Piecha and Peter Schroeder-Heister (editors), Advances in Proof-Theoretic Semantics
http://consequently.org/writing/advances-in-pts-review/
Mon, 16 May 2016 00:00:00 UTChttp://consequently.org/writing/advances-in-pts-review/<![CDATA[<p>What could you mean by the term “proof-theoretic semantics” (PTS)? At first glance, it could mean either the semantics <em>of</em> proof theory, or perhaps it’s more likely to mean semantics conducted <em>using the tools of proof theory</em>. And <em>that</em>’s the enterprise that the fifteen authors intend to advance in the sixteen papers in this edited collection…</p>
]]>On Priest on Nonmonotonic and Inductive Logic
http://consequently.org/writing/on-priest-on-nonmonotonic/
Tue, 08 Mar 2016 00:00:00 UTChttp://consequently.org/writing/on-priest-on-nonmonotonic/<![CDATA[<p>Graham Priest defends the use of a nonmonotonic logic, <em>LPm</em>, in his analysis of reasoning in the face of true contradictions, such as those arising from the paradoxes of self-reference. In the course of defending the choice of this logic in the face of the criticism that <em>LPm</em> is not truth preserving, Priest argued that requirement is too much to ask: since <em>LPm</em> is a nonmonotonic logic, it necessarily fails to preserve truth. In this paper, I show that this assumption is incorrect, and I explain why nonmonotonic logics can nonetheless be truth preserving. Finally, I diagnose Priest’s error, to explain when nonmonotonic logics do indeed fail to preserve truth.</p>
<p>Graham Priest has written a <a href="http://dx.doi.org/10.1002/tht3.204">very short reply</a> to this article, which also appears in <em>Thought</em>.</p>
]]>Three Cultures—or: what place for logic in the humanities?
http://consequently.org/writing/three-cultures/
Thu, 29 Oct 2015 00:00:00 UTChttp://consequently.org/writing/three-cultures/<![CDATA[<p>Logic has been an important part of philosophy since the work of Aristotle in the 4th Century BCE. Developments of the 19th and the 20th Century saw an incredible flowering of mathematical techniques in logic, and the discipline transformed beyond recognition into something that can seem forbiddingly technical and formal. The discipline of logic plays a vital role in mathematics, linguistics, computer science and electrical engineering, and it may seem that it no longer has a place within the humanities.
In this essay, I show why this perception is misplaced and dangerous, and that in a time of increasing specialisation and differentiation between the cultures of the humanities, the sciences, and of engineering, logic not only has much to give to the humanities, it also has much to learn.</p>
]]>Assertion, Denial, Accepting, Rejecting, Symmetry and Paradox
http://consequently.org/writing/assertiondenialparadox/
Tue, 05 May 2015 00:00:00 UTChttp://consequently.org/writing/assertiondenialparadox/<![CDATA[<p>Proponents of a dialethic or “truth-value glut” response to the paradoxes of self-reference argue that “truth-value gap” analyses of the paradoxes fall foul of the extended liar paradox: “this sentence is not true.” If we pay attention to the role of assertion and denial and the behaviour of negation in both “gap” and “glut” analyses, we see that the situation with these approaches has a pleasing symmetry: gap approaches take some denials to not be expressible by negation, and glut approaches take some negations to not express denials. But in the light of this symmetry, considerations against a gap view point to parallel considerations against a glut view. Those who find some reason to prefer one view over another (and this is almost everyone) must find some reason to break this symmetry.</p>
<p>This short paper was written for presentation at <a href="http://www.philosophy.unimelb.edu.au/aap2004">AAP2004</a>. After very many revisions, it’s finally going to be published in an edited collection from members and friends of the <a href="http://www.st-andrews.ac.uk/arche/projects/logic/">Arché project on Foundations of Logical Consequence</a>.</p>
]]>Normal Proofs, Cut Free Derivations and Structural Rules
http://consequently.org/writing/npcfdsr/
Mon, 01 Dec 2014 00:00:00 UTChttp://consequently.org/writing/npcfdsr/<![CDATA[<p>Different natural deduction proof systems for intuitionistic and classical logic—and related logical systems—differ in fundamental properties while sharing significant family resemblances. These differences become quite stark when it comes to the structural rules of contraction and weakening. In this paper, I show how Gentzen and Jaśkowski’s natural deduction systems differ in fine structure. I also motivate directed proof nets as another natural deduction system which shares some of the design features of Genzen and Jaśkowski’s systems, but which differs again in its treatment of the structural rules, and has a range of virtues absent from traditional natural deduction systems.</p>
]]>Pluralism and Proofs
http://consequently.org/writing/pluralism-and-proofs/
Sun, 03 Aug 2014 00:00:00 UTChttp://consequently.org/writing/pluralism-and-proofs/<![CDATA[<p>Beall and Restall’s <em>Logical Pluralism</em> (2006) characterises pluralism about logical consequence in terms of the different ways cases can be selected in the analysis of logical consequence as preservation of truth over a class of cases. This is not the only way to understand or to motivate pluralism about logical consequence. Here, I will examine pluralism about logical consequence in terms of different standards of proof. We will focus on sequent derivations for classical logic, imposing two different restrictions on classical derivations to produce derivations focusr intuitionistic logic and for dual intuitionistic logic. The result is another way to understand the manner in which we can have different consequence relations in the same language. Furthermore, the proof-theoretic perspective gives us a different explanation of how the one concept of negation can have three different truth conditions, those in classical, intuitionistic and dual-intuitionistic models.</p>
]]>Assertion, Denial and Non-Classical Theories
http://consequently.org/writing/adnct/
Wed, 31 Jul 2013 00:00:00 UTChttp://consequently.org/writing/adnct/<![CDATA[<p>In this paper I urge friends of truth-value gaps and truth-value gluts – proponents of paracomplete and paraconsistent logics – to consider theories not merely as sets of sentences, but as <em>pairs</em> of sets of sentences, or what I call ‘bitheories,’ which keep track not only of what <em>holds</em> according to the theory, but also what <em>fails</em> to hold according to the theory. I explain the connection between bitheories, sequents, and the speech acts of assertion and denial. I illustrate the usefulness of bitheories by showing how they make available a technique for characterising different theories while abstracting away from logical vocabulary such as connectives or quantifiers, thereby making theoretical commitments independent of the choice of this or that particular non-classical logic.</p>
<p>Examples discussed include theories of numbers, classes and truth. In the latter two cases, the bitheoretical perspective brings to light some heretofore unconsidered puzzles for friends of naïve theories of classes and truth.</p>
]]>Special Issue of the Logic Journal of the IGPL: Non-Classical Mathematics
http://consequently.org/writing/ncm-igpl-2013/
Fri, 15 Feb 2013 00:00:00 UTChttp://consequently.org/writing/ncm-igpl-2013/<![CDATA[<p>A special issue of the Logic Journal of the IGPL, on Non-Classical Mathematics.</p>
<ul>
<li><em>Editorial Preface</em>, Libor Bĕhounek, Greg Restall, and Giovanni Sambin.</li>
<li>"Mathematical pluralism," Graham Priest</li>
<li>"A first constructive look at the comparison of projections," Douglas S. Bridges and Luminiţa S. Vîţa</li>
<li>"Lipschitz functions in constructive reverse mathematics," Iris Loeb</li>
<li>"Constructive version of Boolean algebra," Francesco Ciraulo, Maria Emilia Maietti, and Paola Toto</li>
<li>"A generalized cut characterization of the fullness axiom in CZF," Laura Crosilla, Erik Palmgren, and Peter Schuster</li>
<li>"Interpreting lattice-valued set theory in fuzzy set theory," Petr Hájek and Zuzana Haniková</li>
<li>"On equality and natural numbers in Cantor-Łukasiewicz set theory," Petr Hájek</li>
<li>"Identity taken seriously: a non-classical approach," Chris Mortensen</li>
<li>"Strong, universal and provably non-trivial set theory by means of adaptive logic," Peter Verdee</li>
</ul>
<p>The entire issue can be <a href="http://jigpal.oxfordjournals.org/content/21/1.toc">found here</a>.</p>
]]>New Waves in Philosophical Logic
http://consequently.org/writing/new-waves-in-philosophical-logic/
Mon, 31 Dec 2012 00:00:00 UTChttp://consequently.org/writing/new-waves-in-philosophical-logic/<![CDATA[<p>Philosophical logic has been, and continues to be, a driving force behind much progress and development in philosophy more broadly. This collection of 12 original papers by 15 up-and-coming philosophical logicians deals with a broad range of topics, including proof-theory, probability, context-sensitivity, dialetheism and dynamic semantics. If the discipline’s past influence on the core areas of philosophy is anything to go by, then the scholars and the ideas in these pages are the ones to watch. Here are the essays in the volume.</p>
<ul>
<li><a href="http://consequently.org/papers/NewWavesIntroduction.pdf">Introduction</a>, Greg Restall and Gillian Russell</li>
<li>How Things Are Elsewhere, Wolfgang Schwarz</li>
<li>Information Change and First-Order Dynamic Logic, Barteld Kooi</li>
<li><a href="http://consequently.org/writing/interp-apply-ptml">Interpreting and Applying Proof Theories for Modal Logic</a>, Francesca Poggiolesi and Greg Restall</li>
<li>The Logic(s) of Modal Knowledge, Daniel Cohnitz</li>
<li>From Type-Free Truth to Type-Free Probability, Hannes Leitgeb</li>
<li>Dogmatism, Probability and Logical Uncertainty, David Jehle and Brian Weatherson</li>
<li>Skepticism about Reasoning, Sherrilyn Roush, Kelty Allen and Ian Herbert</li>
<li>Lessons in Philosophy of Logic from Medieval Obligationes, Catarina Dutilh Novaes</li>
<li>How to Rule Out Things with Words:Strong Paraconsistency and the Algebra of Exclusion, Francesco Berto</li>
<li>Lessons from the Logic of Demonstratives, Gillian Russell</li>
<li>The Multitude View on Logic, Matti Eklund</li>
</ul>
]]>A Cut-Free Sequent System for Two-Dimensional Modal Logic, and why it matters
http://consequently.org/writing/cfss2dml/
Thu, 22 Nov 2012 00:00:00 UTChttp://consequently.org/writing/cfss2dml/<![CDATA[<p>The two-dimensional modal logic of Davies and Humberstone is an important aid to our understanding the relationship between actuality, necessity and a priori knowability. I show how a cut-free hypersequent calculus for 2d modal logic not only captures the logic precisely, but may be used to address issues in the epistemology and metaphysics of our modal concepts. I will explain how use of our concepts motivates the inference rules of the sequent calculus, and then show that the completeness of the calculus for Davies–Humberstone models explains why those concepts have the structure described by those models. The result is yet another application of the completeness theorem.</p>
<p>(This paper was awarded a Silver Medal for the Kurt Gödel Prize in 2011.)</p>
]]>Bradwardine Hypersequents
http://consequently.org/writing/bradwardine-hypersequents/
Fri, 03 Aug 2012 00:00:00 UTChttp://consequently.org/writing/bradwardine-hypersequents/<![CDATA[<p>According to Stephen Read, Thomas Bradwardine’s theory of truth provides an independently motivated solution to the paradoxes of truth, such as the liar. In a series of papers, I have discussed modal models for Read’s reconstruction of Bradwardine’s theory. In this paper, provide a hypersequent calculus for this theory, and I show that the cut rule is admissible in the hypersequent calculus.</p>
<p>(This paper is dedicated to Professor Stephen Read, whose work has been a profound influence on my own. His work on relevant logic, on proof theoretical harmony, on the logic of identity and on Thomas Brad- wardine’s theory of truth have been a rich source of insight, of stimulation and of provocation. In an attempt to both honour Stephen, and hopefully to give him some pleasure, I am going to attempt to cook up something original using some of the many and varied ingredients he has provided us. In this paper, I will mix and match ideas and techniques from Stephen’s papers on proof theory, on Bradwardine’s theory of truth, and on identity to offer a harmonious sequent system for a theory of truth inspired by Stephen Read’s recovery of the work of Thomas Bradwardine.)</p>
]]>Interpreting and Applying Proof Theories for Modal Logics
http://consequently.org/writing/interp-apply-ptml/
Sat, 03 Mar 2012 00:00:00 UTChttp://consequently.org/writing/interp-apply-ptml/<![CDATA[<p>Proof theory for modal logic has blossomed over recent years. Many ex- tensions of the classical sequent calculus have been proposed in order to give natural and appealing accounts of proof in modal logics like K, T, S4, S5, provability logics, and other modal systems. The common feature of each of these different proof systems consists in the general structure of the rules for modal operators. They provide introduction and elimination rules for statements of the form □􏰅A (and ◇􏰆A), which show how those statements can feature as conclusions or as premises in deduction. These rules give an account of the deductive power of a modal formula □􏰅A (and ◇􏰆A) in terms of the constituent formula A.</p>
<p>The distinctive feature for the modal operators in contemporary proof systems for modal logics is that the step introducing or eliminating □􏰅A is at the cost of introducing or eliminating some kind of extra structure in the proof. In this way, the proof rules for modal concepts such as □􏰅 run in parallel with the truth conditions for these concepts in a Kripke model, in which the truth of □􏰅A stands or falls with the truth of A, but at the cost of checking that truth elsewhere, at points in the model accessible from the point at which □􏰅A is evaluated.</p>
<p>In this paper we will introduce these recent advances in proof theory for a general audience, and then we will show how they are connected with different—metaphysical and epistemic—conceptions of modality. We will show that these different pictures are nothing but different ways of connecting the statement □􏰅A with the statement A, of showing the significance of modalising. In the light of this result we will draw conclusions about the link between analyticity and modality, and about the nature of a proof system for modal logics.</p>
]]>History of Logical Consequence
http://consequently.org/writing/hlc/
Sat, 03 Mar 2012 00:00:00 UTChttp://consequently.org/writing/hlc/<![CDATA[<p>Consequence is <em>a</em>, if not <em>the</em>, core subject matter of logic. Aristotle’s study of the syllogism instigated the task of categorising arguments into the logically good and the logically bad; the task remains an essential element of the study of logic. In this essay, we give a quick history of the way logical consequence has been studied from Aristotle to the present day.</p>
]]>On the ternary relation and conditionality
http://consequently.org/writing/ternary-cond/
Thu, 02 Feb 2012 00:00:00 UTChttp://consequently.org/writing/ternary-cond/<![CDATA[<p>One of the most dominant approaches to semantics for relevant (and many paraconsistent) logics is the Routley–Meyer semantics involving a ternary relation on points. To some (many?), this ternary relation has seemed like a technical trick devoid of an intuitively appealing philosophical story that connects it up with conditionality in general. In this paper, we respond to this worry by providing three different philosophical accounts of the ternary relation that correspond to three conceptions of conditionality. We close by briefly discussing a general conception of conditionality that may unify the three given conceptions.</p>
]]>Molinism and the Thin Red Line
http://consequently.org/writing/molinism-trl/
Sun, 01 Jan 2012 00:00:00 UTChttp://consequently.org/writing/molinism-trl/<![CDATA[<p>Molinism is an attempt to do equal justice to divine foreknowledge and human freedom. For Molinists, human freedom <em>fits</em> in this universe for the future is open or unsettled. However, God’s middle knowledge – God’s contingent knowledge of what agents would freely do in this or that circumstance – underwrites God’s omniscience in the midst of this openness.</p>
<p>In this paper I rehearse Nuel Belnap and Mitchell Green’s argument in ‘Indeterminism and the Thin Red Line’ against the reality of a distinguished single future in the context of branching time, and show that it applies applies equally against Molinism + branching time. In the process, we show how contemporary work in the logic of temporal notions in the context of branching time (specifically, Prior–Thomason semantics) can illuminate discussions in the metaphysics of freedom and divine knowledge.</p>
]]>Anti-Realist Classical Logic and Realist Mathematics
http://consequently.org/writing/antirealist/
Thu, 13 Oct 2011 00:00:00 UTChttp://consequently.org/writing/antirealist/<![CDATA[<p>I sketch an application of a semantically anti-realist understanding of the classical sequent calculus to the topic of mathematics. The result is a semantically anti-realist defence of mathematical realism. In the paper, I develop the view and compare it to orthodox positions in the philosophy of mathematics.</p>
]]>Logic in Australasia
http://consequently.org/writing/logic_in_australasia/
Sat, 01 Jan 2011 00:00:00 UTChttp://consequently.org/writing/logic_in_australasia/<![CDATA[<p>This is an idiosyncratic history of philosophical logic in Australia and New Zealand, highlighting two significant points of research in Australasian philosophical logic: modal logic and relevant/paraconsistent logic.</p>
]]>On the ternary relation and conditionality
http://consequently.org/writing/sitconchan/
Sat, 25 Dec 2010 00:00:00 UTChttp://consequently.org/writing/sitconchan/<![CDATA[<p>Majer and Peliš have proposed a relevant logic for epistemic agents, providing a novel extension of the relevant logic R with a distinctive epistemic modality K, which is at the one and the same time factive (Kφ → φ is a theorem) and an existential normal modal operator (K(φ ∨ ψ) → (Kφ ∨ Kψ) is also a theorem). The intended interpretation is that Kφ holds (relative to a situation <em>s</em>) if there is a resource available at <em>s</em>, confirming φ. In this article we expand the class of models to the broader class of ‘general epistemic frames’. With this generalisation we provide a sound and complete axiomatisation for the logic of general relevant epistemic frames. We also show, that each of the modal axioms characterises some natural subclasses of general frames.</p>
]]>Always More
http://consequently.org/writing/alwaysmore/
Tue, 16 Nov 2010 00:00:00 UTChttp://consequently.org/writing/alwaysmore/<![CDATA[<p>A possible world is a point in logical space. It plays a dual role with respect to propositions. (1) A possible world determines the truth value of every proposition. For each world <em>w</em> and proposition <em>p</em>, either at <em>w</em>, <em>p</em> is true, or at <em>w</em>, <em>p</em> is not true. (2) Each set of possible worlds determines a proposition. If <em>S</em>, a subset of <em>W</em> is a set of worlds, there is a proposition <em>p</em> true at exactly the worlds in <em>S</em>.</p>
<p>In this paper, I construct a logic, extending classical logic with a single unary operator, which has no complete Boolean algebras as models. If the family of propositions we are talking about in (1) and (2) has the kind of structure described in that logic, then (1) and (2) cannot jointly hold. I then explain what this might mean for theories of propositions and possible worlds.</p>
]]>Truth Tellers in Bradwardine's Theory of Truth
http://consequently.org/writing/bradwardine-truth-tellers/
Sun, 03 Oct 2010 00:00:00 UTChttp://consequently.org/writing/bradwardine-truth-tellers/<![CDATA[<p>Stephen Read’s work on Bradwardine’s theory of truth is some of the most exciting work on truth and insolubilia in recent years. Read brings together modern tools of formal logic and Bradwardine’s theory of signification to show that medieval distinctions can give great insight into the behaviour of semantic concepts such as truth. In a number of papers, I have developed a model theory for Bradwardine’s account of truth. This model theory has distinctive features: it serves up models in which every declarative object (any object signifying <em>anything</em>) signifies its own truth. This leads to a puzzle: there are good arguments to the effect that if anything is a truth-teller, it is <em>false</em>. This is a puzzle. What distinguishes <em>paradoxical</em> truth-tellers from <em>benign</em> truth tellers? It is my task in this paper to explain this distinction, and to clarify the behaviour of truth-tellers, given Bradwardine’s account of signification.</p>
]]>Proof Theory and Meaning: the context of deducibility
http://consequently.org/writing/ptm-context/
Sun, 03 Oct 2010 00:00:00 UTChttp://consequently.org/writing/ptm-context/<![CDATA[<p>I examine Belnap’s two criteria of <em>existence</em> and <em>uniqueness</em> for evaluating putative definitions of logical concepts in inference rules, by determining how they apply in four different examples: conjunction, the universal quantifier, the indefinite choice operator and the necessity in the modal logic S5. This illustrates the ways that definitions may be evaluated relative to a background theory of consequence, and the ways that different accounts of consequence provide us with different resources for making definitions.</p>
]]>Decorated Linear Order Types and the Theory of Concatenation
http://consequently.org/writing/dlot/
Sun, 03 Oct 2010 00:00:00 UTChttp://consequently.org/writing/dlot/<![CDATA[<p>We study the interpretation of Grzegorczyk’s Theory of Concatenation TC in structures of decorated linear order types satisfying Grzegorczyk’s axioms. We show that TC is incomplete for this interpretation. What is more, the first order theory validated by this interpretation interprets arithmetical truth. We also show that every extension of TC has a model that is not isomorphic to a structure of decorated order types.</p>
<p>We provide a positive result, to wit, a construction that builds structures of decorated order types from models of a suitable concatenation theory. This construction has the property that if there is a representation of a certain kind, then the construction provides a representation of that kind.</p>
]]>Barriers to Consequence
http://consequently.org/writing/barriers/
Thu, 15 Jul 2010 00:00:00 UTChttp://consequently.org/writing/barriers/<![CDATA[<p>In this paper we show how the formal counterexamples to Hume’s Law (to the effect that you cannot derive a properly moral statement from properly descriptive statements) are of a piece with formal counterexample to other, plausible “inferential barrier theses”. We use this fact to motivate a uniform treatment of barrier theses which is immune from formal counterexample. We provide a uniform semantic representation of barrier theses which has applications in the case of what we call “Russell’s Law” (you can’t derive a universal from particulars) and “Hume’s Second Law” (you can’t derive a statement about the future from statements about the past). We then finally apply these results to formal treatments of deontic logic to show how to avoid formal counterexamples to Hume’s Law in a plausible and motivated manner.</p>
]]>Relevant Agents
http://consequently.org/writing/relevant_agents/
Wed, 03 Mar 2010 00:00:00 UTChttp://consequently.org/writing/relevant_agents/<![CDATA[<p>Majer and Peliš have proposed a relevant logic for epistemic agents, providing a novel extension of the relevant logic R with a distinctive epistemic modality K, which is at the one and the same time factive (Kφ → φ is a theorem) and an existential normal modal operator (K(φ ∨ ψ) → (Kφ ∨ Kψ) is also a theorem). The intended interpretation is that Kφ holds (relative to a situation s) if there is a resource available at s, confirming φ. In this article we expand the class of models to the broader class of ‘general epistemic frames’. With this generalisation we provide a sound and complete axiomatisation for the logic of general relevant epistemic frames. We also show, that each of the modal axioms characterises some natural subclasses of general frames.</p>
]]>On t and u, and what they can do
http://consequently.org/writing/on_t_and_u/
Tue, 16 Feb 2010 00:00:00 UTChttp://consequently.org/writing/on_t_and_u/<![CDATA[<p>This paper shows that once we have propositional constants <em>t</em> (the conjunction of all truths) and <em>u</em> (the disjunction of all untruths), paradox ensues, provided you have a conditional in the language strong enough to give you <em>modus ponens</em>. This is an issue for views like those of Jc Beall, Ross Brady, Hartry Field and Graham Priest.</p>
]]>What are we to accept, and what are we to reject, when saving truth from paradox?
http://consequently.org/writing/stp/
Mon, 18 Jan 2010 00:00:00 UTChttp://consequently.org/writing/stp/<![CDATA[<p>In this article, I praise Hartry Field’s fine book <em>Saving Truth From Paradox</em> (Oxford University Press, 2008). I also show that his account of properties is threatened by a paradox, and I explain how we can only avoid this paradox by coming to a clearer understanding the connections between accepting and rejecting (or assertion and denial) and the identity conditions for properties.</p>
]]>Models for Substructural Arithmetics
http://consequently.org/writing/mfsa/
Thu, 31 Dec 2009 00:00:00 UTChttp://consequently.org/writing/mfsa/<![CDATA[<p>This paper explores models for arithmetics in substructural logics. In the existing literature on substructural arithmetic, frame semantics for substructural logics are absent. We will start to fill in the picture in this paper by examining frame semantics for the substructural logics C (linear logic plus distribution), R (relevant logic) and CK (C plus weakening). The eventual goal is to find negation complete models for arithmetic in R.</p>
<p>This paper is dedicated to Professor Robert K. Meyer.</p>
]]>On Permutation in Simplified Semantics
http://consequently.org/writing/permutation/
Tue, 03 Nov 2009 00:00:00 UTChttp://consequently.org/writing/permutation/<![CDATA[<p>This note explains an error in Restall’s ‘Simplified Semantics for Relevant Logics (and some of their rivals)’ (<em>Journal of Philosophical Logic</em> 1993) concerning the modelling conditions for the axioms of <em>assertion</em> <em>A</em> → ((<em>A</em> → <em>B</em>) → <em>B</em>) and <em>permutation</em> (<em>A</em> → (<em>B</em> → <em>C</em>)) → (<em>B</em> → (<em>A</em> → <em>C</em>)). We show that the modelling conditions for assertion and permutation proposed in ‘Simplified Semantics’ overgenerate. In fact, they overgenerate so badly that the proposed semantics for the relevant logic R validate the rule of disjunctive syllogism. The semantics provides for <em>no</em> models of R in which the “base point” is inconsistent.</p>
<p>In this note, we explain this result, diagnose the mistake in ‘Simplified Semantics’ and propose a correction.</p>
]]>A Priori Truths
http://consequently.org/writing/apriori/
Fri, 17 Jul 2009 00:00:00 UTChttp://consequently.org/writing/apriori/<![CDATA[<p>Philosophers love a priori knowledge: we delight in truths that can be known from the comfort of our armchairs, without the need to venture out in the world for cofirmation. This is due not to laziness, but to two different considerations. First, it seems that many philosophical issues aren’t settled by our experience of the world – the nature of morality; the way concepts pick out objects; the structure of our experience of the world in which we find ourselves – these issues seem to be decided not on the basis of our experience, but in some manner by things prior to (or independently of) that experience. Second, even when we are deeply interested in how our experience lends credence to our claims about the world, the matter remains of the remainder: we learn more about how experience contributes to knowledge when we see what knowledge is available independent of that experience.</p>
<p>In this essay we will look at the topic of what can be known <em>a priori</em>.</p>
]]>Truth Values and Proof Theory
http://consequently.org/writing/tvpt/
Fri, 01 May 2009 00:00:00 UTChttp://consequently.org/writing/tvpt/<![CDATA[<p>In this paper I present an account of truth values for <em>classical logic</em>, <em>intuitionistic logic</em>, and <em>the modal logic S5</em>, in which truth values are not a fundamental category from which the logic is defined, but rather, feature as an idealisation of more fundamental logical features arising out of the proof theory for each system. The result is not a new set of semantic structures, but a new understanding of how the existing semantic structures may be understood in terms of a more fundamental notion of logical consequence.</p>
]]>Using Peer Instruction to Teach Philosophy, Logic and Critical Thinking
http://consequently.org/writing/peer-instruction/
Mon, 20 Apr 2009 00:00:00 UTChttp://consequently.org/writing/peer-instruction/<![CDATA[<p>We explain how <a href="http://mazur-www.harvard.edu/emdetails.php">Eric Mazur</a>’s technique of Peer Instruction may be used to teach philosophy, logic and critical thinking — to good effect.</p>
]]>Appendix to 'Yo!' and 'Lo!': the pragmatic topography of the space of reasons
http://consequently.org/writing/yo-lo-appendix/
Thu, 01 Jan 2009 00:00:00 UTChttp://consequently.org/writing/yo-lo-appendix/<![CDATA[<p>The appendix to Kukla and Lance’s book is the preliminary development of a score-keeping semantics that begins with the broader field of vision opened up when we eschew the declarative fallacy and make use of abstract versions of the pragmatic distinctions developed in the body of the book.</p>
]]>Models for Liars in Bradwardine's Theory of Truth
http://consequently.org/writing/bradwardine-liars/
Wed, 03 Dec 2008 00:00:00 UTChttp://consequently.org/writing/bradwardine-liars/<![CDATA[<p>Stephen Read’s work on Bradwardine’s theory of truth is some of the most exciting work on truth and insolubilia in recent years. In this paper, I give models for Read’s formulation of Bradwardine’s theory of truth, and I examine the behaviour of liar sentences in those models. I conclude by examining Bradwardine’s argument to the effect that if something signifies itself to be untrue then it signifies itself to be true as well. We will see that there are models in which this conclusion fails. This should help us elucidate the hidden assumptions required to underpin Bradwardine’s argument, and to make explicit the content of Bradwardine’s theory of truth.</p>
]]>Truthmakers, Entailment and Necessity 2008
http://consequently.org/writing/ten2008/
Fri, 03 Oct 2008 00:00:00 UTChttp://consequently.org/writing/ten2008/<![CDATA[<p>
I update “<a href="http://consequently.org/writing/ten/">Truthmakers, Entailment and Necessity</a>” with a response to Stephen Read's wonderful <em>Mind</em> 2000 argument to the effect that I got the disjunction thesis wrong.
</p>
<p>
I think I didn't get it wrong, but figuring out <em>why</em> it's OK to hold that a truthmaker makes a disjunction true iff it makes a disjunct true is not as straightforward as I first thought. Pluralism about truthmaking makes an entrance.
</p>
]]>Modal Models for Bradwardine's Theory of Truth
http://consequently.org/writing/bradwardine/
Mon, 15 Sep 2008 00:00:00 UTChttp://consequently.org/writing/bradwardine/<![CDATA[<p>Stephen Read has recently discussed Thomas Bradwardine’s theory of truth, and defended it as an appropriate way to treat paradoxes such as the liar. In this paper, I discuss Read’s formalisation of Bradwardine’s theory of truth, and provide a class of models for this theory. The models facilitate comparison of Bradwardine’s theory with contemporary theories of truth.</p>
]]>Envelopes and Indifference
http://consequently.org/writing/envelopes/
Mon, 03 Mar 2008 00:00:00 UTChttp://consequently.org/writing/envelopes/<![CDATA[<p>We diagnose the two envelope “paradox”, showing how the indifference principle plays a role in prompting the conflicting assignments of the expected outcomes for switching or keeping.</p>
]]>Curry's Revenge: the costs of non-classical solutions to the paradoxes of self-reference
http://consequently.org/writing/costing/
Mon, 03 Mar 2008 00:00:00 UTChttp://consequently.org/writing/costing/<![CDATA[<p>I point out that non-classical “solutions” the paradoxes of self-reference are non-particularly easy to give. Curry’s paradox is very very hard to avoid, if you wish to give a semantically cohrerent picture.</p>
]]>Assertion and Denial, Commitment and Entitlement, and Incompatibility (and some consequence)
http://consequently.org/writing/acdei/
Mon, 03 Mar 2008 00:00:00 UTChttp://consequently.org/writing/acdei/<![CDATA[<p>In this short paper, I compare and contrast the kind of symmetricalist treatment of negation favoured in different ways by Huw Price (in “Why ‘Not’?”) and by me (in “Multiple Conclusions”) with Robert Brandom’s analysis of scorekeeping in terms of commitment, entitlement and incompatibility.</p>
<p>Both kinds of account provide a way to distinguish the inferential significance of “<em>A</em>” and “<em>A</em> is warranted” in terms of a subtler analysis of our practices: on the one hand, we assert as well as deny; on the other, by distingushing downstream commitments from upstream entitlements and the incompatibility definable in terms of these. In this note I will examine the connections between these different approaches.</p>
]]>A Participatory Theory of the Atonement
http://consequently.org/writing/pa/
Mon, 03 Mar 2008 00:00:00 UTChttp://consequently.org/writing/pa/<![CDATA[<p>We argue that the participatory language, used in the New Testament to describe the the efficacy of Jesus’ death on the cross, is essential for any understanding of the atonement. Purely personal or legal metaphors are incomplete and perhaps misleading on their own. They make much more sense when combined with and undergirded by, participatory metaphors.</p>
]]>Review of Ross Brady, Universal Logic
http://consequently.org/writing/universal/
Sat, 01 Dec 2007 00:00:00 UTChttp://consequently.org/writing/universal/<![CDATA[<p>This solid volume with the ominous black cover and eerie glowing disc lettered with inscrutable strings of characters such as “DN<sup>d</sup>Q,” “LSDJ<sup>d</sup>,” and “L2LDJQ<sup>±</sup>” is the fruit of over 30 years of Ross Brady’s logical labours. And it is worth the wait…</p>
]]>Invention is the Mother of Necessity: modal logic, modal semantics and modal metaphysics
http://consequently.org/writing/invention/
Wed, 03 Oct 2007 00:00:00 UTChttp://consequently.org/writing/invention/<![CDATA[<p>Modal logic is a well-established field, and the possible worlds semantics of modal logics has proved invaluable to our understanding of the logical features of the modal concepts such as possibility and necessity. However, the significance of possible worlds models for a genuine theory of meaning–let alone for metaphysics–is less clear. In this paper I shall explain how and why the use of the concepts of necessity and possibility could arise (and why they have the logical behaviour charted out by standard modal logics) without either taking the notions of necessity or possibility as primitive, and without starting with possible worlds. Once we give an account of modal logic we can then go on to give an account of possible worlds, and explain why possible worlds semantics is a natural fit for modal logic without being the source of modal concepts.</p>
<p>This paper is an early draft, and comments are most welcome.</p>
]]>Symbolic Logic
http://consequently.org/writing/symbolic-logic/
Sat, 03 Mar 2007 00:00:00 UTChttp://consequently.org/writing/symbolic-logic/<![CDATA[<p>1007 words on symbolic logic – concentrating on the history of 20th Century logic, aimed at an audience of social scientists</p>
]]>Proofnets for S5: sequents and circuits for modal logic
http://consequently.org/writing/s5nets/
Sat, 03 Mar 2007 00:00:00 UTChttp://consequently.org/writing/s5nets/<![CDATA[<p>In this paper I introduce a sequent system for the propositional modal logic S5. Derivations of valid sequents in the system are shown to correspond to proofs in a novel natural deduction system of <em>circuit proofs</em> (reminiscient of proofnets in linear logic, or multiple-conclusion calculi for classical logic).</p>
<p>The sequent derivations and proofnets are both simple extensions of sequents and proofnets for classical propositional logic, in which the new machinery—to take account of the modal vocabulary—is directly motivated in terms of the simple, universal Kripke semantics for S5.
The sequent system is cut-free and the circuit proofs are normalising.</p>
]]>Proof Theory and Meaning: on second order logic
http://consequently.org/writing/ptm-second-order/
Sat, 03 Mar 2007 00:00:00 UTChttp://consequently.org/writing/ptm-second-order/<![CDATA[<p>Second order quantification is puzzling. The second order quantifiers have natural and compelling inference rules, and they also have natural models. These do not match: the inference rules are sound for the models, but not complete, so either the proof rules are too weak or the models are too strong. Some, such as Quine, take this to be no real problem, since they take “second order logic” to be a misnomer. It is not logic but set theory in sheep’s clothing, so one would not expect to have a sound and complete axiomatisation of the theory.</p>
<p>I think that this judgement is incorrect, and in this paper I attempt to explain why. I show how on Nuel Belnap’s criterion for logicality, second order quantification can count as properly logic so-called, since the quantifiers are properly defined by their inference rules, and the addition of second order quantification to a basic language is conservative. With this notion of logicality in hand I then diagnose the incompleteness of the proof theory of second order logic in what seems to be a novel way.</p>
]]>Relevant and Substructural Logics
http://consequently.org/writing/hpplssl/
Fri, 03 Mar 2006 00:00:00 UTChttp://consequently.org/writing/hpplssl/<![CDATA[<p>An historical essay, sketching the development of relevant and substructural logics throughout the 20th Century and into the 21st.</p>
]]>Relevant Restricted Quantification
http://consequently.org/writing/rrq/
Fri, 03 Mar 2006 00:00:00 UTChttp://consequently.org/writing/rrq/<![CDATA[<p>The paper reviews a number of approaches for handling restricted quantification in relevant logic, and proposes a novel one. This proceeds by introducing a novel kind of enthymematic conditional.</p>
]]>Questions and Answers on Formal Philosophy
http://consequently.org/writing/masses/
Fri, 03 Mar 2006 00:00:00 UTChttp://consequently.org/writing/masses/<![CDATA[<p>My entry in a book of interviews of philosophers who work on the more <em>formal</em> side of the discipline. It gives an account of how I got into this area, what I think logic is good for – when it comes to philosophy – and where I think we should head.</p>
]]>Logics, Situations and Channels
http://consequently.org/writing/channels/
Fri, 03 Mar 2006 00:00:00 UTChttp://consequently.org/writing/channels/<![CDATA[<p>The notion of that information is relative to a context is important in many different ways. The idea that the context is <em>small</em> – that is, not necessarily a consistent and complete possible world – plays a role not only in situation theory, but it is also an enlightening perspective from which to view other areas, such as modal logics, relevant logics, categorial grammar and much more.</p>
<p>In this article we will consider these areas, and focus then on one further question: How can we account for information about one thing giving us information about something else? This is a question addressed by channel theory. We will look at channel theory and then see how the issues of information flow and conditionality play a role in each of the different domains we have examined.</p>
]]>Logical Pluralism
http://consequently.org/writing/pluralism/
Sun, 01 Jan 2006 00:00:00 UTChttp://consequently.org/writing/pluralism/<![CDATA[<p>This is our manifesto on <em>logical pluralism</em>. We argue that the notion of logical consequence doesn’t pin down <em>one</em> deductive consequence relation, but rather, there are many of them. In particular, we argue that broadly classical, intuitionistic and relevant accounts of deductive logic are genuine logical consequence relations. We should not search for <em>One True Logic</em>, since there are <em>Many</em>.</p>
]]>Logic
http://consequently.org/writing/logic/
Sun, 01 Jan 2006 00:00:00 UTChttp://consequently.org/writing/logic/<![CDATA[<p>This is an introductory textbook in logic, in the series <em>Fundamentals of Philosophy</em>, published by Routledge. I use the text in my <a href="http://webraft.its.unimelb.edu.au/161115/pub/">Introduction to Formal Logic</a> class at Melbourne. It’s available at <a href="http://www.amazon.co.uk/exec/obidos/ASIN/0415400686/consequentlyorg">Amazon UK</a> and <a href="http://www.amazon.com/exec/obidos/ASIN/0415400686/consequentlyorg">Amazon US</a>.</p>
<p>The book has a dedicated website at <a href="http://consequently.org/logic">http://consequently.org/logic</a>.</p>
]]>Logical Consequence
http://consequently.org/writing/logical_consequence/
Mon, 12 Dec 2005 00:00:00 UTChttp://consequently.org/writing/logical_consequence/<![CDATA[<p>A good argument is one whose conclusions follow from its premises; its conclusions are consequences of its premises. But in what sense do conclusions follow from premises? What is it for a conclusion to be a consequence of premises? Those questions, in many respects, are at the heart of logic (as a philosophical discipline).</p>
]]>Constant Domain Quantified Modal Logics without Boolean Negation
http://consequently.org/writing/cdqml/
Fri, 02 Sep 2005 00:00:00 UTChttp://consequently.org/writing/cdqml/<![CDATA[<p>The paper examines what its title says. Constant domain modal frames seem to be the natural semantics for quantified relevant logics and their cousins. Kit Fine has shown us that things are not that simple, as the natural proof theory is not complete for the natural semantics. In this paper I explore the somewhat simpler case of one-place modal operators. The natural proofs work, but there are a few surprises, such as the need to use intuitionistic implication and its dual, subtraction, in the completeness proof. This paper is dedicated to the memory of Richard Sylvan, who contributed so much to the study of the semantics of relevant logics and their neighbours.</p>
]]>The Geometry of Non-Distributive Logics
http://consequently.org/writing/gndl/
Thu, 03 Mar 2005 00:00:00 UTChttp://consequently.org/writing/gndl/<![CDATA[<p>In this paper, we introduce a new natural deduction system for the logic of lattices, and a number of extensions of lattice logic with different negation connectives. We provide the class of natural deduction proofs with both a standard inductive definition and a global graph-theoretical criterion for correctness. We show how normalisation in this system corresponds to cut elimination in the sequent calculus for lattice logic, and we indicate how proofs in this system may be labelled with terms exhibiting a kind of Curry-Howard isomorphism. This natural deduction system is inspired both by Shoesmith and Smiley’s multiple conclusion systems for classical logic and Girard’s proofnets for linear logic.</p>
<p>This paper is joint work with <a href="http://www.unica.it/~paoli/">Francesco Paoli</a>.</p>
]]>Not Every Truth Can Be Known: at least, not all at once
http://consequently.org/writing/notevery/
Thu, 03 Mar 2005 00:00:00 UTChttp://consequently.org/writing/notevery/<![CDATA[<p>According to the “knowability thesis,” every truth is knowable. Fitch’s paradox refutes the knowability thesis by showing that if we are not omniscient, then not only are some truths not known, but there are some truths that are not knowable. In this paper, I propose a weakening of the knowability thesis (which I call the “conjunctive knowability thesis”) to the effect that for every truth <em>p</em> there is a collection of truths such that (i) each of them is knowable and (ii) their conjunction is equivalent to <em>p</em>. I show that the conjunctive knowability thesis avoids triviality arguments against it, and that it fares very differently depending on one other issue connecting knowledge and possibility. If some things are knowable but <em>false</em>, then the conjunctive knowability thesis is trivially true. On the other hand, if knowability entails truth, the conjunctive knowability thesis is coherent, but only if the logic of possibility is quite weak.</p>
<p><em>Update, April 2005</em>: I’ve added a reference (thanks to Joe Salerno) to a recent paper of Risto Hilpinen, in which he motivates a conjunctive knowability thesis on the grounds of a Peircean pragmatism.</p>
]]>Multiple Conclusions
http://consequently.org/writing/multipleconclusions/
Thu, 03 Mar 2005 00:00:00 UTChttp://consequently.org/writing/multipleconclusions/<![CDATA[<p>I argue for the following four theses. (1) Denial is not to be analysed as the assertion of a negation. (2) Given the concepts of assertion and denial, we have the resources to analyse logical consequence as relating arguments with multiple premises and multiple conclusions. Gentzen’s multiple conclusion calculus can be understood in a straightforward, motivated, non-question-begging way. (3) If a broadly anti-realist or inferentialist justification of a logical system works, it works just as well for classical logic as it does for intuitionistic logic. The special case for an anti-realist justification of intuitionistic logic over and above a justification of classical logic relies on an unjustified assumption about the shape of proofs. Finally, (4) this picture of logical consequence provides a relatively neutral shared vocabulary which can help us understand and adjudicate debates between proponents of classical and non-classical logics.</p>
<p>This paper has now been reprinted in <em><a href="http://www.denbridgepress.com/am.php">Analysis and Metaphysics</a></em>, 6, 2007, 14-34.</p>
]]>Moral Fictionalism versus the rest
http://consequently.org/writing/mf/
Thu, 03 Mar 2005 00:00:00 UTChttp://consequently.org/writing/mf/<![CDATA[<p>In this paper we introduce a distinct meta-ethical position, fictionalism about morality. We clarify and defend the position, showing that it is a way to save the “moral phenomena” while agreeing that there is no genuine objective prescriptivity to be described by moral terms. In particular, we distiguish moral fictionalism from moral quasi-realism, and we show that fictionalism many all of the virtues of quasi-realism but few of the vices.</p>
]]>Minimalists about Truth can (and should) be Epistemicists, and it helps if they are revision theorists too
http://consequently.org/writing/minitrue/
Thu, 03 Mar 2005 00:00:00 UTChttp://consequently.org/writing/minitrue/<![CDATA[<p>Minimalists about truth say that the important properties of the
truth predicate are revealed in the class of <em>T</em>-biconditionals. Most
minimalists demur from taking <em>all</em> of the <em>T</em>-biconditionals
of the form “<<em>p</em>> is true if and only if <em>p</em>”, to be true, because to do so leads to paradox. But exactly <em>which</em> biconditionals turn out to be true? I take a leaf out of the epistemic account of vagueness
to show how the minimalist can avoid giving a comprehensive answer to that
question. I also show that this response is entailed by
taking minimalism seriously, and that objections to this position may be usefully aided and abetted by Gupta and Belnap’s revision theory of truth.</p>
]]>Entries "Belnap, Nuel Dinsmore Jr." and "Lambert, J. Karel" from the <em>Dictionary of Modern American Philosophers</em>
http://consequently.org/writing/dmap-belnap-lambert/
Thu, 03 Mar 2005 00:00:00 UTChttp://consequently.org/writing/dmap-belnap-lambert/<![CDATA[<p>Two short entries on two great philosophers of logic (and philosophical logicians) of late 20th and early 21st Century American philosophy, Nuel Belnap and Karel Lambert.</p>
]]>Łukasiewicz, Supervaluations and the Future
http://consequently.org/writing/lsf/
Thu, 03 Mar 2005 00:00:00 UTChttp://consequently.org/writing/lsf/<![CDATA[<p>In this paper I consider an interpretation of future contingents which motivates a unification of a Łukasiewicz style logic with the more classical supervaluational semantics. This in turn motivates a new non-classical logic modelling what is “made true by history up until now.” I give a simple Hilbert-style proof theory, and a soundness and completeness argument for the proof theory with respect to the intended models.</p>
<p>This paper is available at <a href="http://www.units.it/~episteme/L%26PS_Vol3No1/contents_L%26PS_Vol3No1.htm">http://www.units.it/~episteme/L&PS_Vol3No1/contents_L&PS_Vol3No1.htm</a>.</p>
]]>One Way to Face Facts
http://consequently.org/writing/facts/
Sun, 03 Oct 2004 00:00:00 UTChttp://consequently.org/writing/facts/<![CDATA[<p>Stephen Neale, in <em>Facing Facts</em> takes theories of facts, truthmakers, and non-extensional connectives to be threatened by triviality in the face of powerful “slingshot” arguments. In this paper I rehearse the most powerful of these arguments, and then show that friends of facts have resources sufficient to not only resist slingshot arguments but also to be untroubled by them. If a fact theory is provided with a model, then the fact theorist can be sure that this theory is secure from triviality arguments.</p>
]]>Laws of Non-Contradiction, Laws of the Excluded Middle and Logics
http://consequently.org/writing/lnclem/
Tue, 20 Jul 2004 00:00:00 UTChttp://consequently.org/writing/lnclem/<![CDATA[<p>There is widespread agreement that the law of non-contradiction is an important logical principle. There is less agreement on exactly <em>what</em> the law amounts to. This unclarity is brought to light by the emergence of paraconsistent logics in which contradictions are tolerated (in the sense that not everything need follow from a contradiction, and that there are “worlds” in which contradictions are true) but in which the statement ~(<em>A</em> & ~<em>A</em>) (it is not the case that <em>A</em> and not-<em>A</em>) is still provable. This paper attempts to clarify the connection between different readings of the law of non-contradiction, the duality between the law of non-contradiction and the law of the excluded middle, and connections with logical consequence in general.</p>
]]>Routes to Triviality
http://consequently.org/writing/routes/
Wed, 03 Mar 2004 00:00:00 UTChttp://consequently.org/writing/routes/<![CDATA[<p>It is well known that contraction-related principles trivialise naïve class theory. It is less well known that many other principles unrelated to contraction also render the theory trivial. This paper provides a characterisation of a large class of formulas which do the job. This class includes all properly implication formulas known in the literature, and adds countably many more.</p>
]]>Logical Pluralism and the Preservation of Warrant
http://consequently.org/writing/warrantpres/
Wed, 03 Mar 2004 00:00:00 UTChttp://consequently.org/writing/warrantpres/<![CDATA[<p>I defend logical pluralism against the charge that <em>One True Logic</em> is motivated by considerations of warrant preservation. On the way I attempt to clarify just a little the connections between deductive validity and epistemology.</p>
]]>Great Moments in Logic
http://consequently.org/writing/logicians/
Mon, 05 Jan 2004 00:00:00 UTChttp://consequently.org/writing/logicians/<![CDATA[<h3>Bernhard Bolzano (1781-1848)</h3>
<p><img class="logician" src="http://consequently.org/images/logicians/Bolzano.jpg" alt="[Image of Bolzano]" />
Bolzano was a philosopher, mathematician and logician who had important things to contribute in each of these fields. He’s probably <em>best</em> known for what he has done in <a href="http://www.shu.edu/projects/reals/history/bolzano.html">mathematics</a>: the precise definition of continuity when it comes to real-valued functions. But for my money (and in my discipline) Bolzano was worth much more than this. He was the first philosopher to give a precise <em>analysis</em> of logical consequence in terms we would recognise today. </p>
<p>(This was important for his project of understanding mathematics, and making it clearer, because mathematicians were getting into knots considering <em>infinite</em> numbers, <em>infinitesimal</em> numbers, and many other seemingly paradoxical things. The 1800s involved mathematicians painstakingly going over old reasoning step-by-step to see if (and how) the reasoning worked, and to see where it might go wrong. You can really only do this if you have a good understanding of how reasoning works. This is what Bolzano was trying to supply.) </p>
<p>Anyway, he argued that you can tell that an argument from premises to a conclusion is logically <em>valid</em> if and only if it never proceeds from truth to falsity no matter how you change the non-logical vocabulary in the argument. So </p>
<blockquote>
<p>Sally is coming to the party. <br />
If Sally is coming to the party, Jim will be happy. <br />
Therefore Jim will be happy. </p>
</blockquote>
<p>is <em>valid</em> because we will never step from truth to falsity no matter how we change the subject matter. For example </p>
<blockquote>
<p>Sally is joining the army. <br />
If Sally is joining the army, she is putting her life at risk. </p>
</blockquote>
<p>Therefore Sally is putting her life at risk. </p>
<p>works too. In fact any argument with the shape </p>
<blockquote>
<p>If <em>p</em> then <em>q</em> <br />
<em>p</em> <br />
Therefore <em>q</em></p>
</blockquote>
<p>works just as well. Note that the closely related shape </p>
<blockquote>
<p>If <em>p</em> then <em>q</em> <br />
<em>q</em> <br />
Therefore <em>p</em></p>
</blockquote>
<p>doesn’t work, and we can see that it doesn’t work by looking at an example: </p>
<blockquote>
<p>If it’s Thursday then it’s a weekday <br />
It’s a weekday <br />
Therefore it’s Thursday </p>
</blockquote>
<p>This works <em>sometimes</em> but not <em>all</em> the time. The premises are true but the conclusion is false on a <em>Friday</em> for example. </p>
<p>Now, it’s still very much an open question as to what you are allowed to change, and what you should keep fixed when you’re testing an argument. Bolzano is really interesting here, because he says that it’s entirely a matter of convention. Different rules will give you a different story when it comes to what’s valid and what’s not. And that is pretty <a href="http://pluralism.pitas.com">appealing to me</a>. </p>
<p>Anyway, Bolzano’s analysis of logical consequence is a great step in the direction of constructing modern formal logic. We’ll see more of where it leads soon. </p>
<p>Read some more about Bolzano at the <a href="http://www.shu.edu/projects/reals/history/bolzano.html">Interactive Real Analysis</a> website.</p>
<h3>George Boole (1815-1864)</h3>
<p><img class="logician" src="http://consequently.org/images/logicians/Boole.jpg" alt="[Image of Boole]" />Boole’s book <em><a href="http://www.amazon.com/exec/obidos/ASIN/0486600289/consequentlyorg">The Laws of Thought</a></em> (1854) is a landmark in the <em>algebraic</em> treatment of logic. That is, he showed how treating propositions or statements like <em>quantities</em> results in a pleasing formal structure. </p>
<p>The ideas are simple. For every proposition <em>x</em> there is its negation (or denial) <em>~x</em>. The negation of a negation is the original statement (to deny <em>~x</em> is to say no more or no less than <em>x</em>) so <em>~~x</em> is identical to <em>x</em>. Negation acts sort-of like minus with regards to numbers. (Sort-of, anyway.) Similarly, for statements <em>x</em> and <em>y</em> we can form their <em>conjunction</em> <em>x and y</em> and their disjunction <em>x or y</em>. (To make the algebraic connection clear, Boole used <em>xy</em> for the conjunction of <em>x</em> and <em>y</em>, and <em>x+y</em> for the disjunction of <em>x</em> and <em>y</em>.) Then <em>x or y</em> is identical to <em>y or x</em> and <em>x or (y and z)</em> is identical to <em>(x or y) and (x or z)</em>. This makes <em>and</em> and <em>or</em> look a lot like multiplication and addition. But the analogy is at most an analogy, because unlike the case with multiplication and addition <em>x and x</em> and <em>x or x</em> are just <em>x</em>, and <em>~(x and y)</em> is <em>~x or ~y</em>. </p>
<p>Boole characterised laws that he thought <em>all</em> systems of propositions must satisfy, and the resulting structures are called <em>Boolean Algebras</em> in his honour. They’re important concepts to this day. </p>
<p>Here’s more on Boole: Entries in the <a href="http://www.xrefer.com/entry.jsp?xrefid=551472">Oxford Companion to Philosophy</a>, and the <a href="http://www.xrefer.com/entry.jsp?xrefid=494061">Oxford Dictionary of Scientists</a>. Then there’s <a href="http://www.amazon.com/exec/obidos/ASIN/0486684830/consequentlyorg">Boolean Algebra and its Applications</a> showing some hints of where his research has gone today, and Boole’s original book <em>Laws of Thought</em> is <a href="http://www.amazon.com/exec/obidos/ASIN/0486600289/consequentlyorg">still available today</a>!</p>
<h3>Georg Cantor (1845-1918)</h3>
<p><img class="logician" src="http://consequently.org/images/logicians/Cantor.jpg" alt="[Image of Cantor]" />Georg Cantor conquered the <em>infinite</em>. Well, maybe he didn’t <em>conquer</em> it, but at least gave us a new way of conceptualising infinite quantities, and this is an amazing feat however you look at it. </p>
<p>Everyone agrees that some collections are infinite and some are not. The collection {1,2,3} of the first three counting numbers is <em>finite</em>, it’s <em>bounded</em>. But the collection {1,2,3,4,5,…} of <em>all</em> the counting numbers is not finite. It’s <em>infinite</em> or <em>unbounded</em>, it never comes to an end. Cantor showed that this is not the end of the story at all. He showed that there are <em>bigger</em> and <em>bigger</em> infinite numbers. </p>
<p>Hold on, you might say, how can things be bigger than <em>infinite</em>? Isn’t an infinite collection as big as you can get? Cantor’s answer is a surprising (qualified) <em>no</em>. It’s qualified because if by “infinite” you simply mean “not finite” then there’s nothing bigger than <em>infinite</em>. However, if you mean to say that there are no collections of things bigger than the collection {1,2,3,4,5,…} of all counting numbers, then Cantor can show that you’re wrong. But to do this, he needs to explain a little more about what we mean by “bigger than” and “smaller than” and “same size as” when it comes to collections. </p>
<p>This is pretty straightforward when it comes down to it. Two collections are the <em>same size</em> when you can correlate things from one collection with things from the other collection. So, {1, 2, 3} is the same size as {Christine, Greg, Zachary}. These collections have the same size as we can pair them up: Christine (1), Greg (2), Zachary (3). </p>
<p>One collection is <em>at least as big as</em> another collection if you can pair the things in the second up with things in the first, and maybe have things in the first collection left over. So, for example {Christine, Greg, Zachary} is at least as big as {1,2} because we can pair up Christine (1), Zachary (2) and have me left over, uncounted. </p>
<p>One collection <em>A</em> is <em>smaller than</em> another collection <em>B</em> just when <em>A</em> is not at least as big as <em>B</em>. So, <em>A</em> is smaller than <em>B</em> if there’s no way of pairing things from <em>A</em> with things from <em>B</em> with some things from <em>A</em> (possibly) left over. We try to pair <em>A</em> things with <em>B</em> things, but we’ve not got enough <em>A</em> things to go around to match up the <em>B</em> things. </p>
<p>This round-about-way of defining things is important, because Cantor wants to say that the collection {1,2,3,4,5,…} of all counting numbers is <em>the same size as</em> {2,4,6,8,…} of all <em>even</em> numbers, even though the even numbers are inside the counting numbers with some left over. You’d think that this means that the even numbers are fewer in number than the counting numbers, but this contradicts our first definition that two collections are the <em>same</em> size if they can be paired up. We can pair up all the numbers with the even numbers like this: 1 with 2, 2 with 4, 3 with 6, … <em>n</em> with 2 times <em>n</em>. </p>
<p>This is all good fun stuff (and it’s <em>mind-bending</em> when you <a href="http://ubertas.infosys.utas.edu.au/mathemagicians_circle/table3.html">think about what you can do with these infinite collections</a>) but it’s not even the start of Cantor’s real discovery. Cantor’s best work was in showing that there had to be collections <em>bigger than</em> the collection {1,2,3,…}. This is a truly tricky piece of reasoning, but I think I can explain it. Remember how you can represent <em>real numbers</em> between 0 and 1 as <em>decimals</em>, numbers like 0.5, or 0.32, or infinite repeating ones like 0.333333… (that’s 1/3) or even infinite non-repeating ones like 0.14159… (that’s pi minus 3). Now Cantor showed that the collection of all real numbers between 0 and 1 is <em>truly bigger than</em> the collection of counting numbers. Here’s how he did it. He said, suppose that you <em>did</em> have a list of all of these numbers: then this list would contain <em>all</em> the numbers between 0 and 1. It would look something like this: </p>
<blockquote>
<p>0.12345145…</p>
<p>0.11111111…</p>
<p>0.34989901…</p>
<p>0.31415926…</p>
<p>0.88888888…</p>
<p> . </p>
<p> . </p>
<p> . </p>
</blockquote>
<p>but now, I’ll show you a number that <em>can’t</em> be on the list. Take the first digit (after the decimal point) in the first number, the second in the second number, the third in the third number and so on. You should be focussing on <em>these</em> digits </p>
<blockquote>
<p>0.<strong>1</strong>2345145…</p>
<p>0.1<strong>1</strong>111111…</p>
<p>0.34<strong>9</strong>89901…</p>
<p>0.314<strong>1</strong>5926…</p>
<p>0.8888<strong>8</strong>888…</p>
<p> .</p>
<p> .</p>
<p> .</p>
</blockquote>
<p>Now, make a new number out of these digits, changing each one by adding one (and if a digit is 9, go back to zero). So the number we get is </p>
<blockquote>
<p>0.22029…</p>
</blockquote>
<p>and <em>this</em> number could not be in our original list of numbers, because it is not the same as any number on the list. (The <em>n</em>th number on the list differs from this number in the <em>n</em>th place.) So, the list you <em>said</em> was exhaustive, numbering all of the numbers, isn’t. </p>
<p>That is Cantor’s <em>diagonalisation argument</em>, and it’s a truly creative piece of work, showing that there are different infinite sizes of collections. The argument can be made more general, to show that for <em>any</em> collection there is one bigger, and that’s a mindboggling fact which we still haven’t truly come to understand. (If you <em>think</em> you understand it, ask yourself this: what happens when you apply it to the collection of <em>everything that there is</em>?) </p>
<p>Here’s more about Cantor at <a href="http://www-maths.mcs.st-andrews.ac.uk/history/Mathematicians/Cantor.html">The St. Andrews History of Mathematics Site</a> and the <a href="http://www.shu.edu/projects/reals/history/cantor.html">Interactive Real Analysis</a> site.</p>
<h3>Gottlob Frege (1848-1925)</h3>
<p><img class="logician" src="http://consequently.org/images/logicians/Frege.jpg" alt="[Image of Frege]" />Gottlob Frege is rightly called the <em>father of modern logic</em>. He helped set the tone and direction for the way we study logic to this day. Like many people who made their mark in logic, by training he was a mathematician, but his interests were also philosophical. He realised that the formal techniques of mathematics were good for representing things precisely, but that there were still many more gains to be made. In particular he thought that languages like German (his native language) and English and any other language we actually speak, is filled with ambiguities, inconsistencies and features which lead us astray. In particular, the similar structures of claims like </p>
<ul>
<li>Socrates is mortal. </li>
<li>A human is mortal. (Or “Humans are mortal”, if you prefer.) </li>
<li>No-one is mortal. </li>
</ul>
<p>lead us to think that the same kinds of things are being said in each case: we predicate mortality of Socrates, humanity and no-one in the three statements. Frege thought this was simply crazy, and that the <em>real</em> structure of what you’re saying in each case is rather different. In the first case, we indeed predicate mortality of the person Socrates. In the second case we’re not predicating <em>mortality</em> of anything in particular (or anything in general). According to Frege what we’re doing is very different: we’re saying that another statement is <em>universally satisfied</em>. What statement is this? It’s the statement <em>if x is human, x is mortal</em>. In saying that humans are mortal, I’m saying that <em>if x is human, x is mortal</em> is true for any <em>x</em> I choose. Or more swiftly <em>for all x: if x is human, x is mortal</em>. And <em>this</em> is nothing like the claim that Socrates is mortal. It has a very different structure. </p>
<p>The claim that no-one is mortal has a similar feature. It says not that a particular thing (that is, <em>no-one</em>) is mortal, but rather that the claim <em>x is someone who is mortal</em> is <em>not</em> satisfied. If you like <em>for some x: x is someone who is mortal</em> is <em>not</em> true. </p>
<p>Frege thought that this new way of analysing expressions gets closer to the real structure of the concepts involved. The new way of writing expressions —- making the form you write closer to the forms the concepts actually have —- is Frege’s <em>Begriffschrift</em>, his “Concept Script”. This notation looks very weird (there’s lots of lines going all over the place, and funny letters in different places) but it’s almost identical in content to the language we now call First-Order Logic, or <em>Predicate Logic</em>, and which we teach to our introductory logic students. Frege’s insights have stayed with us to this day. </p>
<p>There’s an entry on Frege in the <a href="http://www.xrefer.com/entry/552123">Oxford Companion to Philosophy</a>. You can get Anthony Kenny’s clear introduction <a href="http://www.amazon.com/exec/obidos/ASIN/0631222316/consequentlyorg/">Frege</a> at Amazon. Both are worth reading. </p>
<h3>Alexius Meinong (1853-1920)</h3>
<p><img class="logician" src="http://consequently.org/images/logicians/Meinong.jpg" alt="[Image of Meinong]" />Frege’s analysis of expressions helps deal with <em>some</em> of the weird confusions you can get into with language: when you know that a expressions like “Socrates”, “somebody”, “everybody” and “nobody” work very differently, you won’t get so confused wondering whether the word “somebody” refers to a person, and if so, what kind of person he or she is (male, female, tall, short, logician, whatever). No, you’ll realise that terms like “somebody”, “everybody” and “nobody” don’t contribute to expressions by <em>referring</em> to things, but by doing something else: they <em>quantify</em> over things. </p>
<p>Meinong agreed with all of that, but he thought that sometimes there are expressions which genuinely <em>do</em> refer to things, and what they refer to tells us something important about what there <em>is</em>. He was one of those philosophers who thought that language, when properly understood, is a guide to <em>ontology</em>. One place where Meinong disagreed with many other philosophers was in the kind of ontology he was prepared to admit on the basis of language. For Meinong, a claim like “I’m thinking of a golden mountain” might be true, and it’s true because there’s something I’m thinking of. What is it I’m thinking of? It’s a golden mountain. So, there’s a golden mountain that I’m thinking about. Now, <em>are</em> there any golden mountains? Do any of them <em>exist</em>? I don’t think so. It follows that (for Meinong) there are two grades of being. There’s the kind of being that absolutely everything has, golden mountains, square circles, fictional characters, tables, chairs, you and me. And then there’s the kind of being that fewer things have: <em>genuine existence</em>. You and I exist (that is, if you’re not a fictional character reading this) but fictional characters, square circles and golden mountains don’t <em>exist</em>. We can think <em>about</em> them, and they have some properties, says Meinong, but <em>existence</em> is not one of them. </p>
<p>This is a bold claim, and it’s easy to see why some people don’t follow Meinong in this view. Why should language guide ontology in this way? (Of course, this is a general technique used by many analytic philosophers to this day. “For our speech about <em>x</em> to make any sense, we need to posit the existence of things such as <em>y</em>…”) But I think there’s much more of a problem with the view as stated. For Meinong, the golden mountain is golden, and it’s a mountain, because that’s how I’ve characterised it. But it doesn’t exist (there aren’t any golden mountains). Now, what if I try to characterise the <em>existing</em> golden mountain. It’s golden, it’s a mountain, but does it <em>exist</em>? No. So some ways of characterising things work, and others don’t. What’s the difference? It’s a tricky question, and it’s one that Meinong never really answered. </p>
<p>There’s an entry on Meinong in the <a href="http://www.xrefer.com/entry/552771">Oxford Companion to Philosophy</a>, and it’s a real shame that both Karel Lambert’s <a href="http://www.amazon.com/exec/obidos/ASIN/0521250854/consequentlyorg">Meinong and the Principle of Independence</a> and Richard Routley’s <a href="http://www.amazon.com/exec/obidos/ASIN/0909596360/">Exploring Meinong’s Jungle</a>, the two best books on Meinong’s ontology, are pretty hard to get. You’ll have to steal them from me, I suppose. </p>
<h3>Giuseppe Peano (1858-1932)</h3>
<p><img class="logician" src="http://consequently.org/images/logicians/Peano.jpg" alt="[Image of Peano]" />Guiseppe Peano was an Italian mathematician, remembered for what are called ‘Peano’s Axioms’, giving the properties of the numbers 0, 1, 2, 3,… and the operations of successor (going to the next number), addition and multiplication. The axioms group into sections. The first few govern zero and successor: </p>
<ul>
<li>0 is a number which is not the successor of any number </li>
<li>every number has just one successor which is a number </li>
<li>and that no two numbers have the same successor. </li>
</ul>
<p>Then for <em>addition</em> we have two axioms: </p>
<ul>
<li>x added to 0 is x. </li>
<li>x added to the successor of y is the successor of (x added to y) </li>
</ul>
<p>And for <em>multiplication</em> we have two more axioms: </p>
<ul>
<li>x multiplied by 0 is 0 </li>
<li>x multiplied by the successor of y is (x multiplied by y) added to x </li>
</ul>
<p>Both batches of axioms tell you how the operation works by showing how it works at the <em>bottom</em> of the scale (how to add zero or multiply by zero), and then it shows you how to do it higher up the scale (adding the successor of a number, or multiplying by the successor of a number) in terms of how it works lower down the scale. </p>
<p>Let’s see one example. Here’s how the axioms tell you what you get when you add 2 and 3. 2 is the successor of the successor of zero, so let’s write that “ss0”, and 3 is the successor of the successor of the successor of zero, so let’s write that “sss0”. In general, if x is some number, let’s write “sx” for the successor of x. </p>
<p>So, to get ss0 + sss0, the rules say that this is the same number as s(ss0 + ss0), because we’re adding sss0 (which is the successor of ss0) to ss0, so the result is the successor of the smaller addition (ss0+ss0). Let’s display this so that we can see it: </p>
<blockquote>
<p>ss0+sss0 = s(ss0+ss0) </p>
</blockquote>
<p>Now, what’s ss0 + ss0? The process is the same: ss0+ss0 = s(ss0+s0). The rules say we can trade an “s” on the right of an addition sign in for one outside the whole addition. So, we get </p>
<blockquote>
<p>ss0+sss0 = s(ss0+ss0) = ss(ss0+s0) </p>
</blockquote>
<p>But we can do this one more time. ss0+s0 = s(ss0+0), so </p>
<blockquote>
<p>ss0+sss0 = s(ss0+ss0) = ss(ss0+s0) = sss(ss0+0) </p>
</blockquote>
<p>But now, we know that ss0 + 0 = ss0, since adding zero gets you <em>nowhere new</em>. So, </p>
<blockquote>
<p>ss0+sss0 = s(ss0+ss0) = ss(ss0+s0) = sss(ss0+0)= sssss0 </p>
</blockquote>
<p>But sssss0 is how we write <em>5</em>, and indeed we’ve shown that 2+3=5. </p>
<p>You can show lots more things with these axioms, but they don’t do everything Peano wanted to think about. In particular, for any numbers x and y at all, you can show that x + y = y + x. However, with these axioms as they stand, you <em>can’t</em> show that for every number x and y, x + y = y + x. Do you get the difference here? The first says I’ve got a proof for every instance. The second says that I’ve got a proof for the general rule. That’s a different thing completely. To show that you’ve got a proof for the general rule we need something to say that whatever we can prove for the instances of numbers we can pick (0, s0, ss0, etc) goes for all of the numbers. A rule which does this is the rule of <em>induction</em>. </p>
<ul>
<li>If something holds of 0, and if whenever it holds of a number it also holds of the successor of that number, then it holds of all the numbers. </li>
</ul>
<p>This rule assures us that we can prove statements about <em>all</em> the numbers, like the statement that the order of addition doesn’t matter. </p>
<p>Now, proofs of facts using Peano’s rules are <em>extremely longwinded</em>, and you might be wondering what this is good for. After all, I already <em>knew</em> that 2+3=5, and I think you did too. Peano’s rules don’t explain what we <em>do</em> when we count or add or multiply. They’re intened to distill to their essence the postulates which govern the counting, adding and multiplying process, even if they’re not the rules we actually follow when we do things. (There are many different ways of learning to multiply. But if you don’t agree with Peano’s rules and get the same results as Peano does for his answers, then you’re either making a mistake, or you’re doing something other than counting.) Peano’s work was essential in clarifying and codifying what counting, adding and multiplying actually involves, and it is another great moment in the work of logicians in the 19th and 20th Centuries. </p>
<p>Peano’s axioms for arithmetic weren’t actually <em>first</em> invented by Peano: The great mathematician Dedekind was responsible for the axioms which Peano took up, clarified, detailed and explained, and it was through Peano that the work was disseminated to Russell and Whitehead and their magnificent <em>Principia Mathematica</em> which shaped a lot of work in the 20th Century. </p>
<p>I find it charming that Peano didn’t just do lots of mathematics and logic. The <a href="http://www.xrefer.com/entry/494994">Oxford Dictionary of Scientists entry on Peano</a> tells us that “among his extramathematical interests he was a keen propagandist for a proposed international language, Interlingua, which he had developed from Volapuk.” Quaint. </p>
<p>Here’s more on Peano from <a href="http://www.xrefer.com/entry.jsp?xrefid=553105">Oxford Companion to Philosophy</a>, and the <a href="http://www.xrefer.com/entry/494994">Oxford Dictionary of Scientists</a>. The hard core among my readers might like to read <a href="http://www.mat.bham.ac.uk/R.W.Kaye/">Richard Kaye</a>’s wonderful <a href="http://www.amazon.com/exec/obidos/ASIN/019853213X/consequentlyorg">Models of Peano Arithmetic</a>. </p>
<h3>Edmund Husserl (1859-1938)</h3>
<p><img class="logician" src="http://consequently.org/images/logicians/Husserl.jpg" alt="[Image of Husserl]" />What? Husserl wasn’t a logician, he was a phenomenologist! That’s the cry of my dedicated analytic philosopher readers. But a response like this is to presume that things in the turn of the 19th/20th Century looked to their inhabitants rather like <em>we</em> think they should, looking back from beyond the great divide between so-called-analytic and so-called-continental philosophy. Husserl couldn’t have conceived of such a division, and as far as I can tell, he’s pretty much an <em>analytic</em> philosopher along with Russell, Wittgenstein, and the rest of the gang. (And hey, didn’t Frege live on the continent? And didn’t half of the rest of them? It’s a crazy distinction, the analytic/continental one when you think of it.) </p>
<p>But why does Husserl warrant a place on my list of great moments in logic? For two reasons. The first is to mourn what might have been. The so-called split which means that people interested in <em>phenomenology</em> (a detailed analysis of phenomena, the structure of appearance, bracketing out questions of existence) can’t talk to people interested in <em>logic</em> is a very sad one. Looking back to Husserl who was active before such a split occured makes me wistful for <em>what might have been</em> and hopeful for <em>what could yet be</em>. Husserl, the great phenomenologist and the one who inspired Heidegger, Sartre and many others, was a student and assistant of the great mathematician Karl Weierstrass, and for fifteen years he was a colleague and close friend of Georg Cantor. </p>
<p>But Husserl is important too for what he has achieved and what we can learn from him. For Husserl, along with Frege and others helped get logic out of the quagmire of <em>psychologism</em> (I’m showing my cards here by the way I describe this, aren’t I?). You can see the confusion even in someone as great as Boole. He calls the laws of logic the <em>Laws of Thought</em>. And that is confusing because it could mean at least two very different things. Either you mean the laws governing how people reason (like laws of physics, which are intended to describe how objects move and interact) or the laws governing how people <em>ought to reason</em>. Only the latter kind of analysis gets the connection between logic and thought right, only it gives logic it’s kind of <em>normative</em> edge, and only this gets the phenomena of teaching first-year logic correct. (If logic is how people actually think, then why do so many of my students find logic hard to learn?) Husserl’s <em>Philosophy of Arithmetic</em> explores this and related themes. </p>
<p>More about Husserl can be found in the <a href="http://www.xrefer.com/entry/552350">Oxford Companion to Philosophy</a></p>
<h3>David Hilbert (1862-1943)</h3>
<p><img class="logician" src="http://consequently.org/images/logicians/Hilbert.jpg" alt="[Image of Hilbert]" />David Hilbert not only had great style in headwear, he was pretty influential when it came to setting the agenda in mathematics and logic too. He’s famous for many of different things, including his work in real analysis (Hilbert spaces) and on the <a href="http://www.amazon.com/exec/obidos/ASIN/0875481647/consequentlyorg">Foundations of Geometry</a>, but he’s most remembered for his 23 <em><a href="http://aleph0.clarku.edu/~djoyce/hilbert/toc.html">problems</a></em> he set the mathematical community at an international congress in 1900. The <em>great moment</em> for me in this work is the spirit in which the enterprise was offered to the community. These new techniques of proof and rigour and clarity have helped us see these problems and issues anew. These are clearly stated problem with answers to be found. We have the technqiues to solve these problems in the affirmative or the negative. For Hilbert, proof and consistency was at the heart of mathematical technique. Proof, in clear logical steps, was the guarantee of truth. Consistency (the absence of any contradictions or other clashes in your assumptions or axioms) is the guarantee of existence. In both cases, logic is placed at the heart of the discipline of mathematics. </p>
<p>Hilbert’s scene setting was effective: the techniques of Godel and Cohen used to give an answer to Hilbert’s first problem on the cardinality of the collection of real numbers, and Gentzen’s proof of the consistency of arithmetic (dealing with Hilbert’s second problem) both used new and fruitful logical techniques. Not only was logic at the heart of mathematics in a way it never really had been before, but new logical techniques and results were being developed so that it could fill that role. The place of logic in the heart of mainstream mathematical practice, and not merely in foundational studies, is in part, due to Hilbert’s conception of the subject. </p>
<p>Here’s information about Hilbert in the <a href="http://www.xrefer.com/entry/494577">Oxford Dictionary of Scientists</a>. </p>
<h3>Ernst Zermelo (1871-1953)</h3>
<p><img class="logician" src="http://consequently.org/images/logicians/Zermelo.jpg" alt="[Image of Zermelo]" />Zermelo did for <em>set theory</em>, the mathematical theory of collections or sets, what Dedekind and Peano did for arithmetic. He was the first to have a bash at working out principles which governed the mathematical practice of set-formation. The theory of sets mathematicians most often appeal to is a direct descendent of Zermelo’s original work. ZF set theory is named after Zermelo and <a href="http://www-groups.dcs.st-andrews.ac.uk/~history/HistTopics/Beginnings_of_set_theory.html">Fraenkel</a> who revised and extended his work. </p>
<p>A nice <a href="http://www-groups.dcs.st-andrews.ac.uk/~history/HistTopics/Beginnings_of_set_theory.html">historical account of Zermelo’s contribution to set theory</a> can be found at the St. Andrews History of Mathematics site. More information about Zermelo himself can be found <a href="http://www-history.mcs.st-andrews.ac.uk/history/Mathematicians/Zermelo.html">there too</a>. </p>
<h3>Jan Lukasiewicz (1878-1956)</h3>
<p><img class="logician" src="http://consequently.org/images/logicians/Lukasiewicz.jpg" alt="[Image of Lukasiewicz]" />Lukasiewicz is the first <em>beardless</em> logician on our journey, since Boole, and similarly, he’s the first <em>algebraist</em> since Boole too. Lukasiewicz is important for many reasons. For one, he was one of the leading lights on logic in Poland for many years (until his emigration to Ireland before the Second World War), responsible for the Logic group in Warsaw, along with <a href="http://www-groups.dcs.st-andrews.ac.uk/~history/Mathematicians/Leshniewski.html">Lesniewski</a>, and Tarski (who we’ll learn about later) was educated in this school. </p>
<p>For another, though, Lukasiewicz was the first truly non-classical logician to gain a foothold for alternative views of logic. The guiding principle behind both Boole’s and Frege’s approach to logic was the statements were either true or false. Lukasiewicz investigated logical structures where this condition was violated. In particular, he looked at three-valued logical systems which kept a way open for things which were undetermined. After all, if our statements are about the future, then some might be made true by present facts, some might be made false by these circumstances, and some might neither be made true nor ruled out — at least if the future is genuinely open. Lukasiewicz’s “three-valued logic” is one way of modelling such phenomena. He also considered a more radical algebraic system where statements can have one of <em>infinitely many values</em>, one for each number between 0 and 1, representing <em>degrees</em> of truth between complete falsity and complete truth. This has now reached some popularity under the name “<a href="http://www.abo.fi/~rfuller/fuzs.html">fuzzy</a> <a href="http://www.austinlinks.com/Fuzzy/">logic</a>”. This just goes to show that if you want to be popular, you ought to get a marketer to run his or her eyes over the papers you write before you submit for publication. “Fuzzy logic” will sell much better than “Lukasiewicz’s Infinely Valued Logic”. </p>
<p>A little on Lukasiewicz can be found in the <a href="http://www.xrefer.com/entry.jsp?xrefid=552680">Oxford Companion to Philosophy</a>. </p>
<h3>Bertrand Russell (1872-1970)</h3>
<p><img class="logician" src="http://consequently.org/images/logicians/Russell.jpg" alt="[Image of Russell]" />Bertrand Russell is the first <em>philosopher</em> on this list from an English-speaking background, and he is probably best considered as the one person who played the crucial role in founding the Anglo/American analytic tradition in philosophy. </p>
<p>Russell’s <em>magnum opus</em> (written with Alfred North Whitehead) is <a href="http://www.amazon.com/exec/obidos/ASIN/052106791X/consequentlyorg">Principia Mathematica</a> (don’t buy the full thing unless you have lots of disposable wealth —- the <a href="http://www.amazon.com/exec/obidos/ASIN/0521626064/consequentlyorg">lite version</a> is enough of the good stuff to give you the flavour of the work). What’s <em>PM</em> all about? It’s the first and greatest attempt in the research programme of <em>logicism</em>, the reduction of mathematics to logic. Now, this is an immensely creative work, because it played a very important part in helping define the notion of <em>logic</em> for the 20th Century. As Alberto Coffa has <a href="http://www.amazon.com/exec/obidos/ASIN/0521447070/consequentlyorg">taught me</a>, I know that logicism wasn’t a matter of taking a predefined notion of “logic” and showing how mathematics could be reduced to it. Rather, it was a matter of expanding the notion of logic so as to make a reduction of mathematics to logic more feasible. In Kant’s time, logic was a matter of the analysis of concepts into their constituents. By the time Russell and Whitehead got their hands on it (after it had passed through the work of Frege) it became so much more. </p>
<p>One thing Russell can be thanked for, above and beyond PM, is a miniature example of logicism and analytic philosophy at work. It’s his little vignette on <em>definite descriptions</em>, which stands to this day as a gem in analytic philosophy. The analysis concerns the difference between claims like </p>
<blockquote>
<p>George Bush is articulate.</p>
<p>The present U.S. President is articulate. </p>
</blockquote>
<p>They look like they have the same form. In the old-style Aristotelian analysis, they’re both of subject-predicate form, with the subject (George Bush, or the present U.S. President) on the one hand and the predicate <em>being articulate</em> being applied to him. But there is an important difference between these claims: The first uses a <em>name</em> and the second uses a <em>description</em>. The description in the second claim is a <em>definite</em> description because it refers to <em>the</em> present U.S. President, not simply <em>a</em> present U.S. President. (That would be an <em>indefinite</em> description.) Definite descriptions seem to have a number of important properties. For them to <em>work</em>, for that claim <em>the present U.S. President is articulate</em> to be <em>true</em>, you need <em>three</em> critieria to be satisfied. First, there needs to <em>be</em> a U.S. President —- if not, your claim fails because there’s no U.S. President to <em>be</em> articulate. Second, there has to be at most <em>one</em> U.S. President. If there are more than one, then it’s unclear which I was talking about, and (according to Russell at least) my claim fails too. Third, if there is exactly one U.S. President then my claim is true if and only if that person is, indeed, articulate. </p>
<p>So, to sum up the analysis, Russell says that a claim of the form “the <em>F</em> is a <em>G</em>” is not really of subject-predicate form at its base. Rather, it has the following form </p>
<blockquote>
<p>There is a thing which is <em>F</em>, it is the <em>only F</em>, and it is a <em>G</em> as well </p>
</blockquote>
<p>This is a typical example of an “analysis”, in analytic philosophy. The surface form of an expression may be deceptive. Different logical work may be involved in the claim, and you might need to expend effort to see what is actually being said. </p>
<p>Russell himself appears to have been rather confused about the significance of what he was doing. Sometimes he described his work as replacing objects with logical constructions. But this is not what’s going on here. The logical construction does not replace any object at all —- the present President of the U.S. is still a flesh and blood human being and not a “construction”. The analysis and reduction occurs at the level of <em>semantics</em>. The meaning of a definite description claim is reduced to being a construction of more primitive kinds of claims, involving predicates and quantification. Analytic philosophy of this kind made the way open for a new kind of reductionism, which didn’t explain away <em>objects</em> or construct them out of more simpler entities, but rather, it explains different kinds of <em>statements</em> by giving their significance in terms of other, simpler statements. You don’t need to refer to special kinds of objects as the referents of definite descriptions, for example, if you have an analysis of definite descriptions which doesn’t appeal to reference at all. </p>
<p>Bertrand Russell is <a href="http://www.google.com/search?q=bertrand+russell">all over the net</a>. The <a href="http://plato.stanford.edu/entries/russell/">Stanford Encyclopedia of Philosophy</a> entry on him is especially good, and the <a href="http://www.mcmaster.ca/russdocs/russell.htm">Russell Archives</a> at McMaster University in Canada are also worth a visit.</p>
<h3>L. E. J. Brouwer (1881-1966)</h3>
<p><img class="logician" src="http://consequently.org/images/logicians/Brouwer.jpg" alt="[Image of Brouwer]" />Brouwer was a Dutch mathematician who founded the school of <em>intuitionism</em>, a radical tradition in mathematics. Intuitionism is <em>radical</em> because it takes much of contemporary mathematics to be simply mistaken, that mathematicians took a wrong turn when following Cantor’s direction in set theory, and the classical tradition in analysis (the theory of real-valued functions). Mathematics has gone bad when dealing with the <em>infinite</em>, because traditional mathematical practice does not do justice to what mathematics is actually <em>about</em>, according to Brouwer. </p>
<p>For Brouwer, mathematics is primarily governed by the <em>intuition</em> of the knowing and proving “mathematical subject”. Now, <em>intuition</em> doesn’t mean “gut instinct” like it does in contemporary language. The term is a piece of art looking back at least to Kant and his <em>Critique of Pure Reason</em>. Intuition, for Brouwer, just means a mental faculty. The important features of the intuition relevant to mathematics is that they are <em>pure</em> intuitions of space and time. These intuitions aren’t given by experience, but rather, they structure experience. We put our experiences together in a “manifold” of moments and locations: we don’t extrapolate the idea of time or space from our experiences (for Kant, and for Brouwer). Anyway, the details are irrelevant for us, the fact that the mental ability to <em>count</em>, to go to the <em>next thing</em>, an intuition of <em>duality</em> or <em>two</em>-ness is what is important in mathematics. The content of mathematical judgement is not some correspondence with an external world of mathematical objects, but rather, the contents of mathematical judgements (like the claim that 2+2=4, or that the area of a circle is proportional to the square of the radius, or that real-valued functions which are somewhere positive and somewhere negative are also zero somewhere) are to be found in the possible <em>verifications</em> or <em>constructions</em> involved. </p>
<p>Now, this approach is both conservative (it’s <em>Kantian</em>, not the radical approach of logicism stemming from Frege and Russell) and radical. It’s radical because it motivates a rejection of traditional mathematical claims, like the law of the excluded middle —- the thesis that every proposition is either true or not true. Brouwer takes this to be mistaken because of the nature of mathematical judgement and proof. Consider this simple example: suppose I give you a series of numbers, one by one. 1, 1/2, 1/4, 1/8, … I ask you if this series converges to zero or doesn’t. If this series is truly <em>infinite</em> (I’ll just keep giving you numbers as long as you keep asking for them) you’ll never know if the series is converging to zero, or that it’s not going to zero. (If I just give you the numbers one-by-one, and I do not give you a <em>rule</em> which generates the list: there’s always a chance the series will stop shrinking, and I go 1/8, 1/8, 1/8, …, or that I start going up instead of going down.) Browuer takes this to be a reason to reject the law of the excluded middle. We oughtn’t say that the series is converging or not. Once you make <em>this</em> change to mathematical practice, a lot else looks <em>very</em> different. Intuitionistic mathematics is alive and well to this day as a minority tradition. </p>
<p>More information about Brouwer can be found at the <a href="http://www.xrefer.com/entry/551494">Oxford Companion to Philosophy</a>. </p>
<h3>Thoralf Skolem (1887-1963)</h3>
<p><img class="logician" src="http://consequently.org/images/logicians/Skolem.jpg" alt="[Image of Skolem]" />Thoralf Skolem was a Norwegian logician and mathematician who continued the development of set theory along the lines started by Cantor and Zermelo. Skolem’s name is associated with one of the most interesting results in metalogic (that is, it’s a result <em>about</em> logic, not a result <em>in</em> logic), which we now call the <a href="http://cheng.ececs.uc.edu/cs543/4-29.html">Lowenheim Skolem Theorem</a>. This states that if a statement (or set of statements) in Frege’s predicate logic can be satisfied by a model with infinitely many things in the domain, it can also be satisfied by a model with only <em>countably</em> many things. So, predicate logic, in an important sense, cannot tell the difference between the countably infinite and the uncountable infinite. </p>
<p>The most stunning and problematic consequence of this is <a href="http://www.nd.edu/~tbays/professional/abstract.html">Skolem’s Paradox</a>. Take the theory of sets. In this theory you can distinguish between countably infinite sets and uncountably infinite sets (a countably infinite set is one which can be put into a one-to-one correspondence with the numbers {1,2,3,…}), and furthermore, you can prove that there <em>are</em> uncountably infinite sets (Cantor’s construction can be carried out). This theory, if it is consistent, has a model. This model must be <em>infinite</em> (it contains elements for each of the numbers 1, 2, 3, at least!) so by the downward Lowenheim-Skolem theorem, it also has a countable model. But what of the sets that the <em>theory</em> takes to be uncountably infinite. From <em>inside</em> the model, they are uncountable. But from outside, we see that they are not. What is the story? </p>
<p>Well, that’s a real problem. Skolem’s enticing response was to say that the difference between the countable and the uncountable was <em>relative</em> and not <em>absolute</em>. Another response would be to say that the predicate logic theory of sets is incomplete, and it must be extended somehow. </p>
<p>Interesting information about Skolem and the application of his ideas can be found in the <a href="http://www.hf.uio.no/filosofi/njpl/vol1no2/contents.html">Nordic Journal of Philosophical Logic’s special issue on Skolem</a>.</p>
<h3>Ludwig Wittgenstein (1889-1951)</h3>
<p><img class="logician" src="http://consequently.org/images/logicians/Wittgenstein.jpg" alt="[Image of Wittgenstein]" />The next entry on our tour simply <em>has</em> to be the inimitable LW. Wittgenstein is an incredibly fertile philosopher: his work has inspired philosophers from all traditions. His <em>Tractatus Logico Philosophicus</em> (written in 1918, after Wittgenstein served in the German army) is an enigmatic tract, which starts (in one translation) like this. </p>
<blockquote>
<p><strong>1</strong> The world is everything that is the case.</p>
<p><strong>1.1</strong> The world is the totality of facts, not of things.</p>
<p><strong>1.11</strong> The world is determined by the facts, and by these begin <em>all</em> the facts.</p>
<p><strong>1.12</strong> For the totality of facts determines both what is the case, and also all that is not the case.</p>
<p><strong>1.13</strong> The facts in logical space are the world. </p>
</blockquote>
<p>And it continues in this vein. It is a work in <em>logical atomism</em>, the doctrine that the world is made up of atomic facts, the primary bearers of information, and it motivates the logical techniques of truth tables and other interesting formal things as consequences of this picture. </p>
<p>Much more important for Wittgenstein was the boundary between the <em>sense</em> and <em>nonsense</em>, or what could be <em>said</em> and what could not be said and what could only be <em>shown</em>. The closing words in the Tractatus are </p>
<blockquote>
<p><strong>7</strong> Whereof one cannot speak, thereof one must be silent. </p>
</blockquote>
<p>What is most interesting to me is that Wittgenstein explicitly acknowledges that his own book is, by his own lights, expressing what cannot be said. The entire book is an act of <em>showing</em> and not of <em>saying</em>. It’s a peculiar kind of showing, using German (or English) words, which the audience reads in the traditional manner. (Wittgenstein himself was later unsatisfied with his own approach and he attempted to paint a very different picture about how language works.) </p>
<p>More information about Wittgenstein can be found at the <a href="http://www.xrefer.com/entry/553892">Oxford Companion to Philosophy</a>. There are online editions of both the the <a href="http://www.kfs.org/~jonathan/witt/tlph.html">Ogden-Ramsey</a> and the <a href="http://guava.phil.lehigh.edu/tlp/">Pears-McGuinness</a> translations of the <em>Tractatus</em>. <a href="http://www.helsinki.fi/~tuschano/">T. P. Uschanov</a> has a <a href="http://www.helsinki.fi/~tuschano/lw/links/">comprehensive collection</a> of links of online resources on Wittgenstein. </p>
<p>It is the mark of LW’s distinction that he is the only person on this page to have a [<em>musical</em> written about him. Unfortunately, I have not seen it. The Tractatus has also been <a href="http://www.guardian.co.uk/Print/0,3858,4269937,00.html">set to music, more than once</a>, unfortunately, I have not heard any of it. </p>
<h3>Rudolf Carnap (1891-1970)</h3>
<p><img class="logician" src="http://consequently.org/images/logicians/Carnap.jpg" alt="[Image of Carnap]" />Rudolf Carnap was a German philosopher, educated in the dominant Kantian tradition, interested in science and epistemology (the theory of knowledge). Carnap had one of the “conversion experiences” common to great evangelists. While sick one day he read some of the knew “formal” philosophy of Bertrand Russell, and the scales fell from his eyes. The combination of rigour and philosophical applicability convinced Carnap that from this day henceforth, he wanted to do philosophy like <em>that</em>. </p>
<p>And so, Rudolf Carnap worked in the tradition started by Russell, of the application of formal techniques to philosophical problems. But in Carnap’s hands, these techniques had very different outcomes. Carnap’s masterworks, the <em>Aufbau</em> and the <em>Logical Syntax of Language</em> indeed use techniques rather like Russell’s in <em>Principia Mathematica</em> and <em>The Principles of Logical Atomism</em> but the resulting philosophical picture cannot be more different. While Russell was an atomist and foundationalist for many of his years (though what these <em>atoms</em> might be was ever elusive for Russell), Carnap was temperamentally very different. He was, by nature, a kind of accommodating pluralist. He thought that the new logical techniques would help us see what was genuinely being <em>said</em> by different philosophical positions, and that we might see the things on which different philosophers agree, and those on which they have genuine disagreements, and those upon which the disagreement is a purely verbal matter. An example from the philosophy of mathematics might give you an idea of how this works. In mathematics, we have rules for adjudicating disagreement in many cases: if I say that 37+56=83, then you can show me where I went wrong by explaining how the addition actually works: 37+56 is <em>93</em> (perhaps I forgot to carry the 10 from the addition of 7 and 6). Similarly, if I deny that there is a prime number between 11 and 17, you can point out that 13 is a prime number between them. The <em>meanings</em> of the mathematical terms dictate how they should be used, and they give us answers in these cases. They <em>don’t</em> help in the argument between the platonist (who thinks that numbers <em>really</em> exist) and the formalist (who thinks that numbers <em>really don’t</em> exist). If either attempts to get into a discussion with Carnap about whether or not there <em>really</em> is a prime number between 11 and 17, he’ll simply say, “yes, there is a prime number between 11 and 17 — it’s 13 — but I don’t know what you mean by saying “really” in the question.” No sense has been given to the question of the existence of numbers, over and above the sense that has been given by virtue of the meanings of mathematical terminology. It’s the job of techniques from <em>logic</em> to clarify what can be said, and what cannot. In this sense, Carnap is quite close to the Wittgenstein of the Tractatus. </p>
<p>More information about Carnap can be found at the <a href="http://www.xrefer.com/entry/551537">Oxford Companion to Philosophy</a>.</p>
<h3>Arend Heyting (1898-1980)</h3>
<p><img class="logician" src="http://consequently.org/images/logicians/Heyting.jpg" alt="[Image of Heyting]" />Arend Heyting was a brilliant Dutch logician: beardless, as you can see —- the <em>Return of the Beards</em> will be quite some decades to come. Heyting’s claim to fame was to do something quite against the spirit of the intuitionist enterprise, but which made intuitionism a respectable and living (if <em>minority</em>) tradition in logic. </p>
<p>Heyting <em>formalised</em> intuitionistic logic. That is, he codified the kinds of inferences which are warranted by the lights of an intuitionist. This made “intuitionistic logic” an object of study, amenable to many of the same techniques that Frege and others had developed for the dominant tradition in logic, which we now call “classical” logic. </p>
<p>More information about Heyting can be found at the <a href="http://www-groups.dcs.st-andrews.ac.uk/~history/Mathematicians/Heyting.html">St. Andrews’ History of Mathematics Entry</a> on him. </p>
<h3>Haskell Curry (1900-1982)</h3>
<p><img class="logician" src="http://consequently.org/images/logicians/Curry.jpg" alt="[Image of Curry]" />Haskell Curry was an American student of Hilbert. His greatest innovative contributions to logic are in the odd area of <em>combinatory logic</em>. Combinators are strange beasts: they’re like functions which operate on other functions. Combinatory logic is a formal system like other kinds of logic: you have a collection of objects with different rules indicating allowable transformations from objects to other objects. But these combinators do not necessarily express <em>statements</em>, as the formulas in a traditional logic do. They’re <em>functions</em>. </p>
<p>The frame of mind required to think in this way (to see everything as a function) is important in many fields today, and the debt to Curry is sometimes acknowledged and sometimes not. For example, in computer science, the transformation required to move from thinking of a function as giving you an output given a <em>pair</em> of inputs (for example, addition as a function sending <em>x</em> and <em>y</em> to <em>x + y</em>) to thinking of it as giving a <em>function</em> as output when given a single input (so given <em>x</em> the output is the function which sends <em>y</em> to <em>x + y</em>: the <em>adding x</em> function) is called <em>currying</em> in Curry’s honour. This kind of transformation, which involves thinking of functions as first-class entities, is important in many disciplines, such as <a href="http://plato.stanford.edu/entries/category-theory">category theory</a> and <em>functional programming</em>. In fact, my favourite functional programming language <a href="http://haskell.org">Haskell</a> is named after Curry. </p>
<p>Curry made another very important contribution to the tradition: his textbook <a href="http://www.amazon.com/exec/obidos/ASIN/0486634620/consequentlyorg">Foundations of Mathematical Logic</a> is still <em>rich</em> with insight, and it rewards reading and rereading today. It is the first textbook in mathematical logic which takes a synoptic view of different logical systems and which encourages the reader to think philosophically and creatively about the different kinds of formal systems which might be used to model different logical phenomena. </p>
<p>More information about Curry can be found at the <a href="http://www-groups.dcs.st-andrews.ac.uk/~history/Mathematicians/Curry.html">St Andrews’ History of Mathematics Entry</a> on him. </p>
<h3>Alfred Tarski (1902-1983)</h3>
<p><img class="logician" src="http://consequently.org/images/logicians/Tarski.jpg" alt="[Image of Tarski]" />Alfred Tarski’s shadow looms large over 20th Century Logic, and it extends into the 21st Century too. An emigre from Poland, educated in the great Warsaw school of logicians, Tarski brought a new degree of conceptual clarification to a great number of issues in logic. I will sketch two here. </p>
<p><em>First</em>, Tarski gave the first rigorous definition of what it was for a structure to be a <em>model</em> or an <em>interpretation</em> of the language of predicate logic. He gave precise clauses indicating for each kind of sentence (atomic sentence, conjunction, disjunction, negation, universally quantified, existentially quantified, etc) what it is for this sentence to be <em>true in</em> a model. To do this, he noticed that you need to do something tricky when it comes to <em>quantified</em> sentences like for all <em>x</em>(if F<em>x</em> then G<em>x</em>). For this to be given a sensible truth condition, we want its truth to depend on the truth of the part inside the quantifier. But if F<em>x</em> then G<em>x</em> is not a sentence: it’s got a variable in it unbound. (It’s like the term <em>x</em> + 2: you only know what number it is when I tell you the <em>value</em> of the variable <em>x</em>.) So, Tarski solved the problem this way. You don’t define what it is for a sentence to be <em>true in</em> a model. You define what it is for a formula (possibly including free variables) together with an <em>assignment of values to each of the variables</em> to be <em>satisfied by</em> a model. So, for all <em>x</em>(if F<em>x</em> then G<em>x</em>) together with the assignment A is satisfied by my model just when the inside bit if F<em>x</em> then G<em>x</em> together with any <em>variant</em> assignment A’ which assigns exactly the same values as A does to any variable other than <em>x</em>, but possibly assigns <em>x</em> any value it chooses. This gets the result exactly right. And it gives a clear (well, after you get used to it, anyway!), rigorous and recursive definition of satisfaction, and truth in a model. </p>
<p>The <em>Second</em> insight is related. It’s also on the topic of truth. Here, the idea is not truth in a <em>model</em>, but genuine truth. The kind of truth we attempt to express when we make assertions. Many philosophers have said deep and mystical things about the Nature of Truth. Some have said that truth is a matter of Correspondence to Reality (after all, propositions are designed to reflect the Way the World Is). Others have said that truth is a matter of the Coherence of an overall body of propositions (after all, we test propositions only against other propositions). Still others have said that truth is a matter of What Gets Things Done (after all, in describing things we always aim to Do something, and this governs the kinds of concepts we have). Tarski thought that all accounts like this are misguided. For given a language which doesn’t say anything about truth, it is easy to <em>define</em> the notion of truth in that language, without appealing to Correspondence, Coherence, or Pragmatic concerns. Suppose we’ve got a sentence in our language, like “snow is white”. (This is a favourite in discussions of truth, for some reason.) We know very well what the sentence <em>means</em>. We want to know whether or not the sentence is <em>true</em>. Well, given that we know what it means, we can say exactly the conditions under which this sentence is true: </p>
<blockquote>
<p>“Snow is white” is true if and only if snow is white </p>
</blockquote>
<p>Now this tells us exactly the circumstances under which “snow is white” is true. And it doesn’t say anything about Correspondence to Reality, Coherence, or Pragmatic concerns. It is Tarski’s <em>definition</em> of the concept of truth, and it’s become an important benchmark in any discussion of the topic to this day. </p>
<p>More information about Tarski can be found at the <a href="http://www.xrefer.com/entry/553669">Oxford Companion to Philosophy</a>. </p>
<h3>Frank Ramsey (1903-1930)</h3>
<p><img class="logician" src="http://consequently.org/images/logicians/Ramsey.jpg" alt="[Image of Ramsey]" />If I’d done as much as Frank Ramsey had achieved by the time <em>I</em> was 27, I’d be glad. Of course, I’m very glad to have made it past 27. </p>
<p>Ramsey not only did amazing work in the philosophy of logic and probability. His insight into how <em>theoretical terms</em> work has earned his surname a place in the <a href="http://www.google.com/search?q=ramsification">lexicon</a>. Yes, Frank Ramsey is responsible for the technique we now delightedly call <em>Ramsification</em>. </p>
<p>Ramsification is a straightforward notion when you get your head around it. It’s a theoretical application to <em>concepts</em> of Russell’s account of definite descriptions. It’s always been a bit of a mystery how theoretical terms like <em>neutrino</em> actually work. People started talking about neutrinos (I love the name by the way: <em>little neutral one</em> is a perfect name for a pet, at least if he/she is placid) before they’d ever found conclusive evidence of their existence. It’s not like they’d <em>laid eyes</em> on them and said “I will call this a <em>neutrino</em>”. No, what happened instead is that the scientists endorsed a body which included the predicate “is a neutrino”. The theory will contain things like “Neutrinos have no charge”, “Neutrinos have negligible mass” and other things like this. Now this theory can have sense, and can <em>assign</em> a kind of meaning to the term “neutrino” in just the same way as Russell’s analysis of definite descriptions shows how sense is assigned to definite descriptions. The theoretical term “neutrino” doesn’t really refer, but you can treat the terms as a predicate <em>variable</em>, and the theory really says something like </p>
<blockquote>
<p>(for some X)(X has no charge, and X has negligible mass, and …)</p>
</blockquote>
<p>And in this way, theoretical terms are introduced into the language. </p>
<p>This technique has seen a <em>lot</em> of use in contemporary work coming out of <a href="http://web.syr.edu/%7Edpnolan/philosophy/Credo.html">Canberra</a>. </p>
<p>More information about Ramsey can be found at the <a href="http://www.xrefer.com/entry/553336">Oxford Companion to Philosophy</a>. </p>
<h3>Alonzo Church (1903-1994)</h3>
<p><img class="logician" src="http://consequently.org/images/logicians/Church.jpg" alt="[Image of Church]" />Alonzo Church’s influence over logic is long-lived, as he was. I’ll focus on just two ways he has left his mark on the field. First, and most obvious, was his invention of the <em>lambda calculus</em>. This is a notion for representing functions, immensely suited to the same body of theory as Curry’s <em>combinatory logic</em>. In fact, Church’s notation for functional abstraction (using a <em>lambda</em>, which I’ll write here with a backslash “") is a uniform technique which, when combined with functional application, gives you exactly the same theory as Curry’s combinators. The notation is simple. The addition function can be represented like this: </p>
<blockquote>
<p>\x\y(x+y)</p>
</blockquote>
<p>It’s a function, which when applied to a number (say 2) gives you the result \y(2+y). You figure out how it works by taking the first lambda abstraction out the front, removing it, and replacing the variables inside the rest which were bound by that abstraction, by the value you chose. The result is still a function. If you apply this to another number (say 3) you get the result 2+3. So addition here is a function which takes two values, and returns a number. </p>
<p>More can be said about the lambda calculus, and its use as a language for representing functional abstraction. I want to go on to consider what might have been Church’s greatest achievement. He founded, in 1936, the <a href="http://www.aslonline.org/asl/JSL/JSL.html">Journal of Symbolic Logic</a> in 1936, along with its parent body, the <a href="http://www.aslonline.org/">Association for Symbolic Logic</a>. The <em>JSL</em> is the most prestigious journal in formal logic, and it has played (especially in its early years) a crucial pivotal role in helping define the community of logicians, by giving a focal point for research and a means for disseminating results broadly. Logicians did not have to resort to scanning over a wide body of mathematics and philosophy journals to find articles of importance to logic. Now they could concentrate in the one place. </p>
<p>More information about Church can be found at the <a href="http://www-groups.dcs.st-andrews.ac.uk/~history/Mathematicians/Church.html">St Andrews’ History of Mathematics Entry</a> on him. </p>
<h3>Kurt Gödel (1906-1978)</h3>
<p><img class="logician" src="http://consequently.org/images/logicians/Godel.jpg" alt="[Image of Gödel]" />Gödel’s <em>incompleteness theorem</em> is great in two ways. First, it’s the technical result in logic most cited outside its field. Second, it’s a stunning piece of reasoning which genuinely broke open a new field and closed off other areas of inquiry. </p>
<p>Gödel’s incompleteness theorem shows that Peano’s theory of arithmetic is essentially <em>incomplete</em>. For some sentences in the language of arithmetic, it cannot decide between that sentence and its negation. Gödel shows that this is not an accidental feature of Peano’s theory, to be fixed with a little patch here or there. No, <em>any</em> theory of arithmetic which is such that you can tell (by means of a recursive function: look to <em>Turing’s entry</em> coming on up) whether or not something is an <em>axiom</em> of the theory, then exactly the same incompleteness phenomenon will hold. Why is this? It’s because an arithmetic theory is rich enough to <em>represent</em> in some sense, it’s own facts about <em>provability</em>. That is, it can simulate provability in its own claims about numbers. Gödel showed how claims about sentences and proofs can be “encoded” into claims about numbers, in such a way that if there <em>is</em> a proof of some claim, then there is a proof in arithmetic which represents that proof. Once you’ve pulled this trick (it’s the trick of <em>Gödel numbering</em>), you then need to pull another trick (called <em>diagonalisation</em>, it’s close in spirit to Cantor’s diagonal argument) to construct a sentence which, in effect says </p>
<blockquote>
<p>I am not provable in Peano’s Arithmetic </p>
</blockquote>
<p>If this sentence <em>is</em> provable in Peano’s arithmetic, then since provability in this arithmetic implies truth, it is not provable in Peano’s arithmetic, and as a result the arithmetic is inconsistent. On the other hand, if it’s not provable in Peano’s arithmetic, then it itself is an example of a sentence which is true but is not provable: and as a result, the arithmetic is incomplete. </p>
<p>Now, there’s a <em>lot</em> that can be said about this result. And there’s a lot of garbage that has been said about this result too (so called “applications” range from theories of the mind, of culture, of value, of art, of this that and the other). It think it’s stunning enough in its original form. And working out its implications for logical theories, and knowing when (and on what basis) we can claim consistency or completeness, is plenty interesting enough. </p>
<p>More information about Gödel can be found at the <a href="http://www-groups.dcs.st-andrews.ac.uk/~history/Mathematicians/Gödel.html">St. Andrews’ History of Mathematics Entry</a> on him.</p>
<h3>W. V. O. Quine (1908-2000)</h3>
<p><img class="logician" src="http://consequently.org/images/logicians/Quine.jpg" alt="[Image of Quine]" />Quine is not famous for his <em>logic</em> so much as for the mark he made on philosophy in the english-speaking world in the second half of the twentieth century. However, he was a formidable logician, with contributions in set theory (his <em>New Foundations</em> is an alternative view of the set-theoretic universe, radically at odds with the Zermelo-Fraenkel picture inspired by Cantor) and other areas of logic. However, it was his imprint on <em>philosophy as a whole</em> for which Quine is rightly remembered. </p>
<p>The centre of Quine’s contribution can be seen in his work on <em>meaning</em> and the <em>holist</em> picture radically at odds with Carnap’s view of how language works. For Carnap, the <em>meaning postulates</em> governing a discourse show us how the language works, and once you have the meaning postulates (the <em>analytic</em> truths) the “world” contributes the rest, the (the <em>synthetic</em> truths). The analytic truths don’t tell us anything <em>about the world</em> but the synthetic truths do. This is a compelling picture, and it’s one that has basically been the received doctrine in understanding language and concepts, from the British Empiricists, through Kant, and up to the middle 20th Century. Of course, the picture has not been a uniform one. Kant argued that some synthetic truths were knowable <em>a priori</em>, and the work in logic in the early 19th and 20th Centuries greatly expanded our understanding of what might count as “analytic”. However, everyone agreed that there was a sensible distinction to be drawn between the analytic and the synthetic. </p>
<p>Quine changed all of that. With novel arguments and though experiments (in particular, the problem of <em>radical translation</em>: see <a href="http://www.amazon.com/exec/obidos/ASIN/0262670011/consequentlyorg">Word and Object</a> and the famous article “Two Dogmas of Empiricism”) Quine set about to dismantle the analytic/synthetic distinction. For Quine, any body of theory cannot be unambiguously split into analytic and synthetic components, where the synthetic is prone to revision and the analytic immune from revision. The body of theory is to be considered as a whole, and judged in this way. Quine was the first explicit empiricist <em>holist</em>. </p>
<p>To this day, anyone who takes the analytic/synthetic distinction seriously owes a debt to explain how it is to be understood, in the face of Quine’s arguments. For bringing this important issue to light, Quine is to be praised! </p>
<p>More information about Quine can be found at the <a href="http://www.wvquine.org/">Quine Home Page</a>. </p>
<h3>Gerhard Gentzen (1909-1945)</h3>
<p><img class="logician" src="http://consequently.org/images/logicians/Gentzen.jpg" alt="[Image of Gentzen]" />Gerhard Gentzen brought the study of logic to a completely new level with his work on the theory of <em>proofs</em>. Logicians, since Aristotle, have been interested not only in what you can prove, but also in proof itself. But somewhat suprisingly, up until Gentzen’s time, no-one had a coherent story to tell about what a proof actually <em>is</em> and what logical properties proofs might have. Gentzen’s work changed this, and he is now seen as the archetypal <em>proof theorist</em>. </p>
<p>Gentzen’s innovation was to introduce proof as an object of study. He formalised two different kinds of proofs, which we now call <em>Natural Deduction</em> and <em>Gentzen Systems</em> in his honour. A Gentzen system is an interesting kind of way of proving things, because unlike other kinds of proof, a Gentzen proof is not a series of statements, each of which follows from earlier statements in the series. (A Natural deduction proof is like this, except that statements may be <em>assumed</em> and assumptions may also be <em>discharged</em> at different points in the proof.) A Gentzen proof is very different: at each stage of a Gentzen proof, you prove not <em>statements</em> but <em>sequents</em>. A sequent is not an individual statement, but rather, a claim saying that one statement follows from other statements. One way of thinking about it (and this was Gentzen’s own way of thinking about it) is that a Gentzen proof is a proof <em>about</em> other proofs. The steps don’t say things like “this follows from that” but “if there’s a proof of <em>B</em> from <em>A</em> then there’s a proof of <em>C</em> from <em>A</em> too”. </p>
<p>Gentzen systems are beautiful because they give you a deeper understanding of what can be done with proofs. One of Gentzen’s own applications was to use a Gentzen system for Peano Arithmetic to show that arithmetic was indeed consistent. Gentzen’s argument is quite clever. He shows that there is no way that you could get a proof of an inconsistency from the axioms because any such proof could be transformed into a <em>smaller</em> proof of an inconsistency from the axioms, and there’s no one-step proof of an inconsistency. (Actually, the proof is a bit trickier than this, as it’s a corollary of Gentzen’s famous <em>Cut Elimination Theorem</em>, but this is the core of the way that the result is proved, if you think about it for a bit!) </p>
<p>This result might be seen to be in conflict with Gödel’s incompleteness result, which has a corollary that Peano’s arithmetic can’t prove its own consistency. However, there’s no conflict, as Gentzen’s techniques, though straightforward, actually presume something <em>more</em> that arithmetic itself. These techniques use a form of mathematical induction stronger than that supplied in ordinary arithmetic. This result has spawned many more like it, and the study of the relative proof-theoretical strength of different theories is now a well-understood discipline in logic. </p>
<p>More information about Gentzen can be found at the <a href="http://www-groups.dcs.st-andrews.ac.uk/~history/Mathematicians/Gentzen.html">St. Andrews’ History of Mathematics Entry</a> on him. </p>
<h3>Alan Turing (1912-1954)</h3>
<p><img class="logician" src="http://consequently.org/images/logicians/Turing.jpg" alt="[Image of Turing]" />Alan Turing is famous for the <em>Turing Test</em> (a claim about what it would take for something to count as <em>intelligent</em>: get it to communicate with you in conversation over a network connection) for <em>Turing Machines</em>, and for half of the name of the <em><a href="http://plato.stanford.edu/entries/church-turing/">Church-Turing Thesis</a></em>. I think that the latter two are more interesting from the point of view of logic than the first one. </p>
<p>Turing Machines are not really <em>machines</em> at all. The idea of a Turing machine is that of a characterisation of a <em>kind of</em> computing device, and it’s the kind of computational device stripped down to its limit. All it involves is a long tape divided into segments (picture a roll of toilet paper unrolled). The tape is <em>long</em> in the sense that if you ever get to an end, you can go out to the shop and get some more to add on. So, you never run out of tape. Then, you have a marker where you can write a sign on a square of the tape. (You can overwrite an existing sign with a new sign too: the new sign replaces the old one.) You have a finite collection of possible signs, including the blank sign for a square which has no other sign written on it. You also have a finite set of <em>states</em> which you can think of as points on a flowchart. The <em>instructions</em> are the arrows on a flow chart which say things like this: If you’re in this state, and you’re looking at a square with <em>this</em> symbol on it, then follow <em>this</em> instruction, and go to <em>this</em> state. What’s an instruction? It can be one of three things. It’s either to write a sign in the square you’re looking at, or move left one square and look at this new square, or move right one square. That’s it. If you’re in a state looking at a symbol on a square and you have <em>no</em> instruction to follow, your computation simply stops. </p>
<p>That’s it. That’s all there is to a Turing machine. It’s not exactly the kind of computer you can use for word-processing, or playing <a href="http://www.idsoftware.com">games</a> with. However, the kinds of computations you can do on this kind of machine (especially when you think of representing numbers on the machine using some code) are a really natural class of functions. They’re the <em>recursive</em> functions, independently characterised by Church. And the Church-Turing thesis is the claim that this class of functions is exactly the class of functions which could be <em>computed</em> using any computational device. </p>
<p>More information about Turing can be found at the <a href="http://www-groups.dcs.st-andrews.ac.uk/~history/Mathematicians/Turing.html">St Andrews’ History of Mathematics Entry</a> on him. </p>
<h3>Arthur Prior (1914-1969)</h3>
<p><img class="logician" src="http://consequently.org/images/logicians/Prior.jpg" alt="[Image of Prior]" />Arthur Prior is the first (and only) <em>antipodean</em> logician on this list. Educated in New Zealand, he had academic positions both in New Zealand (at Otago and Canterbury) and in England (at Manchester, and Oxford). Prior invented the field of <em>tense logic</em>, the logic of “earlier” and “later”, “past” and “future”. He was the arch <em>intensionalist</em>, bringing to the philosophical fore these <em>modalities</em> which are not truth-functional, not obviously amenable to Tarski’s analysis of truth-in-a-model. Remember that in Tarki’s world, the truth or otherwise of a complex expression depends on the truth or otherwise of its components. The <em>temporal</em> operators don’t work like this at all. “it’s raining” and “it’s Thursday” might both be true, but “yesterday it rained” and “yesterday it was Thursday” might differ in truth value. The truth or falsity of temporal operators is <em>intensional</em> and not <em>extensional</em>. It depends on more than just the truth value of the components. </p>
<p>There is a tradition in logic to attempt to erase the intensional by making it genuinely <em>extensional</em> (replacing talk of “it rained” by “it rained on day <em>x</em>” and explicitly quantifying over days or times) — Quine’s work is a very good example of this — but Prior resisted this move strongly. For Prior, there was nothing wrong with irreducable intensionality, provided that you could be clear about the logical properties these intensional creatures satisfied. Prior’s work did a great deal to rehabilitate the intensional and to put it on an equal footing with the extensional tradition in logic. This work would explode onto the scene with some developments of Kripke and what is now known as “possible worlds semantics”, but it was Prior’s work which set the scene and showed the enormous range of philosophical applicability of these ideas. </p>
<p>Excellent information about Prior can be found in <a href="http://www.phil.canterbury.ac.nz/jack_copeland/">Jack Copeland</a>’s <a href="http://plato.stanford.edu/entries/prior/">entry on Prior in the Stanford Encyclopedia of Philosophy</a>. </p>
<h3>Helena Rasiowa (1917-1994)</h3>
<p><img class="logician" src="http://consequently.org/images/logicians/Rasiowa.jpg" alt="[Image of Rasiowa]" />At <em>last</em>, a woman! The month is nearly at an end, and at last, I have found a female logician to join our list of stars. Helena Rasiowa was an incredible logician from Poland, who helped place the study of <em>logics</em> on a mathematical footing. Continuing on the work of Boole and Lukasiewicz, she showed, in her groundbreaking book <a href="http://www.amazon.com/exec/obidos/ASIN/0720422647/consequentlyorg">An Algebraic Approach to Non-Classical Logics</a> showed how contemporary techniques in <em>algebra</em> may be used to study the structures of propositions arising out of different conceptions of logic. This book is rich in ideas and treatments of Boolean algebras, Heyting algebras (models of intuitionistic logic), the many valued logics of Lukasiewicz, and others. This is one of the first books to give a unified treatment of <em>logics</em> rather than a partisan development of this system or that system. </p>
<p>Rasiowa’s work also encouraged me as a budding mathematics student, to go into logic. Browsing through <a href="http://library.uq.edu.au/search/arasiowa+helena/arasiowa+helena/1,1,4,B/frameset&F=arasiowa+helena&1,,4">its pages</a> in the old University of Queensland Mathematics Library, I saw that the things I was learning in algebra could be used to illuminate my growing interests in logic. </p>
<p>More information about Rasiowa can be found at the <a href="http://www-groups.dcs.st-andrews.ac.uk/~history/Mathematicians/Rasiowa.html">St. Andrews’ History of Mathematics Entry</a> on her. </p>
<h3>Ruth Barcan Marcus (1921-)</h3>
<p><img class="logician" src="http://consequently.org/images/logicians/Marcus.jpg" alt="[Image of Marcus]" />Ruth Barcan Marcus is another <em>intensionalist</em> like Prior. She was a proponent of modal logic who in a series of papers from 1946, defended the coherence of quantified modal logics against criticism, and helped ensure that modal logic gained a hearing, but eventually, became a part of the <em>lingua franca</em> of many working philosophers. This was an amazing feat, since her opponents in this included none other than the eminent W. V. O. Quine. Quine was an ardent and trenchant critic of intensional logic, but Ruth Barcan (later Ruth Barcan Marcus) was central in ensuring that philosophical interest in modality did not wither under Quinean criticism.
Ruth Barcan Marcus has lent her name to what is now called the <em>Barcan Formula</em>. She showed that on a plausible conception of how <em>possibility</em> worked, the following thesis turns out to be true: </p>
<blockquote>
<p>If it is <em>possible</em> that something has property <em>F</em>, then there is something such that <em>it</em> possibly has poperty <em>F</em>. </p>
</blockquote>
<p>Now, this might be a problem. After all, if we think it is <em>possible</em> that there be an object with atomic number 150, does it follow that we should think that there <em>is</em> some stuff such that it <em>could be</em> matter with atomic number 150? It’s kind-of odd to think that this must be so, but on a straightforward understanding of how modality and possibility works (that every “world” has the same “domain”: more on this later) this is how things turn out. </p>
<p>The <a href="http://plato.stanford.edu/entries/actualism/index.html">debates arising out of the combination of modality and quantification</a> are by no means over. Ruth Barcan Marcus’ sharp analysis has focussed the discussion of these topics for decades. </p>
<p>More information about Marcus can be found at her <a href="href="http://www.yale.edu/philos/people/marcus_ruth.html">web page</a>. For a good collection of Prof. Marcus’ work on modal logic, her collection <em><a href="http://www.amazon.com/Modalities-Philosophical-Ruth-Barcan-Marcus/dp/0195096576/consequentlyorg">Modalities: Philosphical Essays</a></em> is the place to start.</p>
<h3>Saul Kripke (1940-)</h3>
<p><img class="logician" src="http://consequently.org/images/logicians/Kripke.jpg" alt="[Image of Kripke]" />Saul Kripke was a precocious teenager when his work revolutionised intensional logic. For many years people had known that the logic of <em>possibly</em> and <em>necessarily</em> had a coherence all of its own, and many people had strived to give it a plausible and satisfying formal <em>semantics</em>. This was to change in the work of a teenaged Kripke, published in 1959 (“A completeness theorem in modal logic”, published in the <em>Journal of Symbolic Logic</em>, pages 1 to 15 of volume 24). In this paper, Kripke exploited the well-worn notion of a possible world, and introduced the notion of “relative possibility” as a relationship between “possible worlds”. Then we could say that a formula “necessarily <em>A</em>” is true at a world if and only if <em>A</em> is true at all worlds which are possible relative to the original world, and “possibly <em>A</em>” is true at a world if and only if <em>A</em> is true at some worlds which are possible relative to the original world. </p>
<p>The notion of possible worlds is not original with Kripke. Neither, in fact, is the use of something like a relative possibility (or “accessibility”) relation. However, putting these things together in a neat bundle, and showing how a number of studied modal systems can be understood in this light, <em>was</em> new, and this generated a whole new field of study: the possible worlds semantics for modal and other intensional logics. </p>
<p>Kripke went on to work in many different areas in philosophy, including some influential <a href="http://www.amazon.com/exec/obidos/ASIN/0674954017/consequentlyorg">work on Wittegenstein</a> and other areas of metaphysics and the philosophy of language. His mark on logic, however, was already made in that paper written as a teenager. </p>
<p>More information about Kripke’s work in <em>philosophy</em> can be found at the <a href="http://www.xrefer.com/entry/552540">Oxford Companion to Philosophy</a> on him. </p>
<h3>David Lewis (1941-2001)</h3>
<p><img class="logician" src="http://consequently.org/images/logicians/Lewis.jpg" alt="[Image of Lewis]" />David Lewis is famous not only for his great impact on analytic philosophy (perhaps this impact is felt most keenly in Australia, a country he loved and visited regularly) but also on the reaction that his philosophical views provoked. Lewis’ <em>modal realism</em>, the view that other possible worlds are just as real, and just as real in exactly the same way as this world we live in, famously and regularly provokes an <em>incredulous stare</em> from people when they hear that he believes it quite literally. </p>
<p>Lewis is a good example of a philosopher whose work is the consequence of the work of others. This is not to deny his creative output or originality in any way: it is a creative work to spell out the consequences of a view, and no body of work in this area is richer or more well developed than Lewis’. David Lewis’ view, I think, can be seen as what you get when you cross Quine’s ontological views (his extensionalism) with the intensionalism you find in Kripke’s and others’ work on modal logic. Lewis acknowledges that modal notions (possibility and necessity and the like) are important, meaningful, and to be found in any theory we take seriously. From Quine, he takes the ontological commitment of a theory to be read off what the theory <em>quantifies over</em> (Quine’s dictum is “<a href="http://www.jcu.edu/philosophy/gensler/ap/quine-00.htm">to be is to be the value of a variable</a>”.) Modality is important and it makes sense. Our way of understanding modality is to quantify over possible worlds in semantics in the tradition of Kripke. Voila: modal realism. </p>
<p>Lewis’ work on this topic, especially in the book <a href="http://www.amazon.com/exec/obidos/ASIN/0631224262/consequentlyorg">On the Plurality of Worlds</a> is a compendium of what follows from taking this metaphysical picture seriously, and the kinds of philosophical applications the notions of possible worlds might have. </p>
<p>More information about Lewis can be found at the <a href="http://www.xrefer.com/entry/552612">Oxford Companion to Philosophy</a>. </p>
<h3>Jon Barwise (1942-2000)</h3>
<p><img class="logician" src="http://consequently.org/images/logicians/Barwise.jpg" alt="[Image of Barwise]" />Jon Barwise was a <em>renaissance logician</em>. He didn’t know <em>everything</em> but his contributions ranged so widely that he approximated omniscience quite well. His work <a href="http://www-vil.cs.indiana.edu/kjbpubls.html">ranges from</a> infinitary logic (an extension of Frege-style predicate logic to deal with infinitely long sentences, and infinitary quantifiers), the model theory of first-order logic (continuing on from Tarski’s work), generalsed quantifiers (quantifiers other than “for all” and “for some”), admissible sets and generalised recursion theory (the connections between sets and computation), situation semantics and the philosophy of language (using <em>situations</em>, restricted parts of the world as bearers of information, rather than just entire possible worlds), information theory (an account of how information flows and is transmitted), and the logic of <em>diagrams</em> (examining visual representation and inference, as well as linguistic representation).</p>
<p>Barwise’s work, in all of 35 years, has covered a <em>huge</em> range of disciplines, and it gives you some idea of the breadth of work available in contemporary logic. Barwise’s approach of regularly moving into new fields, to keep fresh and active, is a helpful antidote in the current age of increasing specialisation and narrowing. If work like this is possible at the end of the 20th Century, it will be our job to see what might be done in the 21st.</p>
<p>More information about Barwise can be found at the <a href="http://www-vil.cs.indiana.edu/barwise.html">Barwise Memorial Pages</a> at Indiana.</p>
]]>Modelling Truthmaking
http://consequently.org/writing/modelling/
Thu, 03 Jul 2003 00:00:00 UTChttp://consequently.org/writing/modelling/<![CDATA[<p>Published in a special issue of <em>Logique et Analyse</em>, on Truthmakers, edited by <a href="http://www.une.edu.au/~arts/Philosop/pforrest.htm">Peter Forrest</a> and <a href="http://www.une.edu.au/~arts/Philosop/dkhlentzos.htm">Drew Khlentzos</a>. This expands on my paper “Truthmakers, Entailment and Necessity” by showing that the theses on truthmaking given in that paper are mutually consistent. It does this by providing a model in which each thesis is true. This model is an independently motivated model of a weak quantified relevant logic with an existence predicate.</p>
]]>Logic
http://consequently.org/writing/logic_chapter/
Mon, 03 Mar 2003 00:00:00 UTChttp://consequently.org/writing/logic_chapter/<![CDATA[<p>An introduction to the formal and philosophical logic, for a general introductory handbook to philosophy. I introduce the concepts of deductive and inductive validity, formal languages, proofs, models, soundness and completeness, and many other things besides.</p>
]]>Just what <em>is</em> Full-Blooded Platonism?
http://consequently.org/writing/whatisfbp/
Mon, 03 Mar 2003 00:00:00 UTChttp://consequently.org/writing/whatisfbp/<![CDATA[
<h2 id="mark-balaguer-has-in-em-a-href-http-www-amazon-com-exec-obidos-asin-0195143981-ref-nosim-consequentlyorg-platonism-and-anti-platonism-in-mathematics-a-em-given-us-an-intriguing-new-brand-of-platonism-which-he-calls-plenitudinous-platonism-or-more-colourfully-em-full-blooded-platonism-em-in-this-paper-i-argue-that-none-of-balaguer-rsquo-s-attempts-to-characterise-full-blooded-platonism-succeed-they-are-either-too-strong-with-untoward-consequences-we-all-reject-or-too-weak-not-providing-a-distinctive-brand-of-platonism-strong-enough-to-do-the-work-balaguer-requires-of-it">Mark Balaguer has, in <em><a href="http://www.amazon.com/exec/obidos/ASIN/0195143981/ref=nosim/consequentlyorg">Platonism and Anti-Platonism in Mathematics</a></em>, given us an intriguing new brand of platonism, which he calls, plenitudinous platonism, or more colourfully, <em>full-blooded platonism.</em> In this paper, I argue that none of Balaguer’s attempts to characterise full-blooded platonism succeed. They are either too strong, with untoward consequences we all reject, or too weak, not providing a distinctive brand of platonism strong enough to do the work Balaguer requires of it.</h2>
<p>EXCERPT:
“Just What is Full-Blooded Platonism?”</p>
]]>Relevance Logic
http://consequently.org/writing/rle/
Sun, 03 Mar 2002 00:00:00 UTChttp://consequently.org/writing/rle/<![CDATA[<p>A revision of the <em>Handbook of Philosophical Logic</em> essay on relevant logics, updating it to include work on display logic, relevant predication, Urquhart’s undecidability and complexity results, and connections with other substructural logics.</p>
]]>Paraconsistency Everywhere
http://consequently.org/writing/pev/
Sun, 03 Mar 2002 00:00:00 UTChttp://consequently.org/writing/pev/<![CDATA[<p>Paraconsistent logics are, by definition, <em>inconsistency
tolerant</em>: In a paraconsistent logic, inconsistencies need not
entail everything. However, there is more than one way a body
of information can be inconsistent. In this paper I distinguish
contradictions from other inconsistencies, and I show that
several different logics are, in an important sense, “paraconsistent”
in virtue of being <em>inconsistency tolerant</em> without thereby
being <em>contradiction tolerant</em>. For example, even though no
inconsistencies are tolerated by intuitionistic <em>propositional</em>
logic, some inconsistencies are tolerated by intuitionistic
<em>predicate</em> logic. In this way, intuitionistic predicate logic
is, in a mild sense, paraconsistent. So too are orthologic and quantum
propositional logic and other formal systems. Given this fact, a
widespread view that traditional paraconsistent logics are especially
repugnant because they countenance inconsistencies is undercut. Many well-understood nonclassical logics countenance inconsistencies
as well.</p>
<p>(This paper was published in 2004, despite the apparent date of 2002 in the citation. The tale is told in more detail <a href="http://consequently.org/news/2004/03/24/research_quantification">here</a>.)</p>
]]>Carnap’s Tolerance, Meaning and Logical Pluralism
http://consequently.org/writing/carnap/
Sun, 03 Mar 2002 00:00:00 UTChttp://consequently.org/writing/carnap/<![CDATA[<p>In this paper, I distinguish different kinds of pluralism about logical consequence. In particular, I distinguish the pluralism about logic arising from Carnap’s <em>Principle of Tolerance</em> from a pluralism which maintains that there are different, equally “good” logical consequence relations on the one language. I will argue that this second form of pluralism does more justice to the contemporary state of logical theory and practice than does Carnap’s more moderate pluralism.</p>
]]>'Strenge' Arithmetics
http://consequently.org/writing/strenge/
Sun, 03 Mar 2002 00:00:00 UTChttp://consequently.org/writing/strenge/<![CDATA[<p>We consider the virtues of relevant arithmetic couched in the logic <b>E</b> of <em>entailment</em> as opposed to <b>R</b> of relevant implication. The move to a stronger logic allows us to construct a complete system of <em>true</em> arithmetic, in which whenever an entailment <em>A → B</em> is not true (an example: 0=2 → 0=1 is not provable) then its negation ~(<em>A → B</em>) is true.</p>
]]>Constructive Logic, Truth and Warranted Assertibility
http://consequently.org/writing/conlogtr/
Wed, 03 Oct 2001 00:00:00 UTChttp://consequently.org/writing/conlogtr/<![CDATA[<p>Shapiro and Taschek have argued that simply using intuitionistic logic and its Heyting semantics, one can show that there are no gaps in warranted assertibility. That is, given that a discourse is faithfully modelled using Heyting”s semantics for the logical constants, that if a statement <em>S</em> is not warrantedly assertible, then its negation <em>~S</em> is. Tennant has argued for this conclusion on similar grounds. I show that these arguments fail, albeit in illuminating ways. I will show that an appeal to constructive logic does not commit one to this strong epistemological thesis, but that appeals to semantics of intuitionistic logic nonetheless <em>do</em> give us certain conclusions about the connections between warranted assertibility and truth.</p>
]]>Defending Logical Pluralism
http://consequently.org/writing/defplur/
Tue, 03 Jul 2001 00:00:00 UTChttp://consequently.org/writing/defplur/<![CDATA[<p>A defence of logical pluralism against a number of objections, primarily from Graham Priest in his article “Logic: One or Many” in the same volume.</p>
]]>Logical Pluralism
http://consequently.org/writing/logical_pluralism/
Wed, 20 Dec 2000 00:00:00 UTChttp://consequently.org/writing/logical_pluralism/<![CDATA[<p>This is our article on <em>logical pluralism</em>. We argue that the notion of logical consequence doesn’t pin down <em>one</em> deductive consequence relation, but rather, there are many of them. In particular, we argue that broadly classical, intuitionistic and relevant accounts of deductive logic are genuine logical consequence relations. We should not search for <em>One True Logic</em>, since there are <em>Many</em>.</p>
<p>A bigger version of the argument (with much more detail) is found in our <em><a href="http://consequently.org/writing/pluralism">book</a></em> of the same name.</p>
]]>Defining Double Negation Elimination
http://consequently.org/writing/defdneg/
Tue, 03 Oct 2000 00:00:00 UTChttp://consequently.org/writing/defdneg/<![CDATA[<p>In his paper “Generalised Ortho Negation” J. Michael Dunn mentions a claim of mine to the effect that there is no condition on `perp frames’ equivalent to the holding of <em>double negation elimination</em> (from ~~A to infer A). That claim of mine was wrong. In this paper I correct my error and analyse the behaviour of conditions on frames for negations which verify a number of different theses. (<a href="http://www.vuw.ac.nz/phil/ed.html">Ed Mares</a> has pointed out that there’s some overlap between this paper and his earlier “A Star-Free Semantics for R” (JSL 1995), which I’d read long before writing this one. The particular modelling condition for DNE is still original to me, however.)</p>
]]>Substructural Logics
http://consequently.org/writing/slintro/
Fri, 03 Mar 2000 00:00:00 UTChttp://consequently.org/writing/slintro/<![CDATA[<p><i>Substructural logics</i> are non-classical logics <i>weaker</i> than classical logic, notable for the absence of <i>structural rules</i> present in classical logic. These logics are motivated by considerations from philosophy (relevant logics), linguistics (the Lambek calculus) and computing (linear logic). In addition, techniques from substructural logics are useful in the study of traditional logics such as classical and intuitionistic logic. This article provides a brief overview of the field of substructural logic.</p>
]]>An Introduction to Substructural Logics
http://consequently.org/writing/isl/
Sat, 01 Jan 2000 00:00:00 UTChttp://consequently.org/writing/isl/<![CDATA[<p>This book is, as the title says, an introduction to substructural logics. Think of it as a book which tries to do for substructural logics what Hughes and Cresswell’s <em>New Introduction</em> did for modal logics. This book was published by <a href="http://www.routledge.com">Routledge</a> in January 2000.</p>
<p>It’s available at <a href="http://www.amazon.com/dp/041521534X/consequentlyorg">Amazon</a> and many other bookstores.</p>
]]>Negation in Relevant Logics: How I stopped worrying and learned to love the Routley Star
http://consequently.org/writing/negrl/
Wed, 03 Mar 1999 00:00:00 UTChttp://consequently.org/writing/negrl/<![CDATA[<p>Negation raises three thorny problems for anyone seeking to interpret relevant logics. The frame semantics for negation in relevant logics involves a point shift operator *. Problem number one is the interpretation of this operator. Relevant logics commonly interpreted take the inference from <em>A</em> and ~<em>A</em>v<em>B</em> to <em>B</em> to be invalid, because the corresponding relevant conditional <em>A</em>&(~<em>A</em>v<em>B</em>)→<em>B</em> is not a theorem. Yet we often make the inference from <em>A</em> and ~<em>A</em>v<em>B</em> to <em>B</em>, and we seem to be reasoning validly when we do so. Problem number two is explaining what is really going on here. Finally, we can add an operation which Meyer has called <em>Boolean negation</em> to our logic, which is evaluated in the traditional way: <em>x</em> makes <em>A</em> true if and only if <em>x</em> doesn’t make <em>A</em> true. Problem number three involves deciding which is the real negation. How can we decide between orthodox negation and the new, Boolean negation. In this paper, I present a new interpretation of the frame semantics for relevant logics which will allow us to give principled answers to each of these questions.</p>
]]>Displaying and Deciding Substructural Logics 1: Logics with Contraposition
http://consequently.org/writing/display/
Tue, 03 Nov 1998 00:00:00 UTChttp://consequently.org/writing/display/<![CDATA[<p>Many logics in the relevant family can be given a proof theory in the style of Belnap’s display logic. However, as originally given, the proof theory is essentially <em>more expressive</em> than the logics they seek to model. In this paper, we consider a modified proof theory which more closely models relevant logics. In addition, we use this proof theory to show decidability for a large range of substructural logics.</p>
]]>Ways Things Can't Be
http://consequently.org/writing/cantbe/
Tue, 03 Mar 1998 00:00:00 UTChttp://consequently.org/writing/cantbe/<![CDATA[<p>I show that the believer in possible worlds can have <em>impossible worlds</em> for free, as classes of possible worlds. These do exactly the job of ways that things <em>cannot</em> be, and they model the simple paraconsistent logic LP. This motivates a semantics for paraconsistent logic that even a classical logician can love.</p>
]]>Logical Laws
http://consequently.org/writing/logiclaws/
Tue, 03 Mar 1998 00:00:00 UTChttp://consequently.org/writing/logiclaws/<![CDATA[<p>This is an introductory essay on the notion of a “Logical Law.” In it, I show that there are three important different questions one can ask about logical laws. Firstly, what it <em>means</em> to be a logical law. Secondly, what <em>makes</em> something a logical law, and thirdly, what <em>are</em> the logical laws. Each of these questions are answered differently by different people. I sketch the important differences in views, and point the way ahead for logical research.</p>
]]>Linear Arithmetic Desecsed
http://consequently.org/writing/desecsed/
Tue, 03 Mar 1998 00:00:00 UTChttp://consequently.org/writing/desecsed/<![CDATA[<p>In classical and intuitionistic arithmetics, any formula implies a true equation, and a false equation implies anything. In weaker logics fewer implications hold. In this paper we rehearse known results about the relevant arithmetic R#, and we show that in linear arithmetic LL# by contrast false equations never imply true ones. As a result, linear arithmetic is <em>desecsed</em>. A formula <em>A</em> which entails 0=0 is a <em>secondary equation</em>; one entailed by 0≠0 is a <em>secondary unequation</em>. A system of formal arithmetic is <em>secsed</em> if every extensional formula is either a secondary equation or a secondary unequation. We are indebted to the program <tt>MaGIC</tt> for the simple countermodel <b>SZ7</b>, on which 0=1 is not a secondary formula. This is a small but significant success for automated reasoning.</p>
]]>Extending Intuitionistic Logic with Subtraction
http://consequently.org/writing/extendingj/
Thu, 03 Apr 1997 00:00:00 UTChttp://consequently.org/writing/extendingj/<![CDATA[<p>Ideas on the extension of intuitionistic propositional and predicate logic with a ‘subtraction’ connective, Galois connected with disjunction, dual to the implication connective, Galois connected with conjunction. Presented to an audience at Victoria University of Wellington, July 1997. I like this material, but it does not contain any ideas not accessible elsewhere, so it won’t be published anywhere other than here.</p>
]]>Paraconsistent Logics!
http://consequently.org/writing/plog/
Mon, 03 Mar 1997 00:00:00 UTChttp://consequently.org/writing/plog/<![CDATA[<p>I respond to an interesting argument of Hartley Slater to the effect that there is no such thing as paraconsistent logic. Slater argues that since paraconsistent logics involve interpreting a sentence and its negation as both true at points in a model structure, it is not really <em>negation</em> that is being modelled, since negation is meant to be a contradictory forming operator. I sketch how different paraconsistentists can respond to his argument, and I then defend my own response, that although contradictions are indeed never true (and <em>cannot</em> be true) it does not follow that a semantics ought not evaluate them as true in certain models.</p>
]]>Combining Possibilities and Negations
http://consequently.org/writing/combipn/
Mon, 03 Mar 1997 00:00:00 UTChttp://consequently.org/writing/combipn/<![CDATA[<p>Combining non-classical (or ‘<em>sub</em>-classical’) logics is not easy, but it is very interesting. In this paper, we combine nonclassical logics of negation and possibility (in the presence of conjunction and disjunction), and then we combine the resulting systems with intuitionistic logic. We will find that some of Marcus Kracht’s results on the undecidability of classical modal logics generalise to a non-classical setting. We will also see conditions under which intuitionistic logic can be combined with a non-intuitionistic negation without corrupting the intuitionistic fragment of the logic.</p>
]]>Display Logic and Gaggle Theory
http://consequently.org/writing/dggl/
Tue, 05 Mar 1996 00:00:00 UTChttp://consequently.org/writing/dggl/<![CDATA[<p>This paper is a revised version of a talk given at the <em>Logic and Logical Philosophy</em> conference in Poland in September 1995. In it, I sketch the connections between Nuel Belnap’s <em>Display Logic</em> and J. Michael Dunn’s <em>Gaggle Theory</em>.</p>
]]>Truthmakers, Entailment and Necessity
http://consequently.org/writing/ten/
Sun, 03 Mar 1996 00:00:00 UTChttp://consequently.org/writing/ten/<![CDATA[<p>A truthmaker for a proposition <em>p</em> is an object such that necessarily, if it exists, then <em>p</em> is true. In this paper, I show that the truthmaker thesis (that every truth has a truthmaker) and the disjunction thesis (that a truthmaker for a disjunction must be a truthmaker for one of the disjuncts) are jointly incompatible with the view that the if in the truthmaking clause is a merely material conditional. I then defend the disjunction thesis, and go on to argue that a relevant conditional will serve well in place of the material conditional in defining what it is to be a truthmaker. Conversely, I argue that a semantics involving truthmakers could shed some light on the interpretation of relevant implication.</p>
]]>Realistic Belief Revision
http://consequently.org/writing/rbr/
Sun, 08 Oct 1995 00:00:00 UTChttp://consequently.org/writing/rbr/<![CDATA[<p>In this paper we consider the implications for belief revision of weakening the logic under which belief sets are taken to be closed. A widely held view is that the usual belief revision functions are highly classical, especially in being driven by consistency. We show that, on the contrary, the standard representation theorems still hold for paraconsistent belief revision. Then we give conditions under which consistency is preserved by revisions, and we show that this modelling allows for the <em>gradual</em> revision of inconsistency.</p>
]]>Arithmetic and Truth in Łukasiewicz's Infinitely Valued Logic
http://consequently.org/writing/arithluk/
Tue, 03 Oct 1995 00:00:00 UTChttp://consequently.org/writing/arithluk/<![CDATA[<p>Peano arithmetic formulated in Łukasiewicz’s infinitely valued logic collapses into classical Peano arithmetic. However, not all additions to the language need also be classical. The way is open for the addition of a real truth predicate satisfying the <em>T</em>-scheme into the language. However, such an addition is not pleasing. The resulting theory is omega-inconsistent. This paper consists of the proofs and interpretations of these two results.</p>
]]>Modalities in Substructural Logics
http://consequently.org/writing/modalitiessl/
Mon, 03 Apr 1995 00:00:00 UTChttp://consequently.org/writing/modalitiessl/<![CDATA[<p>This paper generalises Girard’s results which embed intuitionistic logic into linear logic by showing how arbitrary substructural logics can be embedded into weaker substructural logics, using a single modality which ‘encodes’ the new structural rules.</p>
]]>Nietzsche, Insight and Immorality
http://consequently.org/writing/nggl/
Fri, 03 Mar 1995 00:00:00 UTChttp://consequently.org/writing/nggl/<![CDATA[<p>I introduce Nietzsche’s critique of religious belief, for an audience of thinking Christians. I show that his criticism cannot and ought not be simply shrugged off, but rather, it can form the basis of a useful self-critique for the religious believer. I also argue that any response to a Nietzschean critique of religious belief and practice must itself take the form of an embodied believing life, rather than a merely theoretical response.</p>
]]>Information Flow and Relevant Logic
http://consequently.org/writing/infflow/
Fri, 03 Mar 1995 00:00:00 UTChttp://consequently.org/writing/infflow/<![CDATA[<p>John Perry, one of the two founders of the field of situation semantics, indicated in an interview in 1986 that there is some kind of connection between relevant logic and situation semantics.</p>
<blockquote>
<p>I do know that a lot of ideas that seemed off the wall when I first encountered them years ago now seem pretty sensible. One example that our commentators don’t mention is relevance logic; there are a lot of themes in that literature that bear on the themes we mention.</p>
</blockquote>
<p>In 1992, in <em>Entailment</em> volume 2, Nuel Belnap and J. Michael Dunn hinted at similar ideas. Referring to situation semantics, they wrote</p>
<blockquote>
<p>… we do not mean to claim too much here. The Barwise-Perry semantics is clearly independent and its application to natural-language constructions is rich and novel. But we like to think that at least first degree (relevant) entailments have a home there.</p>
</blockquote>
<p>In this paper I show that these hints and gestures are true. And perhaps truer than those that made them thought at the time. In this paper I introduce the semantics of relevant logics, then I will sketch the parts of situation theory relevant to our enterprise. Finally, I bring the two together in what is hopefully, a harmonious way.</p>
]]>Four-Valued Semantics for Relevant Logics (and some of their rivals)
http://consequently.org/writing/fourvalued/
Fri, 03 Mar 1995 00:00:00 UTChttp://consequently.org/writing/fourvalued/<![CDATA[<p>This paper gives an outline of three different approaches to the four-valued semantics for relevant logics (and other non-classical logics in their vicinity). The first approach borrows from the ‘Australian Plan’ semantics, which uses a unary operator ‘*’ for the evaluation of negation. This approach can model anything that the two-valued account can, but at the cost of relying on insights from the Australian Plan. The second approach is natural, well motivated, independent of the Australian Plan, and it provides a semantics for the contraction-free relevant logic <em>RW</em>. Unfortunately, its approach seems to model little else. The third approach seems to capture a wide range of formal systems, but at the time of writing, lacks a completeness proof.</p>
]]>Subintuitionistic Logics
http://consequently.org/writing/subint/
Thu, 03 Mar 1994 00:00:00 UTChttp://consequently.org/writing/subint/<![CDATA[<p>Once the Kripke semantics for normal modal logics were introduced, a whole family of modal logics other than the Lewis systems S1 to S5 were discovered. These logics were obtained by changing the semantics in natural ways. The same can be said of the Kripke-style semantics for relevant logics: a whole range of logics other than the standard systems <b>R</b>, <b>E</b> and <b>T</b> were unearthed once a semantics was given. In a similar way, weakening the structural rules of the Gentzen formulation of classical logic gives rise to other “substructural” logics such as linear logic. This process of “strategic weakening” is becoming popular today, with the discovery of applications of these logics to areas such as linguistics and the theory of computation. This paper examines what the process of weakening does to the Kripke-style semantics of intuitionistic logic, introducing the family of <em>subintuitionistic logics.</em></p>
]]>A Useful Substructural Logic
http://consequently.org/writing/usl/
Thu, 03 Mar 1994 00:00:00 UTChttp://consequently.org/writing/usl/<![CDATA[<p>I defend the extension of the lambek calculus with a distributive extensional conjunction and disjunction. I show how it independently arises in linguistics, information flow and relevant logics, and relation algebra. I give the logic a cut-free Gentzenisation and show that it is decidable.</p>
]]>On Logics without Contraction
http://consequently.org/writing/onlogics/
Wed, 05 Jan 1994 00:00:00 UTChttp://consequently.org/writing/onlogics/<![CDATA[<p>My Ph.D. Thesis, completed in January 1994. I was supervised by Prof. Graham Priest, at the University of Queensland. The thesis is 292 pages of work on logics without the contraction rule.</p>
]]>Simplified Semantics for Relevant Logics (and some of their rivals)
http://consequently.org/writing/simpsem/
Wed, 03 Mar 1993 00:00:00 UTChttp://consequently.org/writing/simpsem/<![CDATA[<p>I show how Priest and Sylvan’s <em>simplified semantics</em> extends from basic relevant logics to a large class of stronger logics. The completeness proof is a little tricky, given the different behaviour of the normal world in the models. This is the first paper from my Ph.D. thesis.</p>
]]>How to be Really Contraction Free
http://consequently.org/writing/reallycf/
Wed, 03 Mar 1993 00:00:00 UTChttp://consequently.org/writing/reallycf/<![CDATA[<p>I show that any finitely valued logic of a simple kind fails to support naïve comprehension, if it has a conditional. I then go on to show how some infinitely valued logics also fail to be <em>robustly contraction free</em>. Then I make a bold conjecture that robust contraction freedom is sufficient to support naïve set theory. This conjecture was later proved to be wrong by two graduate students from Monash, Sam Buchart and Su Rogerson, in some delightful work in 1997, which has since also been published in <em>Studia Logica</em>.</p>
]]>Deviant Logic and the Paradoxes of Self-Reference
http://consequently.org/writing/dlpsr/
Wed, 03 Mar 1993 00:00:00 UTChttp://consequently.org/writing/dlpsr/<![CDATA[<p>I argue that the extant reasons for sticking to classical logic in the face of the paradoxes of self reference are not good reasons. The paradoxes are really difficult and we should use all of the weapons at our disposal.</p>
]]>A Note on Naïve Set Theory in LP
http://consequently.org/writing/nstlp/
Tue, 03 Mar 1992 00:00:00 UTChttp://consequently.org/writing/nstlp/<![CDATA[<p>My first publication. It stems from work I did in my Honours year (1989) with Graham Priest, on paraconsistent logic. I explain a particularly simple yet powerful technique for constructing models of naïve set theory in the paraconsistent logic <strong>LP</strong>. This can be used to show the consistency of the theory, and to construct models invalidating some of the axioms of ZFC.</p>
]]>