Results for 'Provability '

87 found
Order:
  1. Provability logics for relative interpretability.Frank Veltman & Dick De Jongh - 1990 - In Petio Petrov Petkov (ed.), Mathematical Logic. Proceedings of the Heyting '88 Summer School. New York, NY, USA: pp. 31-42.
    In this paper the system IL for relative interpretability is studied.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  2. On the provability logic of bounded arithmetic.Rineke Verbrugge & Alessandro Berarducci - 1991 - Annals of Pure and Applied Logic 61 (1-2):75-93.
    Let PLω be the provability logic of IΔ0 + ω1. We prove some containments of the form L ⊆ PLω < Th(C) where L is the provability logic of PA and Th(C) is a suitable class of Kripke frames.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  3. Truth and provability: A comment on Redhead.Panu Raatikainen - 2005 - British Journal for the Philosophy of Science 56 (3):611-613.
    Michael Redhead's recent argument aiming to show that humanly certifiable truth outruns provability is critically evaluated. It is argued that the argument is at odds with logical facts and fails.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  4. Note on Absolute Provability and Cantorian Comprehension.Holger A. Leuz - manuscript
    We will explicate Cantor’s principle of set existence using the Gödelian intensional notion of absolute provability and John Burgess’ plural logical concept of set formation. From this Cantorian Comprehension principle we will derive a conditional result about the question whether there are any absolutely unprovable mathematical truths. Finally, we will discuss the philosophical significance of the conditional result.
    Download  
     
    Export citation  
     
    Bookmark  
  5. Truth, Conservativeness, and Provability.Cezary Cieśliński - 2010 - Mind 119 (474):409-422.
    Conservativeness has been proposed as an important requirement for deflationary truth theories. This in turn gave rise to the so-called ‘conservativeness argument’ against deflationism: a theory of truth which is conservative over its base theory S cannot be adequate, because it cannot prove that all theorems of S are true. In this paper we show that the problems confronting the deflationist are in fact more basic: even the observation that logic is true is beyond his reach. This seems to conflict (...)
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  6. Provability with Minimal Type Theory.Pete Olcott - manuscript
    Minimal Type Theory (MTT) shows exactly how all of the constituent parts of an expression relate to each other (in 2D space) when this expression is formalized using a directed acyclic graph (DAG). This provides substantially greater expressiveness than the 1D space of FOPL syntax. -/- The increase in expressiveness over other formal systems of logic shows the Pathological Self-Reference Error of expressions previously considered to be sentences of formal systems. MTT shows that these expressions were never truth bearers, thus (...)
    Download  
     
    Export citation  
     
    Bookmark  
  7. Truth and provability again.Jeffrey Ketland & Panu Raatikainen - manuscript
    Lucas and Redhead ([2007]) announce that they will defend the views of Redhead ([2004]) against the argument by Panu Raatikainen ([2005]). They certainly re-state the main claims of Redhead ([2004]), but they do not give any real arguments in their favour, and do not provide anything that would save Redhead’s argument from the serious problems pointed out in (Raatikainen [2005]). Instead, Lucas and Redhead make a number of seemingly irrelevant points, perhaps indicating a failure to understand the logico-mathematical points at (...)
    Download  
     
    Export citation  
     
    Bookmark  
  8. Constructivism, intersubjectivity, provability, and triviality.Andrea Guardo - 2019 - International Journal of Philosophical Studies 27 (4):515-527.
    Sharon Street defines her constructivism about practical reasons as the view that whether something is a reason to do a certain thing for a given agent depends on that agent’s normative point of view. However, Street has also maintained that there is a judgment about practical reasons which is true relative to every possible normative point of view, namely constructivism itself. I show that the latter thesis is inconsistent with Street’s own constructivism about epistemic reasons and discuss some consequences of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  9. Solutions to the Knower Paradox in the Light of Haack’s Criteria.Mirjam de Vos, Rineke Verbrugge & Barteld Kooi - 2023 - Journal of Philosophical Logic 52 (4):1101-1132.
    The knower paradox states that the statement ‘We know that this statement is false’ leads to inconsistency. This article presents a fresh look at this paradox and some well-known solutions from the literature. Paul Égré discusses three possible solutions that modal provability logic provides for the paradox by surveying and comparing three different provability interpretations of modality, originally described by Skyrms, Anderson, and Solovay. In this article, some background is explained to clarify Égré’s solutions, all three of which (...)
    Download  
     
    Export citation  
     
    Bookmark  
  10. Statements and open problems on decidable sets X⊆N that contain informal notions and refer to the current knowledge on X.Apoloniusz Tyszka - 2022 - Journal of Applied Computer Science and Mathematics 16 (2):31-35.
    Let f(1)=2, f(2)=4, and let f(n+1)=f(n)! for every integer n≥2. Edmund Landau's conjecture states that the set P(n^2+1) of primes of the form n^2+1 is infinite. Landau's conjecture implies the following unproven statement Φ: card(P(n^2+1))<ω ⇒ P(n^2+1)⊆[2,f(7)]. Let B denote the system of equations: {x_j!=x_k: i,k∈{1,...,9}}∪{x_i⋅x_j=x_k: i,j,k∈{1,...,9}}. The system of equations {x_1!=x_1, x_1 \cdot x_1=x_2, x_2!=x_3, x_3!=x_4, x_4!=x_5, x_5!=x_6, x_6!=x_7, x_7!=x_8, x_8!=x_9} has exactly two solutions in positive integers x_1,...,x_9, namely (1,...,1) and (f(1),...,f(9)). No known system S⊆B with a finite (...)
    Download  
     
    Export citation  
     
    Bookmark  
  11. Proofs, necessity and causality.Srećko Kovač - 2019 - In Enrique Alonso, Antonia Huertas & Andrei Moldovan (eds.), Aventuras en el Mundo de la Lógica: Ensayos en Honor a María Manzano. College Publications. pp. 239-263.
    There is a long tradition of logic, from Aristotle to Gödel, of understanding a proof from the concepts of necessity and causality. Gödel's attempts to define provability in terms of necessity led him to the distinction of formal and absolute (abstract) provability. Turing's definition of mechanical procedure by means of a Turing machine (TM) and Gödel's definition of a formal system as a mechanical procedure for producing formulas prompt us to understand formal provability as a mechanical causality. (...)
    Download  
     
    Export citation  
     
    Bookmark  
  12. Eliminating Undecidability and Incompleteness in Formal Systems.Pete Olcott - manuscript
    To eliminate incompleteness, undecidability and inconsistency from formal systems we only need to convert the formal proofs to theorem consequences of symbolic logic to conform to the sound deductive inference model. -/- Within the sound deductive inference model there is a (connected sequence of valid deductions from true premises to a true conclusion) thus unlike the formal proofs of symbolic logic provability cannot diverge from truth.
    Download  
     
    Export citation  
     
    Bookmark  
  13. Classicism.Andrew Bacon & Cian Dorr - 2024 - In Peter Fritz & Nicholas K. Jones (eds.), Higher-Order Metaphysics. Oxford University Press. pp. 109-190.
    This three-part chapter explores a higher-order logic we call ‘Classicism’, which extends a minimal classical higher-order logic with further axioms which guarantee that provable coextensiveness is sufficient for identity. The first part presents several different ways of axiomatizing this theory and makes the case for its naturalness. The second part discusses two kinds of extensions of Classicism: some which take the view in the direction of coarseness of grain (whose endpoint is the maximally coarse-grained view that coextensiveness is sufficient for (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  14. Self-referential theories.Samuel A. Alexander - 2020 - Journal of Symbolic Logic 85 (4):1687-1716.
    We study the structure of families of theories in the language of arithmetic extended to allow these families to refer to one another and to themselves. If a theory contains schemata expressing its own truth and expressing a specific Turing index for itself, and contains some other mild axioms, then that theory is untrue. We exhibit some families of true self-referential theories that barely avoid this forbidden pattern.
    Download  
     
    Export citation  
     
    Bookmark  
  15.  46
    A defense of Isaacson’s thesis, or how to make sense of the boundaries of finite mathematics.Pablo Dopico - 2024 - Synthese 203 (2):1-22.
    Daniel Isaacson has advanced an epistemic notion of arithmetical truth according to which the latter is the set of truths that we grasp on the basis of our understanding of the structure of natural numbers alone. Isaacson’s thesis is then the claim that Peano Arithmetic (PA) is the theory of finite mathematics, in the sense that it proves all and only arithmetical truths thus understood. In this paper, we raise a challenge for the thesis and show how it can be (...)
    Download  
     
    Export citation  
     
    Bookmark  
  16. CRITIQUE OF IMPURE REASON: Horizons of Possibility and Meaning.Steven James Bartlett - 2021 - Salem, USA: Studies in Theory and Behavior.
    PLEASE NOTE: This is the corrected 2nd eBook edition, 2021. ●●●●● _Critique of Impure Reason_ has now also been published in a printed edition. To reduce the otherwise high price of this scholarly, technical book of nearly 900 pages and make it more widely available beyond university libraries to individual readers, the non-profit publisher and the author have agreed to issue the printed edition at cost. ●●●●● The printed edition was released on September 1, 2021 and is now available through (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  17. There May Be Many Arithmetical Gödel Sentences.Kaave Lajevardi & Saeed Salehi - 2021 - Philosophia Mathematica 29 (2):278–287.
    We argue that, under the usual assumptions for sufficiently strong arithmetical theories that are subject to Gödel’s First Incompleteness Theorem, one cannot, without impropriety, talk about *the* Gödel sentence of the theory. The reason is that, without violating the requirements of Gödel’s theorem, there could be a true sentence and a false one each of which is provably equivalent to its own unprovability in the theory if the theory is unsound.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  18. Constructive mathematics with the knowledge predicate K satisfied by every currently known theorem.Apoloniusz Tyszka - manuscript
    K denotes both the knowledge predicate satisfied by every currently known theorem and the finite set of all currently known theorems. The set K is time-dependent, publicly available, and contains theorems both from formal and constructive mathematics. Any theorem of any mathematician from past or present forever belongs to K. Mathematical statements with known constructive proofs exist in K separately and form the set K_c⊆K. We assume that mathematical sets are atemporal entities. They exist formally in ZFC theory although their (...)
    Download  
     
    Export citation  
     
    Bookmark  
  19.  69
    Molecularity in the Theory of Meaning and the Topic Neutrality of Logic.Bernhard Weiss & Nils Kürbis - 2024 - In Antonio Piccolomini D'Aragona (ed.), Perspectives on Deduction: Contemporary Studies in the Philosophy, History and Formal Theories of Deduction. Springer Verlag. pp. 187-209.
    Without directly addressing the Demarcation Problem for logic—the problem of distinguishing logical vocabulary from others—we focus on distinctive aspects of logical vocabulary in pursuit of a second goal in the philosophy of logic, namely, proposing criteria for the justification of logical rules. Our preferred approach has three components. Two of these are effectively Belnap’s, but with a twist. We agree with Belnap’s response to Prior’s challenge to inferentialist characterisations of the meanings of logical constants. Belnap argued that for a logical (...)
    Download  
     
    Export citation  
     
    Bookmark  
  20. Efficient Metamathematics. Rineke - 1993 - Dissertation, Universiteit van Amsterdam
    Download  
     
    Export citation  
     
    Bookmark  
  21. Depth Relevance and Hyperformalism.Shay Allen Logan - 2022 - Journal of Philosophical Logic 51 (4):721-737.
    Formal symptoms of relevance usually concern the propositional variables shared between the antecedent and the consequent of provable conditionals. Among the most famous results about such symptoms are Belnap’s early results showing that for sublogics of the strong relevant logic R, provable conditionals share a signed variable between antecedent and consequent. For logics weaker than R stronger variable sharing results are available. In 1984, Ross Brady gave one well-known example of such a result. As a corollary to the main result (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  22. Underestimating the World.Daniel Stoljar - forthcoming - Journal of Consciousness Studies.
    Galen Strawson has contrasting attitudes to consciousness and free will. In the case of the former, he says it is a fundamental element of nature whose denial is the “greatest woo-woo of the human mind.” In the case of the latter, by contrast, he says it is not merely non-existent but “provably impossible.” Why the difference? This paper suggests this distinctive pattern of positions is generated by underestimating the world (to adapt a phrase Strawson uses himself in another context). If (...)
    Download  
     
    Export citation  
     
    Bookmark  
  23. Why Be Random?Thomas Icard - 2021 - Mind 130 (517):111-139.
    When does it make sense to act randomly? A persuasive argument from Bayesian decision theory legitimizes randomization essentially only in tie-breaking situations. Rational behaviour in humans, non-human animals, and artificial agents, however, often seems indeterminate, even random. Moreover, rationales for randomized acts have been offered in a number of disciplines, including game theory, experimental design, and machine learning. A common way of accommodating some of these observations is by appeal to a decision-maker’s bounded computational resources. Making this suggestion both precise (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  24. 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 to (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  25.  81
    What is Perspectivism? Что такое перспективизм?Michael Lewin - 2023 - Research Result. Social Studies and Humanities 9 (3):5-14.
    Since Nietzsche, the term “perspectivism” has been used as the name for an ill-defined epistemological position. Some have tried to find an adequate meaning for the word “perspectivism,” tacitly investing it with a set of different predicates, such as “the dependence of cognition on position,” “pluralism,” “anti-universalism,” “epistemic humility,” etc. This approach is related to two contestable attitudes: the monolateral linguistic paradigm and the metaepistemological position of multiplicity of incompatible epistemological programs. The monolateral linguistic paradigm proceeds from the assumption that (...)
    Download  
     
    Export citation  
     
    Bookmark  
  26. The formal sciences discover the philosophers' stone.James Franklin - 1994 - Studies in History and Philosophy of Science Part A 25 (4):513-533.
    The formal sciences - mathematical as opposed to natural sciences, such as operations research, statistics, theoretical computer science, systems engineering - appear to have achieved mathematically provable knowledge directly about the real world. It is argued that this appearance is correct.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  27. Descriptions and unknowability.Jan Heylen - 2010 - Analysis 70 (1):50-52.
    In a recent paper Horsten embarked on a journey along the limits of the domain of the unknowable. Rather than knowability simpliciter, he considered a priori knowability, and by the latter he meant absolute provability, i.e. provability that is not relativized to a formal system. He presented an argument for the conclusion that it is not absolutely provable that there is a natural number of which it is true but absolutely unprovable that it has a certain property. The (...)
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  28. Uniqueness of Logical Connectives in a Bilateralist Setting.Sara Ayhan - 2021 - In Martin Blicha & Igor Sedlár (eds.), The Logica Yearbook 2020. College Publications. pp. 1-16.
    In this paper I will show the problems that are encountered when dealing with uniqueness of connectives in a bilateralist setting within the larger framework of proof-theoretic semantics and suggest a solution. Therefore, the logic 2Int is suitable, for which I introduce a sequent calculus system, displaying - just like the corresponding natural deduction system - a consequence relation for provability as well as one dual to provability. I will propose a modified characterization of uniqueness incorporating such a (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  29. Modelling Multilateral Negotiation in Linear Logic.Daniele Porello & Ulle Endriss - 2010 - In {ECAI} 2010 - 19th European Conference on Artificial Intelligence, Lisbon, Portugal, August 16-20, 2010, Proceedings. pp. 381--386.
    We show how to embed a framework for multilateral negotiation, in which a group of agents implement a sequence of deals concerning the exchange of a number of resources, into linear logic. In this model, multisets of goods, allocations of resources, preferences of agents, and deals are all modelled as formulas of linear logic. Whether or not a proposed deal is rational, given the preferences of the agents concerned, reduces to a question of provability, as does the question of (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  30. A calculus for Belnap's logic in which each proof consists of two trees.Stefan Wintein & Reinhard Muskens - 2012 - Logique Et Analyse 220:643-656.
    In this paper we introduce a Gentzen calculus for (a functionally complete variant of) Belnap's logic in which establishing the provability of a sequent in general requires \emph{two} proof trees, one establishing that whenever all premises are true some conclusion is true and one that guarantees the falsity of at least one premise if all conclusions are false. The calculus can also be put to use in proving that one statement \emph{necessarily approximates} another, where necessary approximation is a natural (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  31. A philosophical perspective on visualization for digital humanities.Hein Van Den Berg, Arianna Betti, Thom Castermans, Rob Koopman, Bettina Speckmann, K. A. B. Verbeek, Titia Van der Werf, Shenghui Wang & Michel A. Westenberg - 2018 - 3Rd Workshop on Visualization for the Digital Humanities.
    In this position paper, we describe a number of methodological and philosophical challenges that arose within our interdisciplinary Digital Humanities project CatVis, which is a collaboration between applied geometric algorithms and visualization researchers, data scientists working at OCLC, and philosophers who have a strong interest in the methodological foundations of visualization research. The challenges we describe concern aspects of one single epistemic need: that of methodologically securing (an increase in) trust in visualizations. We discuss the lack of ground truths in (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  32. Incommensurability and the Bonfire of the Meta-Theories: Response to Mizrahi.Lydia Patton - 2015 - Social Epistemology Review and Reply Collective 4 (7):51-58.
    Scientists working within a paradigm must play by the rules of the game of that paradigm in solving problems, and that is why incommensurability arises when the rules of the game change. If we deny the thesis of the priority of paradigms, then there is no good argument for the incommensurability of theories and thus for taxonomic incommensurability, because there is no invariant way to determine the set of results provable, puzzles solvable, and propositions cogently formulable under a given paradigm.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  33. Mad Speculation and Absolute Inhumanism: Lovecraft, Ligotti, and the Weirding of Philosophy.Ben Woodard - 2011 - Continent 1 (1):3-13.
    continent. 1.1 : 3-13. / 0/ – Introduction I want to propose, as a trajectory into the philosophically weird, an absurd theoretical claim and pursue it, or perhaps more accurately, construct it as I point to it, collecting the ground work behind me like the Perpetual Train from China Mieville's Iron Council which puts down track as it moves reclaiming it along the way. The strange trajectory is the following: Kant's critical philosophy and much of continental philosophy which has followed, (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  34.  62
    Effective Procedures.Nathan Salmon - 2023 - Philosophies 8 (2):27.
    This is a non-technical version of "The Decision Problem for Effective Procedures." The “somewhat vague, intuitive” notion from computability theory of an effective procedure (method) or algorithm can be fairly precisely defined, even if it does not have a purely mathematical definition—and even if (as many have asserted) for that reason, the Church–Turing thesis (that the effectively calculable functions on natural numbers are exactly the general recursive functions), cannot be proved. However, it is logically provable from the notion of an (...)
    Download  
     
    Export citation  
     
    Bookmark  
  35. Hume’s Fork and Mixed Mathematics.Matias Slavov - 2017 - Archiv für Geschichte der Philosophie 99 (1):102-119.
    Given the sharp distinction that follows from Hume’s Fork, the proper epistemic status of propositions of mixed mathematics seems to be a mystery. On the one hand, mathematical propositions concern the relation of ideas. They are intuitive and demonstratively certain. On the other hand, propositions of mixed mathematics, such as in Hume’s own example, the law of conservation of momentum, are also matter of fact propositions. They concern causal relations between species of objects, and, in this sense, they are not (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  36. Counterfactual Logic and the Necessity of Mathematics.Samuel Elgin - manuscript
    This paper is concerned with counterfactual logic and its implications for the modal status of mathematical claims. It is most directly a response to an ambitious program by Yli-Vakkuri and Hawthorne (2018), who seek to establish that mathematics is committed to its own necessity. I claim that their argument fails to establish this result for two reasons. First, their assumptions force our hand on a controversial debate within counterfactual logic. In particular, they license counterfactual strengthening— the inference from ‘If A (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  37. Objective Fundamental Reality Structure by the Unreduced Complexity Development.Andrei P. Kirilyuk - 2018 - FQXi Essay Contest 2017-2018 “What Is “Fundamental””.
    We explain why exactly the simplified abstract scheme of reality within the standard science paradigm cannot provide the consistent picture of “truly fundamental” reality and how the unreduced, causally complete description of the latter is regained within the extended, provably complete solution to arbitrary interaction problem and the ensuing concept of universal dynamic complexity. We emphasize the practical importance of this extension for both particular problem solution and further, now basically unlimited fundamental science development (otherwise dangerously stagnating within its traditional (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  38.  68
    Base-extension Semantics for Modal Logic.Eckhardt Timo & Pym David - forthcoming - Logic Journal of the IGPL.
    In proof-theoretic semantics, meaning is based on inference. It may be seen as the mathematical expression of the inferentialist interpretation of logic. Much recent work has focused on base-extension semantics, in which the validity of formulas is given by an inductive definition generated by provability in a ‘base’ of atomic rules. Base-extension semantics for classical and intuitionistic propositional logic have been explored by several authors. In this paper, we develop base-extension semantics for the classical propositional modal systems K, KT (...)
    Download  
     
    Export citation  
     
    Bookmark  
  39. On the Arithmetical Truth of Self‐Referential Sentences.Kaave Lajevardi & Saeed Salehi - 2019 - Theoria 85 (1):8-17.
    We take an argument of Gödel's from his ground‐breaking 1931 paper, generalize it, and examine its validity. The argument in question is this: "the sentence G says about itself that it is not provable, and G is indeed not provable; therefore, G is true".
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  40. A Formal Theory of Substances, Qualities, and Universals.Fabian Neuhaus, Pierre Grenon & Barry Smith - 2004 - In Achille Varzi & Laure Vieu (eds.), Formal Ontology in Information Systems. Proceedings of the Third International Conference. IOS Press.
    One of the tasks of ontology in information science is to support the classification of entities according to their kinds and qualities. We hold that to realize this task as far as entities such as material objects are concerned we need to distinguish four kinds of entities: substance particulars, quality particulars, substance universals, and quality universals. These form, so to speak, an ontological square. We present a formal theory of classification based on this idea, including both a semantics for the (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  41. Epsilon theorems in intermediate logics.Matthias Baaz & Richard Zach - 2022 - Journal of Symbolic Logic 87 (2):682-720.
    Any intermediate propositional logic can be extended to a calculus with epsilon- and tau-operators and critical formulas. For classical logic, this results in Hilbert’s $\varepsilon $ -calculus. The first and second $\varepsilon $ -theorems for classical logic establish conservativity of the $\varepsilon $ -calculus over its classical base logic. It is well known that the second $\varepsilon $ -theorem fails for the intuitionistic $\varepsilon $ -calculus, as prenexation is impossible. The paper investigates the effect of adding critical $\varepsilon $ - (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  42. The species problem and its logic: Inescapable ambiguity and framework-relativity.Steven James Bartlett - 2015 - Willamette University Faculty Research Website, ArXiv.Org, and Cogprints.Org.
    For more than fifty years, taxonomists have proposed numerous alternative definitions of species while they searched for a unique, comprehensive, and persuasive definition. This monograph shows that these efforts have been unnecessary, and indeed have provably been a pursuit of a will o’ the wisp because they have failed to recognize the theoretical impossibility of what they seek to accomplish. A clear and rigorous understanding of the logic underlying species definition leads both to a recognition of the inescapable ambiguity that (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  43. Existence Assumptions and Logical Principles: Choice Operators in Intuitionistic Logic.Corey Edward Mulvihill - 2015 - Dissertation, University of Waterloo
    Hilbert’s choice operators τ and ε, when added to intuitionistic logic, strengthen it. In the presence of certain extensionality axioms they produce classical logic, while in the presence of weaker decidability conditions for terms they produce various superintuitionistic intermediate logics. In this thesis, I argue that there are important philosophical lessons to be learned from these results. To make the case, I begin with a historical discussion situating the development of Hilbert’s operators in relation to his evolving program in the (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  44. Kurt Gödel, paper on the incompleteness theorems (1931).Richard Zach - 2004 - In Ivor Grattan-Guinness (ed.), Landmark Writings in Mathematics. North-Holland. pp. 917-925.
    This chapter describes Kurt Gödel's paper on the incompleteness theorems. Gödel's incompleteness results are two of the most fundamental and important contributions to logic and the foundations of mathematics. It had been assumed that first-order number theory is complete in the sense that any sentence in the language of number theory would be either provable from the axioms or refutable. Gödel's first incompleteness theorem showed that this assumption was false: it states that there are sentences of number theory that are (...)
    Download  
     
    Export citation  
     
    Bookmark  
  45. Philosophy of Logic – Reexamining the Formalized Notion of Truth.Pete Olcott - manuscript
    Tarski "proved" that there cannot possibly be any correct formalization of the notion of truth entirely on the basis of an insufficiently expressive formal system that was incapable of recognizing and rejecting semantically incorrect expressions of language. -/- The only thing required to eliminate incompleteness, undecidability and inconsistency from formal systems is transforming the formal proofs of symbolic logic to use the sound deductive inference model.
    Download  
     
    Export citation  
     
    Bookmark  
  46. A small reflection principle for bounded arithmetic.Rineke Verbrugge & Albert Visser - 1994 - Journal of Symbolic Logic 59 (3):785-812.
    We investigate the theory IΔ 0 + Ω 1 and strengthen [Bu86. Theorem 8.6] to the following: if NP ≠ co-NP. then Σ-completeness for witness comparison formulas is not provable in bounded arithmetic. i.e. $I\delta_0 + \Omega_1 + \nvdash \forall b \forall c (\exists a(\operatorname{Prf}(a.c) \wedge \forall = \leq a \neg \operatorname{Prf} (z.b))\\ \rightarrow \operatorname{Prov} (\ulcorner \exists a(\operatorname{Prf}(a. \bar{c}) \wedge \forall z \leq a \neg \operatorname{Prf}(z.\bar{b})) \urcorner)).$ Next we study a "small reflection principle" in bounded arithmetic. We prove that for (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  47. “The Rejection of Radical-Foundationalism and -Skepticism: Pragmatic Belief in God in Eliezer Berkovits’s Thought” [in Hebrew].Nadav Berman, S. - 2019 - Journal of the Goldstein-Goren International Center for Jewish Thought 1:201-246.
    Faith has many aspects. One of them is whether absolute logical proof for God’s existence is a prerequisite for the proper establishment and individual acceptance of a religious system. The treatment of this question, examined here in the Jewish context of Rabbi Prof. Eliezer Berkovits, has been strongly influenced in the modern era by the radical foundationalism and radical skepticism of Descartes, who rooted in the Western mind the notion that religion and religious issues are “all or nothing” questions. Cartesianism, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  48. Paradoxes of Demonstrability.Sten Lindström - 2009 - In Lars-Göran Johansson, Jan Österberg & Ryszard Sliwinski (eds.), Logic, Ethics and all that Jazz: Essays in Honour of Jordan Howard Sobel. Uppsala, Sverige: pp. 177-185.
    In this paper I consider two paradoxes that arise in connection with the concept of demonstrability, or absolute provability. I assume—for the sake of the argument—that there is an intuitive notion of demonstrability, which should not be conflated with the concept of formal deducibility in a (formal) system or the relativized concept of provability from certain axioms. Demonstrability is an epistemic concept: the rough idea is that a sentence is demonstrable if it is provable from knowable basic (“self-evident”) (...)
    Download  
     
    Export citation  
     
    Bookmark  
  49. Logic for Lunatics.Gregory Wheeler - manuscript
    A sound and complete axiomatization of two tabloid blogs is presented, Leiter Logic (KB) and Deontic Leiter Logic (KDB), the latter of which can be extended to Shame Game Logic for multiple agents. The (B) schema describes the mechanism behind this class of tabloids, and illustrates the perils of interpreting a provability operator as an epistemic modal. To mark this difference, and to avoid sullying Brouwer's good name, the (B) schema for epistemic modals should be called the Blog Schema.
    Download  
     
    Export citation  
     
    Bookmark  
  50. On a certain fallacy concerning I-am-unprovable sentences.Kaave Lajevardi & Saeed Salehi - manuscript
    We demonstrate that, in itself and in the absence of extra premises, the following argument scheme is fallacious: The sentence A says about itself that it has a property F, and A does in fact have the property F; therefore A is true. We then examine an argument of this form in the informal introduction of Gödel’s classic (1931) and examine some auxiliary premises which might have been at work in that context. Philosophically significant as it may be, that particular (...)
    Download  
     
    Export citation  
     
    Bookmark  
1 — 50 / 87