Lewis Carroll’s 1895 paper, 'What the Tortoise Said to Achilles' is widely regarded as a classic text in the philosophy of logic. This special issue of 'The Carrollian' publishes five newly commissioned articles by experts in the field. The original paper is reproduced, together with contemporary correspondence relating to the paper and an extensive bibliography.

Counterfactuals are somewhat tolerant. Had Socrates been at least six feet tall, he need not have been exactly six feet tall. He might have been a little taller—he might have been six one or six two. But while he might have been a little taller, there are limits to how tall he would have been. Had he been at least six feet tall, he would not have been more than a hundred feet tall, for example. Counterfactuals are not just tolerant, (...) then, but bounded. This paper presents a surprising paradox: If counterfactuals are tolerant and bounded, then we can prove a flat contradiction using natural rules of inference. Something has to go then. But what? (shrink)

The problem analysed in this paper is whether we can gain knowledge by using valid inferences, and how we can explain this process from a model-theoretic perspective. According to the paradox of inference (Cohen & Nagel 1936/1998, 173), it is logically impossible for an inference to be both valid and its conclusion to possess novelty with respect to the premises. I argue in this paper that valid inference has an epistemic significance, i.e., it can be used (...) by an agent to enlarge his knowledge, and this significance can be accounted in model-theoretic terms. I will argue first that the paradox is based on an equivocation, namely, it arises because logical containment, i.e., logical implication, is identified with epistemological containment, i.e., the knowledge of the premises entails the knowledge of the conclusion. Second, I will argue that a truth-conditional theory of meaning has the necessary resources to explain the epistemic significance of valid inferences. I will explain this epistemic significance starting from Carnap’s semantic theory of meaning and Tarski’s notion of satisfaction. In this way I will counter (Prawitz 2012b)’s claim that a truth-conditional theory of meaning is not able to account the legitimacy of valid inferences, i.e., their epistemic significance. (shrink)

John McDowell articulated a radical criticism of normative inferentialism against Robert Brandom’s expressivist account of conceptual contents. One of his main concerns consists in vindicating a notion of intentionality that could not be reduced to the deontic relations that are established by discursive practitioners. Noticeably, large part of this discussion is focused on empirical knowledge and observational judgments. McDowell argues that there is no role for inference in the application of observational concepts, except the paradoxical one of justifying the (...) content of an observational judgment in terms of itself. This paper examines the semantical consequences of the analysis of the content of empirical judgments in terms of their inferential role. These, it is suggested, are distinct from the epistemological paradoxes that McDowell charges the inferentialist approach with. (shrink)

This paper takes into account the loops within the anti-suicide arguments - we can clearly understand that their theories were emerging either from their personal beliefs or irrelevant inferences. As discussed later, they overlooked the fact that human beings have ultimate freedom over their death and that is one thing that serves their ego. We see a mere categorical problem on behalf of Camus and his Sisyphus; that how he failed to realise the difference of circumstance and choices. How Kant’s (...) Categorical Imperative is like Plato’s Ideal World that can never exist and how Rousseau failed to recognise individuals as humans. The paper also examine the pro-suicide arguments of Arthur Schopenhauer, Phillip Mainlander, Max Stirner and David Hume. The paper concludes that although suicide is logical, however, there is a need to further categorise the types of suicides in order to create a better compass on this topic of self annihilation. (shrink)

According to the “paradox of knowability”, the moderate thesis that all truths are knowable – ... – implies the seemingly preposterous claim that all truths are actually known – ... –, i.e. that we are omniscient. If Fitch’s argument were successful, it would amount to a knockdown rebuttal of anti-realism by reductio. In the paper I defend the nowadays rather neglected strategy of intuitionistic revisionism. Employing only intuitionistically acceptable rules of inference, the conclusion of the argument is, firstly, (...) not ..., but .... Secondly, even if there were an intuitionistically acceptable proof of ..., i.e. an argument based on a different set of premises, the conclusion would have to be interpreted in accordance with Heyting semantics, and read in this way, the apparently preposterous conclusion would be true on conceptual grounds and acceptable even from a realist point of view. Fitch’s argument, understood as an immanent critique of verificationism, fails because in a debate dealing with the justification of deduction there can be no interpreted formal language on which realists and anti-realists could agree. Thus, the underlying problem is that a satisfactory solution to the “problem of shared content” is not available. I conclude with some remarks on the proposals by J. Salerno and N. Tennant to reconstruct certain arguments in the debate on anti-realism by establishing aporias. (shrink)

In the first of the Insolubles in Chapter 8 of his Sophismata, Buridan contends that the inference Omnis propositio est affirmativa; ergo, nulla propositio est negativa (PS) is valid, even though it appeals to the self-reference in the conclusion to show that what we (following Read 2001) call the classical conception of validity (CCV) fails. This requires that we accept that there are good inferences in which a false conclusion follows from true premises. Partially following Hughes’ proposal (1982), we (...) argue that the First Sophism (PS) involves three different notions of validity. Two of them correspond to the ones described by Hughes (1982, 80–86), who calls them Theory A and Theory B. The third one—that will we call Theory C—is not mentioned by Hughes; instead, it is suggested by Buridan himself in the first three arguments in favor of the validity of PS. We show that: a) from what Buridan says in his Theory C it follows that PS is a formal and material consequence, and hence, a valid one. Then we show that: b) the rejection of CCV and the acceptance of Nulla propositio est negativa (NPN) as a (formal) consequence of Omnis propositio est affirmativa (OPA) leads to a paradox that bears similarities with the one put forward by Pseudo Scotus—which has been studied by Read (2001) and is related to Curry’s paradox. However, there are enough differences to merit considering this paradox separately, especially in relation to the so-called validity paradoxes. Interestingly, our work suggests that Buridan was aware of these problems, which explains why he introduced a new criterion for validity, one that is not based on truth-preservation but on what Spade (1988) calls firmness, and Klima (2016) correspondence. (shrink)

