The idea that sentences can be closer or further apart in meaning is highly intuitive. Not only that, it is also a pillar of logic, semantic theory and the philosophy of science, and follows from other commitments about similarity. The present paper proposes a novel way of comparing the ‘distance’ between two pairs of propositions. We define ‘\ is closer in meaning to \ than \ is to \’ and thereby give a precise account of comparative propositional similarity facts. Notably, (...) our definition eschews metric assumptions, which are unrealistic in most applications of interest. (shrink)

Number theory abounds with conjectures asserting that every natural number has some arithmetic property. An example is Goldbach’s Conjecture, which states that every even number greater than 2 is the sum of two primes. Enumerative inductive evidence for such conjectures usually consists of small cases. In the absence of supporting reasons, mathematicians mistrust such evidence for arithmetical generalisations, more so than most other forms of non-deductive evidence. Some philosophers have also expressed scepticism about the value of enumerative inductive evidence in (...) arithmetic. But why? Perhaps the best argument is that known instances of an arithmetical conjecture are almost always small: they appear at the start of the natural number sequence. Evidence of this kind consequently suffers from size bias. My essay shows that this sort of scepticism comes in many different flavours, raises some challenges for them all, and explores their respective responses. (shrink)

Complete inferential rigour is achieved by breaking down arguments into steps that are as small as possible: inferential ‘atoms’. For example, a mathematical or philosophical argument may be made completely inferentially rigorous by decomposing its inferential steps into the type of step found in a natural deduction system. It is commonly thought that atomization, paradigmatically in mathematics but also more generally, is pro tanto epistemically valuable. The paper considers some plausible candidates for the epistemic value arising from atomization and finds (...) that none of them fits the bill. In particular, atomized arguments do not ground the correctness of their unatomized counterparts; they are typically not credence-preserving; and they need not reveal the source of inferential disagreement. The moral this suggests is that complete rigour is not even a defeasible epistemic ideal. (shrink)

Ontological monists hold that there is only one way of being, while ontological pluralists hold that there are many; for example, concrete objects like tables and chairs exist in a different way from abstract objects like numbers and sets. Correspondingly, the monist will want the familiar existential quantifier as a primitive logical constant, whereas the pluralist will want distinct ones, such as for abstract and concrete existence. In this paper, we consider how the debate between the monist and pluralist relates (...) to the standard test for logicality. We deploy this test and show that it favors the monist. (shrink)

Frege’s _Basic Law V_ is inconsistent. The reason often given is that it posits the existence of an injection from the larger collection of first-order concepts to the smaller collection of objects. This article explains what is right and what is wrong with this diagnosis.

Propositionalism is the claim that all logical relations can be captured by propositional logic. It is usually regarded as obviously false, because propositional logic seems too weak to capture the rich logical structure of language. I show that there is a clear sense in which propositional logic can match first-order logic, by producing formalizations that are valid iff their first-order counterparts are, and also respect grammatical form as the propositionalist construes it. I explain the real reason propositionalism fails, which is (...) more subtle and more interesting. (shrink)

Thought: A Journal of Philosophy, Volume 10, Issue 3, Page 188-198, September 2021.

The point of formalisation is to model various aspects of natural language. Perhaps the main use to which formalisation is put is to model and explain inferential relations between different sentences. Judged solely by this objective, a formalisation is successful in modelling the inferential network of natural language sentences to the extent that it mirrors this network. There is surprisingly little literature on the criteria of good formalisation, and even less on the question of what it is for a formalisation (...) to mirror the inferential network of a natural language or some fragment of it. This paper takes some exploratory steps towards a quantitative account of the main ingredient in the goodness of a formalisation. We introduce and critically examine a mathematical model of how well a formalisation mirrors natural-language inferential relations. (shrink)

The isomorphism invariance criterion of logical nature has much to commend it. It can be philosophically motivated by the thought that logic is distinctively general or topic neutral. It is capable of precise set-theoretic formulation. And it delivers an extension of ‘logical constant’ which respects the intuitively clear cases. Despite its attractions, the criterion has recently come under attack. Critics such as Feferman, MacFarlane and Bonnay argue that the criterion overgenerates by incorrectly judging mathematical notions as logical. We consider five (...) possible precisifications of the overgeneration argument and find them all unconvincing. (shrink)

We take seriously the idea that paradoxes come in quantifiable degree by offering an exact measure of paradox. We consider three factors relevant to the degree of paradox, which are a function of the degree of belief in each of the individual propositions in the paradox set and the degree of belief in the set as a whole. We illustrate the proposal with a particular measure, and conclude the discussion with some critical remarks.

The overgeneration argument attempts to show that accepting second-order validity as a sound formal counterpart of logical truth has the unacceptable consequence that the Continuum Hypothesis is either a logical truth or a logical falsehood. The argument was presented and vigorously defended in John Etchemendy’s The Concept of Logical Consequence and it has many proponents to this day. Yet it is nothing but a seductive fallacy. I demonstrate this by considering five versions of the argument; as I show, each is (...) either unsound or lacks a troubling conclusion. (shrink)

The Compactness Theorem The compactness theorem is a fundamental theorem for the model theory of classical propositional and first-order logic. As well as having importance in several areas of mathematics, such as algebra and combinatorics, it also helps to pinpoint the strength of these logics, which are the standard ones used in mathematics and arguably … Continue reading Compactness →.

Sometimes, two unfair distributions cancel out in aggregate. Paradoxically, two distributions each of which is fair in isolation may give rise to aggregate unfairness. When assessing the fairness of distributions, it therefore matters whether we assess transactions piecemeal or focus only on the overall result. This piece illustrates these difficulties for two leading theories of fairness before offering a formal proof that no non-trivial theory guarantees aggregativity. This is not intended as a criticism of any particular theory, but as a (...) datum that must be taken into account in constructing a theory of fairness. (shrink)

_Justin Clarke-Doane* * Morality and Mathematics. _ Oxford University Press, 2020. Pp. xx + 208. ISBN: 978-0-19-882366-7 ; 978-0-19-2556806.† †.

A mathematical matrix is usually defined as a two-dimensional array of scalars. And yet, as I explain, matrices are not in fact two-dimensional arrays. So are we to conclude that matrices do not exist? I show how to resolve the puzzle, for both contemporary and older mathematics. The solution generalises to the interpretation of all mathematical discourse. The paper as a whole attempts to reinforce mathematical structuralism by reflecting on how best to interpret mathematics.

The Laws of Belief: Ranking Theory & its Philosophical Applications, by SpohnWolfgang. New York: Oxford University Press, 2012. Pp. xv + 598.

Erratum to: Synthese DOI 10.1007/s11229-015-0705-5In line 3 of footnote 8 on page 4, ‘allow’ should be ‘disallow’.In line 8 of page 5, \ should be \ and \ should be \. Similarly for lines 1, 2, 3, 7, 8, 13 and 14 of page 6.The entry in row 20 column 6 of the table on page 5 should be 1 rather than 0.The entry \ in row 30 column 5 of the table on page 5 should be \.In line 27 (...) of page 13, ‘it’ should be ‘them’.Four lines from the end of section 12.3 on page 20, ‘premisses’ should be ‘premiss sets’, and .. (shrink)