Switch to: References

Citations of:

Non-deductive methods in mathematics

Stanford Encyclopedia of Philosophy (2010)

Add citations

You must login to add citations.
  1. Proofs, Reliable Processes, and Justification in Mathematics.Yacin Hamami - 2021 - British Journal for the Philosophy of Science 74 (4):1027-1045.
    Although there exist today a variety of non-deductive reliable processes able to determine the truth of certain mathematical propositions, proof remains the only form of justification accepted in mathematical practice. Some philosophers and mathematicians have contested this commonly accepted epistemic superiority of proof on the ground that mathematicians are fallible: when the deductive method is carried out by a fallible agent, then it comes with its own level of reliability, and so might happen to be equally or even less reliable (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Computational Complexity Theory and the Philosophy of Mathematics†.Walter Dean - 2019 - Philosophia Mathematica 27 (3):381-439.
    Computational complexity theory is a subfield of computer science originating in computability theory and the study of algorithms for solving practical mathematical problems. Amongst its aims is classifying problems by their degree of difficulty — i.e., how hard they are to solve computationally. This paper highlights the significance of complexity theory relative to questions traditionally asked by philosophers of mathematics while also attempting to isolate some new ones — e.g., about the notion of feasibility in mathematics, the $\mathbf{P} \neq \mathbf{NP}$ (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • The "Artificial Mathematician" Objection: Exploring the (Im)possibility of Automating Mathematical Understanding.Sven Delarivière & Bart Van Kerkhove - 2017 - In B. Sriraman (ed.), Humanizing Mathematics and its Philosophy. Birkhäuser. pp. 173-198.
    Reuben Hersh confided to us that, about forty years ago, the late Paul Cohen predicted to him that at some unspecified point in the future, mathematicians would be replaced by computers. Rather than focus on computers replacing mathematicians, however, our aim is to consider the (im)possibility of human mathematicians being joined by “artificial mathematicians” in the proving practice—not just as a method of inquiry but as a fellow inquirer.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Proofs Versus Experiments: Wittgensteinian Themes Surrounding the Four-Color Theorem.G. D. Secco - 2017 - In Marcos Silva (ed.), How Colours Matter to Philosophy. Cham: Springer. pp. 289-307.
    The Four-Colour Theorem (4CT) proof, presented to the mathematical community in a pair of papers by Appel and Haken in the late 1970's, provoked a series of philosophical debates. Many conceptual points of these disputes still require some elucidation. After a brief presentation of the main ideas of Appel and Haken’s procedure for the proof and a reconstruction of Thomas Tymoczko’s argument for the novelty of 4CT’s proof, we shall formulate some questions regarding the connections between the points raised by (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Mathematical Knowledge, the Analytic Method, and Naturalism.Fabio Sterpetti - 2018 - In Sorin Bangu (ed.), Naturalizing Logico-Mathematical Knowledge: Approaches From Psychology and Cognitive Science. New York: Routledge. pp. 268-293.
    This chapter tries to answer the following question: How should we conceive of the method of mathematics, if we take a naturalist stance? The problem arises since mathematical knowledge is regarded as the paradigm of certain knowledge, because mathematics is based on the axiomatic method. Moreover, natural science is deeply mathematized, and science is crucial for any naturalist perspective. But mathematics seems to provide a counterexample both to methodological and ontological naturalism. To face this problem, some authors tried to naturalize (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Mathematical Knowledge and Naturalism.Fabio Sterpetti - 2019 - Philosophia 47 (1):225-247.
    How should one conceive of the method of mathematics, if one takes a naturalist stance? Mathematical knowledge is regarded as the paradigm of certain knowledge, since mathematics is based on the axiomatic method. Natural science is deeply mathematized, and science is crucial for any naturalist perspective. But mathematics seems to provide a counterexample both to methodological and ontological naturalism. To face this problem, some naturalists try to naturalize mathematics relying on Darwinism. But several difficulties arise when one tries to naturalize (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • What seemings seem to be.Samuel A. Taylor - 2015 - Episteme 12 (3):363-384.
    According to Phenomenal Conservatism (PC), if it seems to a subject S that P, S thereby has some degree of (defeasible) justification for believing P. But what is it for P to seem true? Answering this question is vital for assessing what role (if any) such states can play. Many have appeared to adopt a kind of non-reductionism that construes seemings as intentional states which cannot be reduced to more familiar mental states like beliefs or sensations. In this paper I (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Why There May Be Epistemic Duties.Scott Stapleford - 2015 - Dialogue 54 (1):63-89.
    Chase Wrenn argues that there are no epistemic duties. When it appears that we have an epistemic duty to believe, disbelieve or suspend judgement about some proposition P, we are really under a moral obligation to adopt the attitude towards P that our evidence favours. The argument appeals to theoretical parsimony: our conceptual scheme will be simpler without epistemic duties and we should therefore drop them. I argue that Wrenn’s strategy is flawed. There may well be things that we ought (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Non-deductive Logic in Mathematics: The Probability of Conjectures.James Franklin - 2013 - In Andrew Aberdein & Ian J. Dove (eds.), The Argument of Mathematics. Dordrecht, Netherland: Springer. pp. 11--29.
    Mathematicians often speak of conjectures, yet unproved, as probable or well-confirmed by evidence. The Riemann Hypothesis, for example, is widely believed to be almost certainly true. There seems no initial reason to distinguish such probability from the same notion in empirical science. Yet it is hard to see how there could be probabilistic relations between the necessary truths of pure mathematics. The existence of such logical relations, short of certainty, is defended using the theory of logical probability (or objective Bayesianism (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • The Argument of Mathematics.Andrew Aberdein & Ian J. Dove (eds.) - 2013 - Dordrecht, Netherland: Springer.
    Written by experts in the field, this volume presents a comprehensive investigation into the relationship between argumentation theory and the philosophy of mathematical practice. Argumentation theory studies reasoning and argument, and especially those aspects not addressed, or not addressed well, by formal deduction. The philosophy of mathematical practice diverges from mainstream philosophy of mathematics in the emphasis it places on what the majority of working mathematicians actually do, rather than on mathematical foundations. -/- The book begins by first challenging the (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Experimental mathematics, computers and the a priori.Mark McEvoy - 2013 - Synthese 190 (3):397-412.
    In recent decades, experimental mathematics has emerged as a new branch of mathematics. This new branch is defined less by its subject matter, and more by its use of computer assisted reasoning. Experimental mathematics uses a variety of computer assisted approaches to verify or prove mathematical hypotheses. For example, there is “number crunching” such as searching for very large Mersenne primes, and showing that the Goldbach conjecture holds for all even numbers less than 2 × 1018. There are “verifications” of (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Non-deductive logic in mathematics.James Franklin - 1987 - British Journal for the Philosophy of Science 38 (1):1-18.
    Mathematicians often speak of conjectures as being confirmed by evidence that falls short of proof. For their own conjectures, evidence justifies further work in looking for a proof. Those conjectures of mathematics that have long resisted proof, such as Fermat's Last Theorem and the Riemann Hypothesis, have had to be considered in terms of the evidence for and against them. It is argued here that it is not adequate to describe the relation of evidence to hypothesis as `subjective', `heuristic' or (...)
    Download  
     
    Export citation  
     
    Bookmark   32 citations  
  • A Mid-blue Logic.Danilo Suster - 2022 - In Boran Berčić, Aleksandra Golubović & Majda Trobok (eds.), HUMAN RATIONALITY Festschrift for Nenad Smokrović. Rijeka: University of Rijeka, Faculty of Humanities and Social Sciences. pp. 211-228.
    I discuss Smokrović’s work on the normativity of logic (Smokrović 2017, Smokrović 2018). I agree that the classical formal logic is not an adequate model for real-life reasoning. But I present some doubts about his notion of deductive logic and his proposal to model such reasoning in non-monotonic logic. No branch of formal logic by itself is likely to capture real-life inferential links (reasoned-inference). I use the logic of relevance as my case study and extend the pessimistic morals to modern (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • What Counts as Cheating? Deducibility, Imagination, and the Mary Case.Amy Kind - 2024 - Philosophia 52 (2):211-220.
    In The Matter of Consciousness, in the course of his extended discussion and defense of Frank Jackson’s famous knowledge argument, Torin Alter dismisses some objections on the grounds that they are cases of cheating. Though some opponents of the knowledge argument offer various scenarios in which Mary might come to know what seeing red is like while still in the room, Alter argues that the proposed scenarios are irrelevant. In his view, the Mary case is offered to defend the claim (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Cosmic Skepticism and the Beginning of Physical Reality (Doctoral Dissertation).Linford Dan - 2022 - Dissertation, Purdue University
    This dissertation is concerned with two of the largest questions that we can ask about the nature of physical reality: first, whether physical reality begin to exist and, second, what criteria would physical reality have to fulfill in order to have had a beginning? Philosophers of religion and theologians have previously addressed whether physical reality began to exist in the context of defending the Kal{\'a}m Cosmological Argument (KCA) for theism, that is, (P1) everything that begins to exist has a cause (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Acceptable gaps in mathematical proofs.Line Edslev Andersen - 2020 - Synthese 197 (1):233-247.
    Mathematicians often intentionally leave gaps in their proofs. Based on interviews with mathematicians about their refereeing practices, this paper examines the character of intentional gaps in published proofs. We observe that mathematicians’ refereeing practices limit the number of certain intentional gaps in published proofs. The results provide some new perspectives on the traditional philosophical questions of the nature of proof and of what grounds mathematical knowledge.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • Do We Need the Environment to Explain Operant Behavior?Geir Overskeid - 2018 - Frontiers in Psychology 9.
    Download  
     
    Export citation  
     
    Bookmark  
  • Towards a theory of abduction based on conditionals.Rolf Pfister - 2022 - Synthese 200 (3):1-30.
    Abduction is considered the most powerful, but also the most controversially discussed type of inference. Based on an analysis of Peirce’s retroduction, Lipton’s Inference to the Best Explanation and other theories, a new theory of abduction is proposed. It considers abduction not as intrinsically explanatory but as intrinsically conditional: for a given fact, abduction allows one to infer a fact that implies it. There are three types of abduction: Selective abduction selects an already known conditional whose consequent is the given (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Randomized arguments are transferable.Jeffrey C. Jackson - 2009 - Philosophia Mathematica 17 (3):363-368.
    Easwaran has given a definition of transferability and argued that, under this definition, randomized arguments are not transferable. I show that certain aspects of his definition are not suitable for addressing the underlying question of whether or not there is an epistemic distinction between randomized and deductive arguments. Furthermore, I demonstrate that for any suitable definition, randomized arguments are in fact transferable.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Is Tap Dance a Form of Jazz Percussion?Aili Bresnahan - 2019 - Midwest Studies in Philosophy 44 (1):183-194.
    Midwest Studies In Philosophy, EarlyView.
    Download  
     
    Export citation  
     
    Bookmark  
  • Proof and the Virtues of Shared Enquiry.Don Berry - forthcoming - Philosophia Mathematica:nkw022.
    This paper investigates an important aspect of mathematical practice: that proof is required for a finished piece of mathematics. If follows that non-deductive arguments — however convincing — are never sufficient. I explore four aspects of mathematical research that have facilitated the impressive success of the discipline. These I call the Practical Virtues: Permanence, Reliability, Autonomy, and Consensus. I then argue that permitting results to become established on the basis of non-deductive evidence alone would lead to their deterioration. This furnishes (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • The dialectical tier of mathematical proof.Andrew Aberdein - 2011 - In Frank Zenker (ed.), Argumentation: Cognition & Community. Proceedings of the 9th International Conference of the Ontario Society for the Study of Argumentation (OSSA), May 18--21, 2011. OSSA.
    Ralph Johnson argues that mathematical proofs lack a dialectical tier, and thereby do not qualify as arguments. This paper argues that, despite this disavowal, Johnson’s account provides a compelling model of mathematical proof. The illative core of mathematical arguments is held to strict standards of rigour. However, compliance with these standards is itself a matter of argument, and susceptible to challenge. Hence much actual mathematical practice takes place in the dialectical tier.
    Download  
     
    Export citation  
     
    Bookmark   5 citations