Simple random sampling resolutions of the raven paradox relevantly diverge from scientific practice. We develop a stratified random sampling model, yielding a better fit and apparently rehabilitating simple random sampling as a legitimate idealization. However, neither accommodates a second concern, the objection from potential bias. We develop a third model that crucially invokes causal considerations, yielding a novel resolution that handles both concerns. This approach resembles Inference to the Best Explanation (IBE) and relates the generalization’s confirmation to confirmation (...) of an associated law. We give it an objective Bayesian formalization and discuss the compatibility of Bayesianism and IBE. (shrink)

Is it possible to give a justification of our own practice of deductive inference? The purpose of this paper is to explain what such a justification might consist in and what its purpose could be. On the conception that we are going to pursue, to give a justification for a deductive practice means to explain in terms of an intuitively satisfactory notion of validity why the inferences that conform to the practice coincide with the valid ones. That is, a (...) justification should provide an analysis of the notion of validity and show that the inferences that conform to the practice are just the ones that are valid. Moreover, a complete justification should also explain the purpose, or point, of our inferential practice. We are first going to discuss the objection that any justification of our deductive practice must use deduction and therefore be circular. Then we will consider a particular model of justificatory explanation, building on Georg Kreisel’s concept of informal rigour. Finally, in the main part of the paper, we will discuss three ideas for defining the notion of validity: (i) the classical conception according to which the notion of (bivalent) truth is taken as basic and validity is defined in terms of the preservation of truth; (ii) the constructivist idea of starting instead with the notion of (a canonical) proof (or verification) and define validity in terms of this notion; (iii) the idea of taking the notions of rational acceptance and rejection as given and define an argument to be valid just in case it is irrational to simultaneously accept its premises and reject its conclusion (or conclusions, if we allow for multiple conclusions). Building on work by Dana Scott, we show that the last conception may be viewed as being, in a certain sense, equivalent to the first one. Finally, we discuss the so-called paradox of inference and the informativeness of deductive arguments. (shrink)

In this paper, we axiomatize the deontic logic in Fusco 2015, which uses a Stalnaker-inspired account of diagonal acceptance and a two-dimensional account of disjunction to treat Ross’s Paradox and the Puzzle of Free Choice Permission. On this account, disjunction-involving validities are a priori rather than necessary. We show how to axiomatize two-dimensional disjunction so that the introduction/elimination rules for boolean disjunction can be viewed as one-dimensional projections of more general two-dimensional rules. These completeness results help make explicit the (...) restrictions Fusco’s account must place on free-choice inferences. They are also of independent interest, as they raise difficult questions about how to ‘lift’ a Kripke frame for a one- dimensional modal logic into two dimensions. (shrink)

A variation of Fitch’s paradox is given, where no special rules of inference are assumed, only axioms. These axioms follow from the familiar assumptions which involve rules of inference. We show (by constructing a model) that by allowing that possibly the knower doesn’t know his own soundness (while still requiring he be sound), Fitch’s paradox is avoided. Provided one is willing to admit that sound knowers may be ignorant of their own soundness, this might offer a (...) way out of the paradox. (shrink)

I argue that the accounts of inference recently presented (in this journal) by Paul Boghossian, John Broome, and Crispin Wright are unsatisfactory. I proceed in two steps: First, in Sects. 1 and 2, I argue that we should not accept what Boghossian calls the “Taking Condition on inference” as a condition of adequacy for accounts of inference. I present a different condition of adequacy and argue that it is superior to the one offered by Boghossian. More precisely, (...) I point out that there is an analog of Moore’s Paradox for inference; and I suggest that explaining this phenomenon is a condition of adequacy for accounts of inference. Boghossian’s Taking Condition derives its plausibility from the fact that it apparently explains the analog of Moore’s Paradox. Second, in Sect. 3, I show that neither Boghossian’s, nor Broome’s, nor Wright’s account of inference meets my condition of adequacy. I distinguish two kinds of mistake one is likely to make if one does not focus on my condition of adequacy; and I argue that all three—Boghossian, Broome, and Wright—make at least one of these mistakes. (shrink)

Philosophy and Phenomenological Research, EarlyView.

This paper provides new tools for philosophical argument analysis and fresh empirical foundations for ‘critical’ ordinary language philosophy. Language comprehension routinely involves stereotypical inferences with contextual defeaters. J.L. Austin’s Sense and Sensibilia first mooted the idea that contextually inappropriate stereotypical inferences from verbal case-descriptions drive some philosophical paradoxes; these engender philosophical problems that can be resolved by exposing the underlying fallacies. We build on psycholinguistic research on salience effects to explain when and why even perfectly competent speakers cannot help making (...) stereotypical inferences which are contextually inappropriate. We analyse a classical paradox about perception, suggest it relies on contextually inappropriate stereotypical inferences from appearance-verbs, and show that the conditions we identified as leading to contextually inappropriate stereotypical inferences are met in formulations of the paradox. Three experiments use a forced-choice plausibility-ranking task to document the predicted inappropriate inferences, in English, German, and Japanese. The cross-linguistic study allows us to assess the wider relevance of the proposed analysis. Our findings open up new perspectives for ‘evidential’ experimental philosophy. (shrink)

Some arguments include imperative clauses. For example: ‘Buy me a drink; you can’t buy me that drink unless you go to the bar; so, go to the bar!’ How should we build a logic that predicts which of these arguments are good? Because imperatives aren’t truth apt and so don’t stand in relations of truth preservation, this technical question gives rise to a foundational one: What would be the subject matter of this logic? I argue that declaratives are used to (...) produce beliefs, imperatives are used to produce intentions, and beliefs and intentions are subject to rational requirements. An argument will strike us as valid when anyone whose mental state satisfies the premises is rationally required to satisfy the conclusion. For example, the above argument reflects the principle that it is irrational not to intend what one takes to be the necessary means to one’s intended ends. I argue that all intuitively good patterns of imperative inference can be explained using off-the-shelf formulations of our rational requirements. I then develop a formal-semantic theory embodying this view that predicts a range of data, including free-choice effects and Ross’s paradox. The resulting theory shows one way that our aspirations to rational agency can be discerned in the patterns of our speech, and is a case study in how the philosophy of language and the philosophy of action can be mutually illuminating. (shrink)

