Results for 'proof theory'

996 found
Order:
  1. Proof Theory of Finite-valued Logics.Richard Zach - 1993 - Dissertation, Technische Universität Wien
    The proof theory of many-valued systems has not been investigated to an extent comparable to the work done on axiomatizatbility of many-valued logics. Proof theory requires appropriate formalisms, such as sequent calculus, natural deduction, and tableaux for classical (and intuitionistic) logic. One particular method for systematically obtaining calculi for all finite-valued logics was invented independently by several researchers, with slight variations in design and presentation. The main aim of this report is to develop the proof (...)
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  2. Stoic Sequent Logic and Proof Theory.Susanne Bobzien - 2019 - History and Philosophy of Logic 40 (3):234-265.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  3. Proof Theory and Semantics for a Theory of Definite Descriptions.Nils Kürbis - 2021 - In Anupam Das & Sara Negri (eds.), TABLEAUX 2021, LNAI 12842.
    This paper presents a sequent calculus and a dual domain semantics for a theory of definite descriptions in which these expressions are formalised in the context of complete sentences by a binary quantifier I. I forms a formula from two formulas. Ix[F, G] means ‘The F is G’. This approach has the advantage of incorporating scope distinctions directly into the notation. Cut elimination is proved for a system of classical positive free logic with I and it is shown to (...)
    Download  
     
    Export citation  
     
    Bookmark  
  4. Takeuti's proof theory in the context of the Kyoto School.Andrew Arana - 2019 - Jahrbuch Für Philosophie Das Tetsugaku-Ronso 46:1-17.
    Gaisi Takeuti (1926–2017) is one of the most distinguished logicians in proof theory after Hilbert and Gentzen. He extensively extended Hilbert's program in the sense that he formulated Gentzen's sequent calculus, conjectured that cut-elimination holds for it (Takeuti's conjecture), and obtained several stunning results in the 1950–60s towards the solution of his conjecture. Though he has been known chiefly as a great mathematician, he wrote many papers in English and Japanese where he expressed his philosophical thoughts. In particular, (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  5. Topics in the Proof Theory of Non-classical Logics. Philosophy and Applications.Fabio De Martin Polo - 2023 - Dissertation, Ruhr-Universität Bochum
    Chapter 1 constitutes an introduction to Gentzen calculi from two perspectives, logical and philosophical. It introduces the notion of generalisations of Gentzen sequent calculus and the discussion on properties that characterize good inferential systems. Among the variety of Gentzen-style sequent calculi, I divide them in two groups: syntactic and semantic generalisations. In the context of such a discussion, the inferentialist philosophy of the meaning of logical constants is introduced, and some potential objections – mainly concerning the choice of working with (...)
    Download  
     
    Export citation  
     
    Bookmark  
  6. Questions about proof theory vis-à-vis natural language semantics (2007).Anna Szabolcsi - manuscript
    Semantics plays a role in grammar in at least three guises. (A) Linguists seek to account for speakers‘ knowledge of what linguistic expressions mean. This goal is typically achieved by assigning a model theoretic interpretation in a compositional fashion. For example, *No whale flies* is true if and only if the intersection of the sets of whales and fliers is empty in the model. (B) Linguists seek to account for the ability of speakers to make various inferences based on semantic (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  7. Hypersequents and the proof theory of intuitionistic fuzzy logic.Matthias Baaz & Richard Zach - 2000 - In Clote Peter G. & Schwichtenberg Helmut (eds.), Computer Science Logic. 14th International Workshop, CSL 2000. Springer. pp. 187– 201.
    Takeuti and Titani have introduced and investigated a logic they called intuitionistic fuzzy logic. This logic is characterized as the first-order Gödel logic based on the truth value set [0,1]. The logic is known to be axiomatizable, but no deduction system amenable to proof-theoretic, and hence, computational treatment, has been known. Such a system is presented here, based on previous work on hypersequent calculi for propositional Gödel logics by Avron. It is shown that the system is sound and complete, (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  8. Non-reflexive Nonsense: Proof-Theory for Paracomplete Weak Kleene Logic.Bruno Da Ré, Damian Szmuc & María Inés Corbalán - forthcoming - Studia Logica:1-17.
    Our aim is to provide a sequent calculus whose external consequence relation coincides with the three-valued paracomplete logic `of nonsense' introduced by Dmitry Bochvar and, independently, presented as the weak Kleene logic K3W by Stephen C. Kleene. The main features of this calculus are (i) that it is non-reflexive, i.e., Identity is not included as an explicit rule (although a restricted form of it with premises is derivable); (ii) that it includes rules where no variable-inclusion conditions are attached; and (iii) (...)
    Download  
     
    Export citation  
     
    Bookmark  
  9. The Implantation Argument: Simulation Theory is Proof that God Exists.Jeff Grupp - 2021 - Metaphysica 22 (2):189-221.
    I introduce the implantation argument, a new argument for the existence of God. Spatiotemporal extensions believed to exist outside of the mind, composing an external physical reality, cannot be composed of either atomlessness, or of Democritean atoms, and therefore the inner experience of an external reality containing spatiotemporal extensions believed to exist outside of the mind does not represent the external reality, the mind is a mere cinematic-like mindscreen, implanted into the mind by a creator-God. It will be shown that (...)
    Download  
     
    Export citation  
     
    Bookmark  
  10. Evidence, Proofs, and Derivations.Andrew Aberdein - 2019 - ZDM 51 (5):825-834.
    The traditional view of evidence in mathematics is that evidence is just proof and proof is just derivation. There are good reasons for thinking that this view should be rejected: it misrepresents both historical and current mathematical practice. Nonetheless, evidence, proof, and derivation are closely intertwined. This paper seeks to tease these concepts apart. It emphasizes the role of argumentation as a context shared by evidence, proofs, and derivations. The utility of argumentation theory, in general, and (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  11. Discourse Grammars and the Structure of Mathematical Reasoning II: The Nature of a Correct Theory of Proof and Its Value.John Corcoran - 1971 - Journal of Structural Learning 3 (2):1-16.
    1971. Discourse Grammars and the Structure of Mathematical Reasoning II: The Nature of a Correct Theory of Proof and Its Value, Journal of Structural Learning 3, #2, 1–16. REPRINTED 1976. Structural Learning II Issues and Approaches, ed. J. Scandura, Gordon & Breach Science Publishers, New York, MR56#15263. -/- This is the second of a series of three articles dealing with application of linguistics and logic to the study of mathematical reasoning, especially in the setting of a concern for (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  12. The Proof-Structure of Kant’s A-Edition Objective Deduction.Corey W. Dyck - 2019 - In Giuseppe Motta, Dennis Schulting & Udo Thiel (eds.), Kant's Transcendental Deduction and the Theory of Apperception: New Interpretations. Berlin: De Gruyter. pp. 381-402.
    Kant's A-Edition objective deduction is naturally (and has traditionally been) divided into two arguments: an " argument from above" and one that proceeds " von unten auf." This would suggest a picture of Kant's procedure in the objective deduction as first descending and ascending the same ladder, the better, perhaps, to test its durability or to thoroughly convince the reader of its soundness. There are obvious obstacles to such a reading, however; and in this chapter I will argue that the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  13. Short Proofs of Tautologies using the Schema of Equivalence.Matthias Baaz & Richard Zach - 1994 - In Egon Börger, Yuri Gurevich & Karl Meinke (eds.), Computer Science Logic. 7th Workshop, CSL '93, Swansea. Selected Papers. Berlin: Springer. pp. 33-35.
    It is shown how the schema of equivalence can be used to obtain short proofs of tautologies A , where the depth of proofs is linear in the number of variables in A .
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  14. On Proof-Theoretic Approaches to the Paradoxes: Problems of Undergeneration and Overgeneration in the Prawitz-Tennant Analysis.Seungrak Choi - 2019 - Dissertation, Korea University
    In this dissertation, we shall investigate whether Tennant's criterion for paradoxicality(TCP) can be a correct criterion for genuine paradoxes and whether the requirement of a normal derivation(RND) can be a proof-theoretic solution to the paradoxes. Tennant’s criterion has two types of counterexamples. The one is a case which raises the problem of overgeneration that TCP makes a paradoxical derivation non-paradoxical. The other is one which generates the problem of undergeneration that TCP renders a non-paradoxical derivation paradoxical. Chapter 2 deals (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  15.  77
    Fusion, fission, and Ackermann’s truth constant in relevant logics: A proof-theoretic investigation.Fabio De Martin Polo - forthcoming - In Andrew Tedder, Shawn Standefer & Igor Sedlar (eds.), New Directions in Relevant Logic. Springer.
    The aim of this paper is to provide a proof-theoretic characterization of relevant logics including fusion and fission connectives, as well as Ackermann’s truth constant. We achieve this by employing the well-established methodology of labelled sequent calculi. After having introduced several systems, we will conduct a detailed proof-theoretic analysis, show a cut-admissibility theorem, and establish soundness and completeness. The paper ends with a discussion that contextualizes our current work within the broader landscape of the proof theory (...)
    Download  
     
    Export citation  
     
    Bookmark  
  16. Display to Labeled Proofs and Back Again for Tense Logics.Agata Ciabattoni, Tim Lyon, Revantha Ramanayake & Alwen Tiu - 2021 - ACM Transactions on Computational Logic 22 (3):1-31.
    We introduce translations between display calculus proofs and labeled calculus proofs in the context of tense logics. First, we show that every derivation in the display calculus for the minimal tense logic Kt extended with general path axioms can be effectively transformed into a derivation in the corresponding labeled calculus. Concerning the converse translation, we show that for Kt extended with path axioms, every derivation in the corresponding labeled calculus can be put into a special form that is translatable to (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  17. Discourse Grammars and the Structure of Mathematical Reasoning III: Two Theories of Proof,.John Corcoran - 1971 - Journal of Structural Learning 3 (3):1-24.
    ABSTRACT This part of the series has a dual purpose. In the first place we will discuss two kinds of theories of proof. The first kind will be called a theory of linear proof. The second has been called a theory of suppositional proof. The term "natural deduction" has often and correctly been used to refer to the second kind of theory, but I shall not do so here because many of the theories so-called (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  18. Objectivity And Proof In A Classical Indian Theory Of Number.Jonardon Ganeri - 2001 - Synthese 129 (3):413-437.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  19. Criminal Proof: Fixed or Flexible?Lewis Ross - 2023 - Philosophical Quarterly (4):1-23.
    Should we use the same standard of proof to adjudicate guilt for murder and petty theft? Why not tailor the standard of proof to the crime? These relatively neglected questions cut to the heart of central issues in the philosophy of law. This paper scrutinises whether we ought to use the same standard for all criminal cases, in contrast with a flexible approach that uses different standards for different crimes. I reject consequentialist arguments for a radically flexible standard (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  20. What are acceptable reductions? Perspectives from proof-theoretic semantics and type theory.Sara Ayhan - 2023 - Australasian Journal of Logic 20 (3):412-428.
    It has been argued that reduction procedures are closely connected to the question about identity of proofs and that accepting certain reductions would lead to a trivialization of identity of proofs in the sense that every derivation of the same conclusion would have to be identified. In this paper it will be shown that the question, which reductions we accept in our system, is not only important if we see them as generating a theory of proof identity but (...)
    Download  
     
    Export citation  
     
    Bookmark  
  21. Takeuti's well-ordering proofs revisited.Andrew Arana & Ryota Akiyoshi - 2021 - Mita Philosophy Society 3 (146):83-110.
    Gaisi Takeuti extended Gentzen's work to higher-order case in 1950's–1960's and proved the consistency of impredicative subsystems of analysis. He has been chiefly known as a successor of Hilbert's school, but we pointed out in the previous paper that Takeuti's aimed to investigate the relationships between "minds" by carrying out his proof-theoretic project rather than proving the "reliability" of such impredicative subsystems of analysis. Moreover, as briefly explained there, his philosophical ideas can be traced back to Nishida's philosophy in (...)
    Download  
     
    Export citation  
     
    Bookmark  
  22. Legal proof and statistical conjunctions.Lewis D. Ross - 2020 - Philosophical Studies 178 (6):2021-2041.
    A question, long discussed by legal scholars, has recently provoked a considerable amount of philosophical attention: ‘Is it ever appropriate to base a legal verdict on statistical evidence alone?’ Many philosophers who have considered this question reject legal reliance on bare statistics, even when the odds of error are extremely low. This paper develops a puzzle for the dominant theories concerning why we should eschew bare statistics. Namely, there seem to be compelling scenarios in which there are multiple sources of (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  23. Criminal Proof: Fixed or Flexible?Lewis Ross - 2023 - The Philosophical Quarterly.
    Should we use the same standard of proof to adjudicate guilt for murder and petty theft? Why not tailor the standard of proof to the crime? These relatively neglected questions cut to the heart of central issues in the philosophy of law. This paper scrutinises whether we ought to use the same standard for all criminal cases, in contrast with a flexible approach that uses different standards for different crimes. I reject consequentialist arguments for a radically flexible standard (...)
    Download  
     
    Export citation  
     
    Bookmark  
  24. Sketch of a Proof-Theoretic Semantics for Necessity.Nils Kürbis - 2020 - In Nicola Olivetti, Rineke Verbrugge & Sara Negri (eds.), Advances in Modal Logic 13. Booklet of Short Papers. Helsinki: pp. 37-43.
    This paper considers proof-theoretic semantics for necessity within Dummett's and Prawitz's framework. Inspired by a system of Pfenning's and Davies's, the language of intuitionist logic is extended by a higher order operator which captures a notion of validity. A notion of relative necessary is defined in terms of it, which expresses a necessary connection between the assumptions and the conclusion of a deduction.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  25. Automating Agential Reasoning: Proof-Calculi and Syntactic Decidability for STIT Logics.Tim Lyon & Kees van Berkel - 2019 - In M. Baldoni, M. Dastani, B. Liao, Y. Sakurai & R. Zalila Wenkstern (eds.), PRIMA 2019: Principles and Practice of Multi-Agent Systems. Springer. pp. 202-218.
    This work provides proof-search algorithms and automated counter-model extraction for a class of STIT logics. With this, we answer an open problem concerning syntactic decision procedures and cut-free calculi for STIT logics. A new class of cut-free complete labelled sequent calculi G3LdmL^m_n, for multi-agent STIT with at most n-many choices, is introduced. We refine the calculi G3LdmL^m_n through the use of propagation rules and demonstrate the admissibility of their structural rules, resulting in auxiliary calculi Ldm^m_nL. In the single-agent case, (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  26. On the alleged simplicity of impure proof.Andrew Arana - 2017 - In Roman Kossak & Philip Ording (eds.), Simplicity: Ideals of Practice in Mathematics and the Arts. Springer. pp. 207-226.
    Roughly, a proof of a theorem, is “pure” if it draws only on what is “close” or “intrinsic” to that theorem. Mathematicians employ a variety of terms to identify pure proofs, saying that a pure proof is one that avoids what is “extrinsic,” “extraneous,” “distant,” “remote,” “alien,” or “foreign” to the problem or theorem under investigation. In the background of these attributions is the view that there is a distance measure (or a variety of such measures) between mathematical (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  27. Recent work on the proof paradox.Lewis D. Ross - 2020 - Philosophy Compass 15 (6):e12667.
    Recent years have seen fresh impetus brought to debates about the proper role of statistical evidence in the law. Recent work largely centres on a set of puzzles known as the ‘proof paradox’. While these puzzles may initially seem academic, they have important ramifications for the law: raising key conceptual questions about legal proof, and practical questions about DNA evidence. This article introduces the proof paradox, why we should care about it, and new work attempting to resolve (...)
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  28. From Display to Labelled Proofs for Tense Logics.Agata Ciabattoni, Tim Lyon & Revantha Ramanayake - 2018 - In Anil Nerode & Sergei Artemov (eds.), Logical Foundations of Computer Science. Springer International Publishing. pp. 120 - 139.
    We introduce an effective translation from proofs in the display calculus to proofs in the labelled calculus in the context of tense logics. We identify the labelled calculus proofs in the image of this translation as those built from labelled sequents whose underlying directed graph possesses certain properties. For the basic normal tense logic Kt, the image is shown to be the set of all proofs in the labelled calculus G3Kt.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  29. Truth, Proof and Gödelian Arguments: A Defence of Tarskian Truth in Mathematics.Markus Pantsar - 2009 - Dissertation, University of Helsinki
    One of the most fundamental questions in the philosophy of mathematics concerns the relation between truth and formal proof. The position according to which the two concepts are the same is called deflationism, and the opposing viewpoint substantialism. In an important result of mathematical logic, Kurt Gödel proved in his first incompleteness theorem that all consistent formal systems containing arithmetic include sentences that can neither be proved nor disproved within that system. However, such undecidable Gödel sentences can be established (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  30. Riemann, Metatheory, and Proof, Rev.3.Michael Lucas Monterey & Michael Lucas-Monterey - manuscript
    The work provides comprehensively definitive, unconditional proofs of Riemann's hypothesis, Goldbach's conjecture, the 'twin primes' conjecture, the Collatz conjecture, the Newcomb-Benford theorem, and the Quine-Putnam Indispensability thesis. The proofs validate holonomic metamathematics, meta-ontology, new number theory, new proof theory, new philosophy of logic, and unconditional disproof of the P/NP problem. The proofs, metatheory, and definitions are also confirmed and verified with graphic proof of intrinsic enabling and sustaining principles of reality.
    Download  
     
    Export citation  
     
    Bookmark  
  31. Slip-Proof Actions.Santiago Amaya - 2016 - In Roman Altshuler & Michael J. Sigrist (eds.), Time and the Philosophy of Action. Routledge. pp. 21-36.
    Most human actions are complex, but some of them are basic. Which are these? In this paper, I address this question by invoking slips, a common kind of mistake. The proposal is this: an action is basic if and only if it is not possible to slip in performing it. The argument discusses some well-established results from the psychology of language production in the context of a philosophical theory of action. In the end, the proposed criterion is applied to (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  32. Scientific Proof of the Natural Moral Law.Eric Brown - 2005 - Dissertation, The Catholic University of America
    Introduction to the Scientific Proof of the Natural Moral Law This paper proves that Aquinas has a means of demonstrating and deriving both moral goodness and the natural moral law from human nature alone. Aquinas scientifically proves the existence of the natural moral law as the natural rule of human operations from human nature alone. The distinction between moral goodness and transcendental goodness is affirmed. This provides the intellectual tools to refute the G.E. Moore (Principles of Ethics) attack against (...)
    Download  
     
    Export citation  
     
    Bookmark  
  33. Riemann, Metatheory, and Proof, Rev.3.Michael Lucas Monterey & Michael Lucas-Monterey - manuscript
    The work provides comprehensively definitive, unconditional proofs of Riemann's hypothesis, Goldbach's conjecture, the 'twin primes' conjecture, the Collatz conjecture, the Newcomb-Benford theorem, and the Quine-Putnam Indispensability thesis. The proofs validate holonomic metamathematics, meta-ontology, new number theory, new proof theory, new philosophy of logic, and unconditional disproof of the P/NP problem. The proofs, metatheory, and definitions are also confirmed and verified with graphic proof of intrinsic enabling and sustaining principles of reality.
    Download  
     
    Export citation  
     
    Bookmark  
  34.  96
    A Proof of ‘1st/3rd Person Relativism’ and its Consequences to the Mind-Body Problem.João Fonseca - manuscript
    The suggestion of something akin to a ‘relativist solution to the Mind-Body problem’ has recently been held by some scientists and philosophers; either explicitly (Galadí, 2023; Lahav & Neemeh, 2022; Ludwig, 2015) or in more implicit terms (Solms, 2018; Velmans, 2002, 2008). In this paper I provide an argument in favor of a relativist approach to the Mind-Body problem, more specifically, an argument for ‘1st/3rd person relativism’, the claim that ‘The truth value of some sentences or propositions is relative to (...)
    Download  
     
    Export citation  
     
    Bookmark  
  35. Truth and Proof without Models: A Development and Justification of the Truth-valuational Approach (2nd edition).Hanoch Ben-Yami - manuscript
    I explain why model theory is unsatisfactory as a semantic theory and has drawbacks as a tool for proofs on logic systems. I then motivate and develop an alternative, the truth-valuational substitutional approach (TVS), and prove with it the soundness and completeness of the first order Predicate Calculus with identity and of Modal Propositional Calculus. Modal logic is developed without recourse to possible worlds. Along the way I answer a variety of difficulties that have been raised against TVS (...)
    Download  
     
    Export citation  
     
    Bookmark  
  36. Meaning and identity of proofs in a bilateralist setting: A two-sorted typed lambda-calculus for proofs and refutations.Sara Ayhan - forthcoming - Journal of Logic and Computation.
    In this paper I will develop a lambda-term calculus, lambda-2Int, for a bi-intuitionistic logic and discuss its implications for the notions of sense and denotation of derivations in a bilateralist setting. Thus, I will use the Curry-Howard correspondence, which has been well-established between the simply typed lambda-calculus and natural deduction systems for intuitionistic logic, and apply it to a bilateralist proof system displaying two derivability relations, one for proving and one for refuting. The basis will be the natural deduction (...)
    Download  
     
    Export citation  
     
    Bookmark  
  37. Paratheism: A Proof that God neither Exists nor Does Not Exist.Steven James Bartlett - 2016 - Willamette University Faculty Research Website: Http://Www.Willamette.Edu/~Sbartlet/Documents/Bartlett_Paratheism_A%20Proof%20that%20God%20neither%2 0Exists%20nor%20Does%20Not%20Exist.Pdf.
    Theism and its cousins, atheism and agnosticism, are seldom taken to task for logical-epistemological incoherence. This paper provides a condensed proof that not only theism, but atheism and agnosticism as well, are all of them conceptually self-undermining, and for the same reason: All attempt to make use of the concept of “transcendent reality,” which here is shown not only to lack meaning, but to preclude the very possibility of meaning. In doing this, the incoherence of theism, atheism, and agnosticism (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  38. Algorithmic Structuring of Cut-free Proofs.Matthias Baaz & Richard Zach - 1993 - In Börger Egon, Kleine Büning Hans, Jäger Gerhard, Martini Simone & Richter Michael M. (eds.), Computer Science Logic. CSL’92, San Miniato, Italy. Selected Papers. Springer. pp. 29–42.
    The problem of algorithmic structuring of proofs in the sequent calculi LK and LKB ( LK where blocks of quantifiers can be introduced in one step) is investigated, where a distinction is made between linear proofs and proofs in tree form. In this framework, structuring coincides with the introduction of cuts into a proof. The algorithmic solvability of this problem can be reduced to the question of k-l-compressibility: "Given a proof of length k , and l ≤ k (...)
    Download  
     
    Export citation  
     
    Bookmark  
  39. Proofs are Programs: 19th Century Logic and 21st Century Computing.Philip Wadler - manuscript
    As the 19th century drew to a close, logicians formalized an ideal notion of proof. They were driven by nothing other than an abiding interest in truth, and their proofs were as ethereal as the mind of God. Yet within decades these mathematical abstractions were realized by the hand of man, in the digital stored-program computer. How it came to be recognized that proofs and programs are the same thing is a story that spans a century, a chase with (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  40. Virtue theory of mathematical practices: an introduction.Andrew Aberdein, Colin Jakob Rittberg & Fenner Stanley Tanswell - 2021 - Synthese 199 (3-4):10167-10180.
    Until recently, discussion of virtues in the philosophy of mathematics has been fleeting and fragmentary at best. But in the last few years this has begun to change. As virtue theory has grown ever more influential, not just in ethics where virtues may seem most at home, but particularly in epistemology and the philosophy of science, some philosophers have sought to push virtues out into unexpected areas, including mathematics and its philosophy. But there are some mathematicians already there, ready (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  41. Infinite analysis, lucky proof, and guaranteed proof in Leibniz.Gonzalo Rodriguez-Pereyra & Paul Lodge - 2011 - Archiv für Geschichte der Philosophie 93 (2):222-236.
    According to one of Leibniz's theories of contingency a proposition is contingent if and only if it cannot be proved in a finite number of steps. It has been argued that this faces the Problem of Lucky Proof , namely that we could begin by analysing the concept ‘Peter’ by saying that ‘Peter is a denier of Christ and …’, thereby having proved the proposition ‘Peter denies Christ’ in a finite number of steps. It also faces a more general (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  42. A theory of presumption for everyday argumentation.David M. Godden & Douglas N. Walton - 2007 - Pragmatics and Cognition 15 (2):313-346.
    The paper considers contemporary models of presumption in terms of their ability to contribute to a working theory of presumption for argumentation. Beginning with the Whatelian model, we consider its contemporary developments and alternatives, as proposed by Sidgwick, Kauffeld, Cronkhite, Rescher, Walton, Freeman, Ullmann-Margalit, and Hansen. Based on these accounts, we present a picture of presumptions characterized by their nature, function, foundation and force. On our account, presumption is a modal status that is attached to a claim and has (...)
    Download  
     
    Export citation  
     
    Bookmark   32 citations  
  43. A simple proof of Born’s rule for statistical interpretation of quantum mechanics.Biswaranjan Dikshit - 2017 - Journal for Foundations and Applications of Physics 4 (1):24-30.
    The Born’s rule to interpret the square of wave function as the probability to get a specific value in measurement has been accepted as a postulate in foundations of quantum mechanics. Although there have been so many attempts at deriving this rule theoretically using different approaches such as frequency operator approach, many-world theory, Bayesian probability and envariance, literature shows that arguments in each of these methods are circular. In view of absence of a convincing theoretical proof, recently some (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  44. Purism: An Ontological Proof for The Impossibility of God.* Primus - 2020 - Secular Studies 2 (2):160-178.
    This article presents an ontological proof that God is impossible.I define an ‘impossibility’ as a condition which is inconceivable due to its a priori characteristics (e.g. a ‘square circle’). Accordingly, said conditions will not ever become conceivable, as they could in instances of a posteriori inconceivability (e.g. the notion that someone could touch a star without being burned). As the basis of this argument, I refer to an a priori observation (Primus, 2019) regarding our inability to imagine inconsistency (difference) (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  45. ‘Sometime a paradox’, now proof: Yablo is not first order.Saeed Salehi - 2022 - Logic Journal of the IGPL 30 (1):71-77.
    Interesting as they are by themselves in philosophy and mathematics, paradoxes can be made even more fascinating when turned into proofs and theorems. For example, Russell’s paradox, which overthrew Frege’s logical edifice, is now a classical theorem in set theory, to the effect that no set contains all sets. Paradoxes can be used in proofs of some other theorems—thus Liar’s paradox has been used in the classical proof of Tarski’s theorem on the undefinability of truth in sufficiently rich (...)
    Download  
     
    Export citation  
     
    Bookmark  
  46. Semantic Epistemology Redux: Proof and Validity in Quantum Mechanics.Arnold Cusmariu - 2016 - Logos and Episteme 7 (3):287-303.
    Definitions I presented in a previous article as part of a semantic approach in epistemology assumed that the concept of derivability from standard logic held across all mathematical and scientific disciplines. The present article argues that this assumption is not true for quantum mechanics (QM) by showing that concepts of validity applicable to proofs in mathematics and in classical mechanics are inapplicable to proofs in QM. Because semantic epistemology must include this important theory, revision is necessary. The one I (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  47. How to Write a Proof: Patterns of Justification in Strategic Documents for Educational Reform.Jitka Wirthová - 2019 - Teorie Vědy / Theory of Science 41 (2):307-335.
    Writing strategic documents is a major practice of many actors striving to see their educational ideas realised in the curriculum. In these documents, arguments are systematically developed to create the legitimacy of a new educational goal and competence to make claims about it. Through a qualitative analysis of the writing strategies used in these texts, I show how two of the main actors in the Czech educational discourse have developed a proof that a new educational goal is needed. I (...)
    Download  
     
    Export citation  
     
    Bookmark  
  48. Characterizing generics are material inference tickets: a proof-theoretic analysis.Preston Stovall - 2019 - Inquiry: An Interdisciplinary Journal of Philosophy (5):668-704.
    An adequate semantics for generic sentences must stake out positions across a range of contested territory in philosophy and linguistics. For this reason the study of generic sentences is a venue for investigating different frameworks for understanding human rationality as manifested in linguistic phenomena such as quantification, classification of individuals under kinds, defeasible reasoning, and intensionality. Despite the wide variety of semantic theories developed for generic sentences, to date these theories have been almost universally model-theoretic and representational. This essay outlines (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  49. The Reasonable and the Relevant: Legal Standards of Proof.Georgi Gardiner - 2019 - Philosophy and Public Affairs 47 (3):288-318.
    According to a common conception of legal proof, satisfying a legal burden requires establishing a claim to a numerical threshold. Beyond reasonable doubt, for example, is often glossed as 90% or 95% likelihood given the evidence. Preponderance of evidence is interpreted as meaning at least 50% likelihood given the evidence. In light of problems with the common conception, I propose a new ‘relevant alternatives’ framework for legal standards of proof. Relevant alternative accounts of knowledge state that a person (...)
    Download  
     
    Export citation  
     
    Bookmark   39 citations  
  50. Prove it! The Burden of Proof Game in Science vs. Pseudoscience Disputes.Massimo Pigliucci & Maarten Boudry - 2014 - Philosophia 42 (2):487-502.
    The concept of burden of proof is used in a wide range of discourses, from philosophy to law, science, skepticism, and even in everyday reasoning. This paper provides an analysis of the proper deployment of burden of proof, focusing in particular on skeptical discussions of pseudoscience and the paranormal, where burden of proof assignments are most poignant and relatively clear-cut. We argue that burden of proof is often misapplied or used as a mere rhetorical gambit, with (...)
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
1 — 50 / 996