Results for 'Provability '

83 found
Order:
  1. 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  
  2. 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. Springer. pp. 31-42.
    In this paper the system IL for relative interpretability is studied.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  3. 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  
  4. (1 other version)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  
  5. Provability with Minimal Type Theory.P. 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  
  6. 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   23 citations  
  7. 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  
  8. 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   1 citation  
  9.  80
    Why there can be no mathematical or meta-mathematical proof of consistency for ZF.Bhupinder Singh Anand - manuscript
    In the first part of this investigation we highlight two, seemingly irreconcilable, beliefs that suggest an impending crisis in the teaching, research, and practice of—primarily state-supported—mathematics: (a) the belief, with increasing, essentially faith-based, conviction and authority amongst academics that first-order Set Theory can be treated as the lingua franca of mathematics, since its theorems—even if unfalsifiable—can be treated as ‘knowledge’ because they are finite proof sequences which are entailed finitarily by self-evidently Justified True Beliefs; and (b) the slowly emerging, but (...)
    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.P. 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. 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   7 citations  
  14. 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   9 citations  
  15. 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   1 citation  
  16. 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  
  17. 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   2 citations  
  18. 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  
  19. Efficient Metamathematics. Rineke - 1993 - Dissertation, Universiteit van Amsterdam
    Download  
     
    Export citation  
     
    Bookmark  
  20. 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  
  21. 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   9 citations  
  22. 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  
  23. 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  
  24. 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  
  25. 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  
  26. A cut-free sequent calculus for the bi-intuitionistic logic 2Int.Sara Ayhan - manuscript
    The purpose of this paper is to introduce a bi-intuitionistic sequent calculus and to give proofs of admissibility for its structural rules. The calculus I will present, called SC2Int, is a sequent calculus for the bi-intuitionistic logic 2Int, which Wansing presents in [2016a]. There he also gives a natural deduction system for this logic, N2Int, to which SC2Int is equivalent in terms of what is derivable. What is important is that these calculi represent a kind of bilateralist reasoning, since they (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  27. 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  
  28. 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  
  29. 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   2 citations  
  30. 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  
  31. Infinity, Choice, and Hume's Principle.Stephen Mackereth - forthcoming - Journal of Philosophical Logic.
    It has long been known that in the context of axiomatic second-order logic (SOL), Hume's Principle (HP) is mutually interpretable with "the universe is Dedekind infinite" (DI). I offer a more fine-grained analysis of the logical strength of HP, measured by deductive implications rather than interpretability. The main result is that HP is not deductively conservative over SOL + DI. That is, SOL + HP proves additional theorems in the language of pure second-order logic that are not provable from SOL (...)
    Download  
     
    Export citation  
     
    Bookmark  
  32. 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  
  33. 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  
  34. 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  
  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. 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   3 citations  
  37. Nelsons Kritik der Erkenntnistheorie und ihre Konsequenzen.Kay Herrmann - 1999 - In Wolfram Hogrebe Kay Herrmann (ed.), Jakob Friedrich Fries – Philosoph, Naturwissenschaftler und Mathematiker. Verhandlungen des Symposions „Probleme und Perspektiven von Jakob Friedrich Fries’ Erkenntnislehre und Naturphilosophie“ vom 9. bis 11. Oktober 1997 an der Friedrich-Schiller-Univer. Peter Lang. pp. 353–368.
    Nelson's Proof of the Impossibility of the Theory of Knowledge -/- In addressing the possibility of a theory of knowledge, Leonard Nelson noted the contradiction of an epistemological criterion that one would require in order to differentiate between valid and invalid knowledge. Nelson concluded that the inconsistency of such a criterion proves the impossibility of the theory of knowledge. -/- Had the epistemological criterion had a perception, then it would presume to adjudicate on its own truth (thus epistemological circular argument). (...)
    Download  
     
    Export citation  
     
    Bookmark  
  38. A Note on Paradoxical Propositions from an Inferential Point of View.Ivo Pezlar - 2021 - In Martin Blicha & Igor Sedlár (eds.), The Logica Yearbook 2020. College Publications. pp. 183-199.
    In a recent paper by Tranchini (Topoi, 2019), an introduction rule for the paradoxical proposition ρ∗ that can be simultaneously proven and disproven is discussed. This rule is formalized in Martin-Löf’s constructive type theory (CTT) and supplemented with an inferential explanation in the style of Brouwer-Heyting-Kolmogorov semantics. I will, however, argue that the provided formalization is problematic because what is paradoxical about ρ∗ from the viewpoint of CTT is not its provability, but whether it is a proposition at all.
    Download  
     
    Export citation  
     
    Bookmark  
  39. 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  
  40. Proving Induction.Alexander Paseau - 2011 - Australasian Journal of Logic 10:1-17.
    The hard problem of induction is to argue without begging the question that inductive inference, applied properly in the proper circumstances, is conducive to truth. A recent theorem seems to show that the hard problem has a deductive solution. The theorem, provable in ZFC, states that a predictive function M exists with the following property: whatever world we live in, M ncorrectly predicts the world’s present state given its previous states at all times apart from a well-ordered subset. On the (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  41. 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  
  42. 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  
  43. A Formal Theory of Substances, Qualities, and Universals.Fabian Neuhaus, Pierre Grenon & Barry Smith - 2004 - In Achille C. 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   9 citations  
  44. The global/local distinction vindicates Leibniz's theodicy.James Franklin - 2022 - Theology and Science 20 (4).
    The essential idea of Leibniz’s Theodicy was little understood in his time but has become one of the organizing themes of modern mathematics. There are many phenomena that are possible locally but for purely mathematical reasons impossible globally. For example, it is possible to build a spiral staircase that is rising at any given point, but it is impossible to build one that is rising at all points and comes back to where it started. The necessity is mathematically provable, so (...)
    Download  
     
    Export citation  
     
    Bookmark  
  45.  48
    Holy Quran approach to the ethics of belief.Seyedsaber Seyedi Fazlollahi - 2015 - International Academic Journal of Humanities 2 (Humanities):67-71.
    Due to the shortage comprehensive study about the ethics of belief in the Quran, This study will provide a detailed understanding based on the concepts of the Quran. Numerous books and articles have been written criticizing and defending the ethics of belief, these are three categories: critical for the basics, criticism of the method and reasoning process and criticism of the results. Some of these criticisms like fideism and irrational religious beliefs are not accepted. Maximum rationality, that Clifford believes, is (...)
    Download  
     
    Export citation  
     
    Bookmark  
  46. Modal collapse in Gödel's ontological proof.Srećko Kovač - 2012 - In Miroslaw Szatkowski (ed.), Ontological Proofs Today. Ontos Verlag. pp. 50--323.
    After introductory reminder of and comments on Gödel’s ontological proof, we discuss the collapse of modalities, which is provable in Gödel’s ontological system GO. We argue that Gödel’s texts confirm modal collapse as intended consequence of his ontological system. Further, we aim to show that modal collapse properly fits into Gödel’s philosophical views, especially into his ontology of separation and union of force and fact, as well as into his cosmological theory of the nonobjectivity of the lapse of time. As (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  47. Rosenkranz’s Logic of Justification and Unprovability.Jan Heylen - 2020 - Journal of Philosophical Logic 49 (6):1243-1256.
    Rosenkranz has recently proposed a logic for propositional, non-factive, all-things-considered justification, which is based on a logic for the notion of being in a position to know, 309–338 2018). Starting from three quite weak assumptions in addition to some of the core principles that are already accepted by Rosenkranz, I prove that, if one has positive introspective and modally robust knowledge of the axioms of minimal arithmetic, then one is in a position to know that a sentence is not provable (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  48. 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  
  49. Modality and Function: Reply to Nanay.Osamu Kiritani - 2011 - Journal of Mind and Behavior 32 (2):89-90.
    This paper replies to Nanay’s response to my recent paper. My suggestions are the following. First, “should” or “ought” does not need to be deontic. Second, etiological theories of function, like provability logic, do not need to attribute modal force to their explanans. Third, the explanans of the homological account of trait type individuation does not appeal to a trait’s etiological function, that is, what a trait should or ought to do. Finally, my reference to Cummins’s notion of function (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  50. A Mathematical Model of Quantum Computer by Both Arithmetic and Set Theory.Vasil Penchev - 2020 - Information Theory and Research eJournal 1 (15):1-13.
    A practical viewpoint links reality, representation, and language to calculation by the concept of Turing (1936) machine being the mathematical model of our computers. After the Gödel incompleteness theorems (1931) or the insolvability of the so-called halting problem (Turing 1936; Church 1936) as to a classical machine of Turing, one of the simplest hypotheses is completeness to be suggested for two ones. That is consistent with the provability of completeness by means of two independent Peano arithmetics discussed in Section (...)
    Download  
     
    Export citation  
     
    Bookmark  
1 — 50 / 83