The universality assumption (“U”) that quantum wave states only evolve by linear or unitary dynamics has led to a variety of paradoxes in the foundations of physics. U is not directly supported by empirical evidence but is rather an inference from data obtained from microscopic systems. The inference of U conflicts with empirical observations of macroscopic systems, giving rise to the century-old measurement problem and subjecting the inference of U to a higher standard of proof, the burden (...) of which lies with its proponents. This burden remains unmet because the intentional choice by scientists to perform interference experiments that only probe the microscopic realm disqualifies the resulting data from supporting an inference that wave states always evolve linearly in the macroscopic realm. Further, the nature of the physical world creates an asymptotic size limit above which interference experiments, and verification of U in the realm in which it causes the measurement problem, seem impossible for all practical purposes if nevertheless possible in principle. This apparent natural limit serves as evidence against an inference of U, providing a further hurdle to the proponent’s currently unmet burden of proof. The measurement problem should never have arisen because the inference of U is entirely unfounded, logically and empirically. (shrink)

This article tackles an epistemic puzzle formulated by R. Smullyan that we call the ‘Surprise Deception Paradox'. On the morning of April 1st 1925, his brother announced that he would deceive him during the day, but apparently nothing happened. Since R. Smullyan waited all day to be deceived by some action, he was actually deceived, but by the lack of an action, that is to say by omission. Afterwards, Smullyan felt immediately puzzled: because he expected to be deceived, he (...) was not deceived; but since he was not deceived the way he expected, he was actually deceived. We use dynamic belief revision logic to look more clearly into this puzzle. We argue that Smullyan's reasoning is not a self-referential paradox but shares common features with the more famous Surprise Examination Paradox. In Smullyan's riddle, we show that a misleading default mechanism makes R. Smullyan surprised by the deception he has been preyed to. We also use this solution to discuss whether such defaults, compared to other forms of truth-telling deception, may qualify as lies or not. (shrink)

I have read many recent discussions of the limits of computation and the universe as computer, hoping to find some comments on the amazing work of polymath physicist and decision theorist David Wolpert but have not found a single citation and so I present this very brief summary. Wolpert proved some stunning impossibility or incompleteness theorems (1992 to 2008-see arxiv.org) on the limits to inference (computation) that are so general they are independent of the device doing the computation, and (...) even independent of the laws of physics, so they apply across computers, physics, and human behavior. They make use of Cantor's diagonalization, the liar paradox and worldlines to provide what may be the ultimate theorem in Turing Machine Theory, and seemingly provide insights into impossibility,incompleteness, the limits of computation,and the universe as computer, in all possible universes and all beings or mechanisms, generating, among other things,a non-quantum mechanical uncertainty principle and a proof of monotheism. (shrink)

Neil Tennant was the first to propose a proof-theoretic criterion for paradoxicality, a framework in which a paradox, formalized through natural deduction, is derived from an unacceptable conclusion that employs a certain form of id est inferences and generates an infinite reduction sequence. Tennant hypothesized that any derivation in natural deduction that formalizes a genuine paradox would meet this criterion, and he argued that while the liar paradox is genuine, Russell's paradox is not. -/- The present (...) paper delves into Tennant's conjecture for genuine paradoxes and suggests that to validate the conjecture, one of two issues must be addressed. The first issue is the need for a philosophical consensus on the identification of a genuine paradox in an informal sense. The second issue is the requirement for a uniform approach to formalize paradoxes in natural deduction. If either of these issues is addressed, the conjecture could be validated, or at the very least, it could hold philosophical importance in delineating the proof-theoretic features of paradoxicality. (shrink)

The paper defends a variant of the material implication approach to the meaning of conditional sentences against some arguments that are considered to be widely subscribed to and/or important in the philosophical, psychological and linguistic literature. These arguments are shown to be wrong, debatable, or to miss their aim if the truth conditions defining material implication are viewed as determining nothing but the denotation of conditional sentences and if the function of conditional sentences in deduction (logic) is focused on rather (...) than in inferencing (reasoning). It is shown that some ‘paradoxes of material implication’ are due to inconsistent premises of deductions introduced by semantic relations between clauses constituting the premises, a fact which does not invalidate the approach. Other ‘paradoxes’ are shown to arise because they are based on uninformative deductions, violating a basic pragmatic principle. In addition, the paper introduces the distinction between the set of possible states of a mental model of the actual world and of alternative worlds. It is argued that material implication determines the denotation of an indicative conditional as a subset of the former set and the denotation of a subjunctive conditional as a subset of the latter set, thus unifying these two types of conditionals. (shrink)

The idea that knowledge can be extended by inference from what is known seems highly plausible. Yet, as shown by familiar preface paradox and lottery-type cases, the possibility of aggregating uncertainty casts doubt on its tenability. We show that these considerations go much further than previously recognized and significantly restrict the kinds of closure ordinary theories of knowledge can endorse. Meeting the challenge of uncertainty aggregation requires either the restriction of knowledge-extending inferences to single premises, or eliminating epistemic (...) uncertainty in known premises. The first strategy, while effective, retains little of the original idea—conclusions even of modus ponens inferences from known premises are not always known. We then look at the second strategy, inspecting the most elaborate and promising attempt to secure the epistemic role of basic inferences, namely Timothy Williamson’s safety theory of knowledge. We argue that while it indeed has the merit of allowing basic inferences such as modus ponens to extend knowledge, Williamson’s theory faces formidable difficulties. These difficulties, moreover, arise from the very feature responsible for its virtue- the infallibilism of knowledge. (shrink)

The Kripke/Wittgenstein paradox and Goodman’s riddle of induction can be construed as problems of multiple redescription, where the relevant sceptical challenge is to provide factual grounds justifying the description we favour. A choice of description or predicate, in turn, is tantamount to the choice of a curve over a set of data, a choice apparently governed by implicitly operating constraints on the relevant space of possibilities. Armed with this analysis of the two paradoxes, several realist solutions of Kripke’s (...) class='Hi'>paradox are examined that appeal to dispositions or other non-occurrent properties. It is found that all neglect crucial epistemological issues: the entities typically appealed to are not observational and must be inferred on the basis of observed entities or events; yet, the relevant sceptical challenge concerns precisely the factual basis on which this inference is made and the constraints operating on it. All disposition ascriptions, the thesis goes on to argue, contain elements of idealization. To ward off the danger of vacuity resulting from the fact that any disposition ascription is true under just the right ideal conditions, dispositional theories need to specify limits on legitimate forms of idealization. This is best done by construing disposition ascriptions as forms of (implicit) curve-fitting, I argue, where the “data” is not necessarily numeric, and the “curve” fitted not necessarily graphic. This brings us full circle: Goodman’s and Kripke’s problems are problems concerning curve-fitting, and the solutions for it appeal to entities the postulation of which is the result of curve-fitting. The way to break the circle must come from a methodology governing the idealizations, or inferences to the best idealization, that are a part of curve-fitting. The thesis closes with an argument for why natural science cannot be expected to be of much help in this domain, given the ubiquity of idealization. (shrink)

The purpose of this note is to present a strong form of the liar paradox. It is strong because the logical resources needed to generate the paradox are weak, in each of two senses. First, few expressive resources required: conjunction, negation, and identity. In particular, this form of the liar does not need to make any use of the conditional. Second, few inferential resources are required. These are: (i) conjunction introduction; (ii) substitution of identicals; and (iii) the (...) class='Hi'>inference: From ¬(p ∧ p), infer ¬ p. It is, interestingly enough, also essential to the argument that the ‘strong’ form of the diagonal lemma be used: the one that delivers a term λ such that we can prove: λ = ¬ T(⌈λ⌉); rather than just a sentence Λ for which we can prove: Λ ≡ ¬T(⌈Λ⌉). The truth-theoretic principles used to generate the paradox are these: ¬(S ∧ T(⌈¬S⌉); and ¬(¬S ∧ ¬T(⌈¬S⌉). These are classically equivalent to the two directions of the T-scheme, but they are intuitively weaker. The lesson I would like to draw is: There can be no consistent solution to the Liar paradox that does not involve abandoning truth-theoretic principles that should be every bit as dear to our hearts as the T-scheme. So we shall have to learn to live with the Liar, one way or another. (shrink)

Hempel’s Converse Consequence Condition (CCC), Entailment Condition (EC), and Special Consequence Condition (SCC) have some prima facie plausibility when taken individually. Hempel, though, shows that they have no plausibility when taken together, for together they entail that E confirms H for any propositions E and H. This is “Hempel’s paradox”. It turns out that Hempel’s argument would fail if one or more of CCC, EC, and SCC were modified in terms of explanation. This opens up the possibility that Hempel’s (...) paradox can be solved by modifying one or more of CCC, EC, and SCC in terms of explanation. I explore this possibility by modifying CCC and SCC in terms of explanation and considering whether CCC and SCC so modified are correct. I also relate that possibility to Inference to the Best Explanation. (shrink)

This paper critically examines currently influential transparency accounts of our knowledge of our own beliefs that say that self-ascriptions of belief typically are arrived at by “looking outward” onto the world. For example, one version of the transparency account says that one self-ascribes beliefs via an inference from a premise to the conclusion that one believes that premise. This rule of inference reliably yields accurate self-ascriptions because you cannot infer a conclusion from a premise without believing the premise, (...) and so you cannot infer from a premise that you believe the premise unless you do believe it. I argue that this procedure cannot be a source of justification, however, because one can be justified in inferring from p that q only if p amounts to strong evidence that q is true. This is incompatible with the transparency account because p often is not very strong evidence that you believe that p. For example, unless you are a weather expert, the fact that it will rain is not very strong evidence that you believe it will rain. After showing how this intuitive problem can be made precise, I conclude with a broader lesson about the nature of inferential justification: that beliefs, when justified, must be underwritten by beliefs, when justified, must be underwritten by evidential relationships between the facts or propositions which those beliefs represent. (shrink)

A deduction is an inference that aims for validity and can be either valid or invalid. An invalid deduction can never be valid, because if an inference is valid in one possible world, it must be valid in all. One possible world where an inference is valid implies that there are no worlds where the inference is invalid. If the only genuine deductions are the valid ones, then our talk about deduction is an indirect way of (...) referring to validity rather than an inference type. There is simply no deduction to speak of—only validity. But then again, it’s clear that validity is an attribute that some inferences possess, while others do not. This is a paradox. -/- . (shrink)

I have read many recent discussions of the limits of computation and the universe as computer, hoping to find some comments on the amazing work of polymath physicist and decision theorist David Wolpert but have not found a single citation and so I present this very brief summary. Wolpert proved some stunning impossibility or incompleteness theorems (1992 to 2008-see arxiv dot org) on the limits to inference (computation) that are so general they are independent of the device doing the (...) computation, and even independent of the laws of physics, so they apply across computers, physics, and human behavior. They make use of Cantor's diagonalization, the liar paradox and worldlines to provide what may be the ultimate theorem in Turing Machine Theory, and seemingly provide insights into impossibility, incompleteness, the limits of computation, and the universe as computer, in all possible universes and all beings or mechanisms, generating, among other things, a non- quantum mechanical uncertainty principle and a proof of monotheism. There are obvious connections to the classic work of Chaitin, Solomonoff, Komolgarov and Wittgenstein and to the notion that no program (and thus no device) can generate a sequence (or device) with greater complexity than it possesses. One might say this body of work implies atheism since there cannot be any entity more complex than the physical universe and from the Wittgensteinian viewpoint, ‘more complex’ is meaningless (has no conditions of satisfaction, i.e., truth-maker or test). Even a ‘God’ (i.e., a ‘device’with limitless time/space and energy) cannot determine whether a given ‘number’ is ‘random’, nor find a certain way to show that a given ‘formula’, ‘theorem’ or ‘sentence’ or ‘device’ (all these being complex language games) is part of a particular ‘system’. -/- Those wishing a comprehensive up to date framework for human behavior from the modern two systems view may consult my book ‘The Logical Structure of Philosophy, Psychology, Mind and Language in Ludwig Wittgenstein and John Searle’ 2nd ed (2019). Those interested in more of my writings may see ‘Talking Monkeys--Philosophy, Psychology, Science, Religion and Politics on a Doomed Planet--Articles and Reviews 2006-2019 2nd ed (2019) and Suicidal Utopian Delusions in the 21st Century 4th ed (2019) . (shrink)

There are three questions associated with Simpson’s paradox (SP): (i) Why is SP paradoxical? (ii) What conditions generate SP? and (iii) How to proceed when confronted with SP? An adequate analysis of the paradox starts by distinguishing these three questions. Then, by developing a formal account of SP, and substantiating it with a counterexample to causal accounts, we argue that there are no causal factors at play in answering questions (i) and (ii). Causality enters only in connection with (...) action. (shrink)

This study asserts that W.V.O. Quine’s eliminative philosophical gaze into mereological composition affects inevitably his interpretations of composition theories of ontology. To investigate Quine’s property monism from the account of modal eliminativism, I applied to his solution for the paradoxes of de re modalities’ . Because of its vital role to figure out how dispositions are encountered by Quine, it was significantly noted that the realm of de re modalities doesn’t include contingent and impossible inferences about things. Therefore, for him, (...) all the intrinsic forces and elements of entities such as powers and causal or teleological dispositions for ontology demand to be seen necessarily as bound variables from a monist perspective. Although his denial of analyticity and the elimination of dispositional field of ontology, S. Mumford criticizes the monist perspective of Quine’s paradoxical approach to superveniences. Because superveniences create problems while determining type-type identities from a monist mereological perspective. It is observed that Quine faces with a reduction again in terms of his dispositional monism despite his critiques to repulse vagueness from the ontology in his well-known article Two Dogmas of Empiricism. -/- . (shrink)

How to say no less, no more about conditional than what is needed? From a logical analysis of necessary and sufficient conditions (Section 1), we argue that a stronger account of conditional can be obtained in two steps: firstly, by reminding its historical roots inside modal logic and set-theory (Section 2); secondly, by revising the meaning of logical values, thereby getting rid of the paradoxes of material implication whilst showing the bivalent roots of conditional as a speech-act based on affirmations (...) and rejections (Section 3). Finally, the two main inference rules for conditional, viz. Modus Ponens and Modus Tollens, are reassessed through a broader definition of logical consequence that encompasses both a normal relation of truth propagation and a weaker relation of falsity non-propagation from premises to conclusion (Section 3). (shrink)

Children acquire complex concepts like DOG earlier than simple concepts like BROWN, even though our best neuroscientific theories suggest that learning the former is harder than learning the latter and, thus, should take more time (Werning 2010). This is the Complex- First Paradox. We present a novel solution to the Complex-First Paradox. Our solution builds on a generalization of Xu and Tenenbaum’s (2007) Bayesian model of word learning. By focusing on a rational theory of concept learning, we show (...) that it is easier to infer the meaning of complex concepts than that of simple concepts. (shrink)

I discuss a neglected solution to the skeptical problem introduced by Lewis Carroll’s “What the Tortoise Said to Achilles” (1895) in terms of a self-citational inferential license. I then consider some responses to this solution. The most significant response on behalf of the skeptic utilizes the familiar distinction between two ways of accepting a rule: as action-guiding and as a mere truth. I argue that this is ultimately unsatisfactory and conclude by opting for an alternative conception of rules as representations (...) of behavior deployed for various purposes, some theoretical and others practical. This alternative conception does not allow the skeptical problem to get off the ground. (shrink)

Scholars interested in the characterology presupposed by constitutional government have occasionally turned to Plato’s Laws, one of the earliest and most penetrating treatments of the subject. Even so, interpreters have neglected a vital tension that the Laws presents as coeval with lawfulness itself. Through a close reading of the dialogue’s opening passages, I argue that the rule of law for Plato is implicated in a certain paradox: it both prohibits and requires the imitation of god. Law cannot safely originate (...) with human beings; yet human beings must involve themselves nonetheless in laying law down. Trustworthy lawgivers must revere the gods while at the same time emulating them, must somehow make law themselves while regarding that very task as beyond their ken. Although the political psychology of lawfulness would therefore seem incoherent, I conclude by surveying reasons for thinking this inference unwarranted. (shrink)

J’ai lu de nombreuses discussions récentes sur les limites du calcul et de l’univers en tant qu’ordinateur, dans l’espoir de trouver quelques commentaires sur le travail étonnant du physicien polymathe et théoricien de la décision David Wolpert, mais n’ont pas trouvé une seule citation et je présente donc ce résumé très bref. Wolpert s’est avéré quelques théoricaux d’impossibilité ou d’incomplétude renversants (1992 à 2008-voir arxiv dot org) sur les limites de l’inférence (computation) qui sont si généraux qu’ils sont indépendants de (...) l’appareil faisant le calcul, et même indépendamment des lois de la physique, ainsi ils s’appliquent à travers les ordinateurs, la physique, et le comportement humain. Ils utilisent la diagonalisation de Cantor, le paradoxe menteur et les worldlines (lignes du monde) pour fournir ce qui peut être le théorème ultime dans Turing Machine Theory, et apparemment fournir des aperçus de l’impossibilité, l’incomplétude, les limites du calcul, et l’univers comme ordinateur, dans tous les univers possibles et tous les êtres ou mécanismes possibles, générant, entre autres, un principe d’incertitude mécanique non quantique et une preuve de monothéisme. Il existe des connexions évidentes à l’œuvre classique de Chaitin, Solomonoff, Komolgarov et Wittgenstein et à l’idée qu’aucun programme (et donc aucun dispositif) ne peut générer une séquence (ou un dispositif) avec une plus grande complexité qu’il ne possède. On pourrait dire que cet ensemble de travaux implique l’athéisme puisqu’il ne peut y avoir d’entité plus complexe que l’univers physique et du point de vue wittgensteinien, « plus complexe » n’a aucun sens (n’a pas de conditions de satisfaction, c’est-à-dire véridique ou test). Même un « Dieu » (c’est-à-dire un « dispositif » avec un temps/ espace et une énergie illimité) ne peut pas déterminer si un « nombre » donné est « aléatoire», ni trouver un certain moyen de montrer qu’une « formule » donnée, un « théorème » ou une « phrase » ou un « dispositif » (tous ces jeux de langage complexes) fait partie d’un « système » particulier. Ceux qui souhaitent un cadre complet à jour pour le comportement humain de la vue moderne de deux systemes peuvent consulter mon livre 'The Logical Structure of Philosophy, Psychology, Mind and Language in Ludwig Wittgenstein and John Searle' 2nd ed (2019). Ceux qui s’intéressent à plus de mes écrits peuvent voir 'Talking Monkeys --Philosophie, Psychologie, Science, Religion et Politique sur une planète condamnée --Articles et revues 2006-2019 2ème ed (2019) et Suicidal Utopian Delusions in the 21st Century 4th ed (2019) et autres. (shrink)

The generalized conclusion of the Tarski and Gödel proofs: All formal systems of greater expressive power than arithmetic necessarily have undecidable sentences. Is not the immutable truth that Tarski made it out to be it is only based on his starting assumptions. -/- When we reexamine these starting assumptions from the perspective of the philosophy of logic we find that there are alternative ways that formal systems can be defined that make undecidability inexpressible in all of these formal systems.

Science and engineering rely on the accumulation and dissemination of knowledge to make discoveries and create new designs. Discovery-driven genome research rests on knowledge passed on via gene annotations. In response to the deluge of sequencing big data, standard annotation practice employs automated procedures that rely on majority rules. We argue this hinders progress through the generation and propagation of errors, leading investigators into blind alleys. More subtly, this inductive process discourages the discovery of novelty, which remains essential in biological (...) research and reflects the nature of biology itself. Annotation systems, rather than being repositories of facts, should be tools that support multiple modes of inference. By combining deduction, induction and abduction, investigators can generate hypotheses when accurate knowledge is extracted from model databases. A key stance is to depart from ‘the sequence tells the structure tells the function’ fallacy, placing function first. We illustrate our approach with examples of critical or unexpected pathways, using MicroScope to demonstrate how tools can be implemented following the principles we advocate. We end with a challenge to the reader. (shrink)

This study analyses the predictions of the General Theory of Relativity (GTR) against a slightly modified version of the standard central mass solution (Schwarzschild solution). It is applied to central gravity in the solar system, the Pioneer spacecraft anomalies (which GTR fails to predict correctly), and planetary orbit distances and times, etc (where GTR is thought consistent.) -/- The modified gravity equation was motivated by a theory originally called ‘TFP’ (Time Flow Physics, 2004). This is now replaced by the ‘Geometric (...) Model’, 2014 [20], which retains the same theory of gravity. This analysis is offered partially as supporting detail for the claim in [20] that the theory is realistic in the solar system and explains the Pioneer anomalies. The overall conclusion is that the model can claim to explain the Pioneer anomalies, contingent on the analysis being independently verified and duplicated of course. -/- However the interest lies beyond testing this theory. To start with, it gives us a realistic scale on which gravity might vary from the accepted theory, remain consistent with most solar-scale astronomical observations. It is found here that the modified gravity equation would appear consistent with GTR for most phenomena, but it would retard the Pioneer spacecraft by about the observed amount (15 seconds or so at time). Hence it is a possible explanation of this anomaly, which as far as I know remains unexplained now for 20 years. -/- It also shows what many philosophers of science have emphasized: the pivotal role of counterfactual reasoning. By putting forward an exact alternative solution, and working through the full explanation, we discover a surprising ‘counterfactual paradox’: the modified theory slightly weakens GTR gravity – and yet the effect is to slow down the Pioneer trajectory, making it appear as if gravity is stronger than GTR. The inference that “there must be some tiny extra force…” (Musser, 1998 [1]) is wrong: there is a second option: “…or there may be a slightly weaker form of gravity than GTR.” . (shrink)

The theory of lower previsions is designed around the principles of coherence and sure-loss avoidance, thus steers clear of all the updating anomalies highlighted in Gong and Meng's "Judicious Judgment Meets Unsettling Updating: Dilation, Sure Loss, and Simpson's Paradox" except dilation. In fact, the traditional problem with the theory of imprecise probability is that coherent inference is too complicated rather than unsettling. Progress has been made simplifying coherent inference by demoting sets of probabilities from fundamental building blocks (...) to secondary representations that are derived or discarded as needed. (shrink)

It is well known in contemporary Madhyamaka studies that the seventh century Indian philosopher Candrakīrti rejects the foundationalist Abhidharma epistemology. The question that is still open to debate is: Does Candrakīrti offer any alternative Madhyamaka epistemology? One possible way of addressing this question is to find out what Candrakīrti says about the nature of buddha’s epistemic processes. We know that Candrakīrti has made some puzzling remarks on that score. On the one hand, he claims buddha is the pramāṇabhūta-puruṣa (person of (...) epistemic and moral authority), sarvākārajñatājñānaṃ (omniscient, wise), pratyakṣalakṣaṇam (exclusively perceptual in characteristic) [Candrakīrti (MABh VI.214)], and claims that there are clearly four pramāṇas—epistemic warrants—direct perception (pratyakṣa), inference (anumāna), testimony (āgama) and analogy (upamāna) [Candrakīrti (Pp I.3), cf. MacDonald 2015, pp. 287–288]. On the other hand, somewhat paradoxically, Candrakīrti claims that buddhahood is an embodiment of a complete cessation of “mind and mental processes” [Candrakīrti (MABh XI.1, 155a; MAB XI.17d)] Now how are we to make sense of these two seemingly contradictory statements? Do these statements reflect any deeper conflicts within Candrakīrti’s system or is there a coherent way to interpret these statements? The Tibetan Prāsaṅgika interpreters of Candrakīrti’s Madhyamaka largely agree that there is no internal contradiction in Candrakīrti’s system, and agree there is a way to make coherent sense of these statements. Nevertheless, the Tibetans exegetes bring to the table two radically conflicting proposals to approach Candrakīrti’s Mādhyamaka; both claiming to successfully address the apparent tension arising from Candrakīrti’s statements. One proposal is made by Tsongkhapa Losang Dakpa (Tsong kha pa bLo bzang grags pa, 1357–1419), who maintains the tension can be plausibly resolved by demonstrating that Candrakīrti’s unique non-foundationalist epistemological program renders him an epistemological coherentist. In contrast Taktsang Lotsawa Sherap Rinchen (sTag tshang Lo tsā ba Shes rab rin chen, 1405–1477) argues that according to Candrakīrti buddha is a global agnostic, on the ground of the nonexistence of mind and mental processes for those who have attained fully awakening. Taktsang instead proposes the no-mind thesis as a more plausible way to resolve the tension in Candrakīrti’s philosophy, categorically refusing to attribute to buddha any cognitive processes and epistemic warrants. This paper is an analysis of Taktsang’s no-mind thesis—the claim that buddhas utterly lack any knowledge of the world because they do not have epistemic processes and warrants to perceive the world—in what follows a rational reconstruction of his arguments is developed in order to evaluate his thesis. We shall then assess the implications of accepting Taktsang’s no-mind thesis. (shrink)

We show how removing faith-based beliefs in current philosophies of classical and constructive mathematics admits formal, evidence-based, definitions of constructive mathematics; of a constructively well-defined logic of a formal mathematical language; and of a constructively well-defined model of such a language. -/- We argue that, from an evidence-based perspective, classical approaches which follow Hilbert's formal definitions of quantification can be labelled `theistic'; whilst constructive approaches based on Brouwer's philosophy of Intuitionism can be labelled `atheistic'. -/- We then adopt what may (...) be labelled a finitary, evidence-based, `agnostic' perspective and argue that Brouwerian atheism is merely a restricted perspective within the finitary agnostic perspective, whilst Hilbertian theism contradicts the finitary agnostic perspective. -/- We then consider the argument that Tarski's classic definitions permit an intelligence---whether human or mechanistic---to admit finitary, evidence-based, definitions of the satisfaction and truth of the atomic formulas of the first-order Peano Arithmetic PA over the domain N of the natural numbers in two, hitherto unsuspected and essentially different, ways. -/- We show that the two definitions correspond to two distinctly different---not necessarily evidence-based but complementary---assignments of satisfaction and truth to the compound formulas of PA over N. -/- We further show that the PA axioms are true over N, and that the PA rules of inference preserve truth over N, under both the complementary interpretations; and conclude some unsuspected constructive consequences of such complementarity for the foundations of mathematics, logic, philosophy, and the physical sciences. -/- . (shrink)

Although Benjamin Schnieder’s theory of the “ordinary conception” of properties successfully handles paradoxical properties—particularly, the property of non-self-instantiation—it fails to account for ordinary, non-pathological cases. The theory allows the inference of ‘a has the property of being F’ only given F(a) and the prior assertibility of ‘the property of being F can exist’. While this allows us to block an inference to a contradiction, it also blocks all of the non-pathological instances of the inference from ‘a is (...) F’ to ‘a has the property of being F’. It thereby fails both as a theory of the ordinary conception and as a replacement of the ordinary notion, assuming the latter is defective. (shrink)

It is widely accepted that in fallible reasoning potential error necessarily increases with every additional step, whether inferences or premises, because it grows in the same way that the probability of a lengthening conjunction shrinks. As it stands, this is disappointing but, I will argue, not out of keeping with our experience. However, consulting an expert, proof-checking, constructing gap-free proofs, and gathering more evidence for a given conclusion also add more steps, and we think these actions have the potential to (...) improve our reliability or justifiedness. Thus, the received wisdom about the growth of error implies a skepticism about the possibility of improving our reliability and level of justification through effort. Paradoxically, and even more implausibly, taking steps to decrease your potential error necessarily increases it. I will argue that the self-help steps listed here are of a distinctive type, involving composition rather than conjunction. Error grows differently over composition than over conjunction, I argue, and this dissolves the apparent paradox. (shrink)

The impossibility results in judgement aggregation show a clash between fair aggregation procedures and rational collective outcomes. In this paper, we are interested in analysing the notion of rational outcome by proposing a proof-theoretical understanding of collective rationality. In particular, we use the analysis of proofs and inferences provided by linear logic in order to define a fine-grained notion of group reasoning that allows for studying collective rationality with respect to a number of logics. We analyse the well-known paradoxes in (...) judgement aggregation and we pinpoint the reasoning steps that trigger the inconsistencies. Moreover, we extend the map of possibility and impossibility results in judgement aggregation by discussing the case of substructural logics. In particular, we show that there exist fragments of linear logic for which general possibility results can be obtained. (shrink)

The depth-bounded approach seeks to provide realistic models of reasoners. Recognizing that most useful logics are idealizations in that they are either undecidable or likely to be intractable, the approach accounts for how they can be approximated in practice by resource-bounded agents. The approach has been applied to Classical Propositional Logic (CPL), yielding a hierarchy of tractable depth-bounded approximations to that logic, which in turn has been based on a KE/KI system. -/- This Thesis shows that the approach can be (...) naturally extended to useful nonclassical logics such as First-Degree Entailment (FDE), the Logic of Paradox (LP), Strong Kleene Logic (K3 ) and Intuitionistic Propositional Logic (IPL). To do this, we introduce a KE/KI-style system for each of those logics such that: is formulated via signed formulae, consist of linear operational rules and branching structural rule(s), can be used as a direct-proof and a refutation method, and is interesting independently of the approach in that it has an exponential speed-up on its tableau system counterpart. The latter given that we introduce a new class of examples which we prove to be hard for all tableau systems sharing the V/& rules with the classical one, but easy for their analogous KE-style systems. Then we focus on showing that each of our KE/KI-style systems naturally yields a hierarchy of tractable depth-bounded approximations to the respective logic, in terms of the maximum number of allowed nested applications of the branching rule(s). The rule(s) express(es) a generalized rule of bivalence, is (are) essentially cut rule(s) and govern(s) the manipulation of virtual information, which is information that an agent does not hold but she temporarily assumes as if she held it. Intuitively, the more virtual information needs to be invoked via the branching rule(s), the harder the inference is for the agent. So, the nested application the branching rule(s) provides a sensible measure of inferential depth. We also show that each hierarchy approximating FDE, LP, and K3 , admits of a 5-valued non-deterministic semantics; whereas, paving the way for a semantical characterization of the hierarchy approximating IPL, we provide a 3-valued non-deterministic semantics for the full logic that fixes the meaning of the connectives without appealing to “structural” conditions. -/- Moreover, we show a super-polynomial lower bound for the strongest possible version of clausal tableaux on the well-known class of “truly fat” expressions (which are easy for KE), settling a problem left open in the literature. Further, we investigate a hierarchy of tractable depth-bounded approximations to CPL based only on KE. Finally, we propose a refinement of the p-simulation relation which is adequate to establish positive results about the superiority of a system over another with respect to proof-search. (shrink)

How can we resist the repugnant conclusion? James Griffin has plausibly suggested that part way through the sequence we may reach a world—let us call it “J”—in which the lives are lexically superior to those that follow. If it would be preferable to live a single life in J than through any number of lives in the next one, then it would be strange to judge K the better world. Instead, we may reasonably “suspend addition” and judge J superior, as (...) if aggregating the lives in the larger world intrapersonally. I argue that the addition of new people with separate preferences renders this inference illicit when comparing J+ and K. When one pairwise comparison suspends addition and the other does not, the result is an intransitive value judgement: J < J+ < K < J, producing the mere addition paradox. (shrink)

Substructural approaches to paradoxes have attracted much attention from the philosophical community in the last decade. In this paper we focus on two substructural logics, named ST and TS, along with two structural cousins, LP and K3. It is well known that LP and K3 are duals in the sense that an inference is valid in one logic just in case the contrapositive is valid in the other logic. As a consequence of this duality, theories based on either logic (...) are tightly connected since many of the arguments for and objections against one theory reappear in the other theory in dual form. The target of the paper is making explicit in exactly what way, if any, ST and TS are dual to one another. The connection will allow us to gain a more fine-grained understanding of these logics and of the theories based on them. In particular, we will obtain new insights on two questions concerning ST which are being intensively discussed in the current literature: whether ST preserves classical logic and whether it is LP in sheep’s clothing. Explaining in what way ST and TS are duals requires comparing these logics at a metainferential level. We provide to this end a uniform proof theory to decide on valid metainferences for each of the four logics. This proof procedure allows us to show in a very simple way how different properties of inferences (unsatisfiability, supersatisfiability and antivalidity) that behave in very different ways for each logic can be captured in terms of the validity of a metainference. (shrink)

It is a platitude that when we reason, we often take things for granted, sometimes even justifiably so. The chemist might reason from the fact that a substance turns litmus paper red to that substance being an acid. In so doing, they take for granted, reasonably enough, that this test for acidity is valid. We ordinarily reason from things looking a certain way to their being that way. We take for granted, reasonably enough, that things are as they look Although (...) it is a platitude that we often take things for granted when we reason—whether justifiably or not—one might think that we do not have to. In fact, it is a natural expectation that were we not pressed by time, lack of energy or focus, we could always in principle make explicit in the form of premises every single presupposition we make in the course of our reasoning. In other words, it is natural to expect it to be true that presuppositionless reasoning is possible. In this essay, I argue that it is false: presuppositionless reasoning is impossible. Indeed, I think this is one of the lessons of a long-standing paradox about inference and reasoning known as Lewis Carroll’s (1985) regress of the premises. Many philosophers agree that Carroll’s regress teaches us something foundational about reasoning. I part ways about what it is that it teaches us. What it teaches us is that the structure of reasoning is constitutively presuppositional. (shrink)

This paper is concerned with the paradox of decrease. Its aim is to defend the answer to this puzzle that was propounded by its originator, namely, the Stoic philosopher Chrysippus. The main trouble with this answer to the paradox is that it has the seemingly problematic implication that a material thing could perish due merely to extrinsic change. It follows that in order to defend Chrysippus’ answer to the paradox, one has to explain how it could be (...) that Theon is destroyed by the amputation without changing intrinsically. In this paper, I shall answer this challenge by appealing to the broadly Aristotelian idea that at least some of the proper parts of a material substance are ontologically dependent on that substance. I will also appeal to this idea in order to offer a new solution to the structurally similar paradox of increase. In this way, we will end up with a unified solution to two structurally similar paradoxes. (shrink)

This paper contends that Stoic logic (i.e. Stoic analysis) deserves more attention from contemporary logicians. It sets out how, compared with contemporary propositional calculi, Stoic analysis is closest to methods of backward proof search for Gentzen-inspired substructural sequent logics, as they have been developed in logic programming and structural proof theory, and produces its proof search calculus in tree form. It shows how multiple similarities to Gentzen sequent systems combine with intriguing dissimilarities that may enrich contemporary discussion. Much of Stoic (...) logic appears surprisingly modern: a recursively formulated syntax with some truth-functional propositional operators; analogues to cut rules, axiom schemata and Gentzen’s negation-introduction rules; an implicit variable-sharing principle and deliberate rejection of Thinning and avoidance of paradoxes of implication. These latter features mark the system out as a relevance logic, where the absence of duals for its left and right introduction rules puts it in the vicinity of McCall’s connexive logic. Methodologically, the choice of meticulously formulated meta-logical rules in lieu of axiom and inference schemata absorbs some structural rules and results in an economical, precise and elegant system that values decidability over completeness. (shrink)

In his Quadratura, Paul of Venice considers a sophism involving time and tense which appears to show that there is a valid inference which is also invalid. His argument runs as follows: consider this inference concerning some proposition A: A will signify only that everything true will be false, so A will be false. Call this inference B. Then B is valid because the opposite of its conclusion is incompatible with its premise. In accordance with the standard (...) doctrine of ampliation, Paul takes A to be equivalent to 'Everything that is or will be true will be false'. But he proceeds to argue that it is possible that B's premise ('A will signify only that everything true will be false') could be true and its conclusion false, so B is not only valid but also invalid. Thus A and B are the basis of an insoluble. In his Logica Parva, a self-confessedly elementary text aimed at students and not necessarily representing his own view, and in the Quadratura, Paul follows the solution found in the Logica Oxoniensis, which posits an implicit assertion of its own truth in insolubles like B. However, in the treatise on insolubles in his Logica Magna, Paul develops and endorses Swyneshed's solution, which stood out against this ''multiple-meanings'' approach in offering a solution that took insolubles at face value, meaning no more than is explicit in what they say. On this account, insolubles imply their own falsity, and that is why, in so falsifying themselves, they are false. We consider how both types of solution apply to B and how they complement each other. On both, B is valid. But on one (following Swyneshed), B has true premises and false conclusion, and contradictories can be false together; on the other (following the Logica Oxoniensis), the counterexample is rejected. (shrink)