Switch to: References

Add citations

You must login to add citations.
  1. The Significance of Evidence-based Reasoning for Mathematics, Mathematics Education, Philosophy and the Natural Sciences.Bhupinder Singh Anand - forthcoming
    In this multi-disciplinary investigation we show how an evidence-based perspective of quantification---in terms of algorithmic verifiability and algorithmic computability---admits evidence-based definitions of well-definedness and effective computability, which yield two unarguably constructive interpretations of the first-order Peano Arithmetic PA---over the structure N of the natural numbers---that are complementary, not contradictory. The first yields the weak, standard, interpretation of PA over N, which is well-defined with respect to assignments of algorithmically verifiable Tarskian truth values to the formulas of PA under the interpretation. (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • En quoi la crise des fondements des mathématiques est-elle terminée?Emmanuel Barot - 2005 - Philosophia Scientiae 9 (2):23-39.
    La « crise » des fondements des mathématiques (1902-1931) fut l’agent de l’avènement du paradigme axiomatico-ensembliste dans lequel la plupart des tensions et stratégies fondationnelles continuent d’être formulées. Au terme d’une synthèse de ces interrogations et de leurs traductions techniques, qui suit le fil conducteur de l’opposition constructif / non-constructif, on montre quelques-unes des subversions, encore minoritaires, que subit ce paradigme. On insiste alors sur les voies possibles de son dépassement, en pointant l’essoufflement conceptuel qui transparaît derrière le dynamisme de (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
    		•
  • Gaps, gluts, and theoretical equivalence.Carlo Nicolai - 2022 - Synthese 200 (5):1-22.
    When are two formal theories of broadly logical concepts, such as truth, equivalent? The paper investigates a case study, involving two well-known variants of Kripke–Feferman truth. The first, \, features a consistent but partial truth predicate. The second, \, an inconsistent but complete truth predicate. It is known that the two truth predicates are dual to each other. We show that this duality reveals a much stricter correspondence between the two theories: they are intertraslatable. Intertranslatability, under natural assumptions, coincides with (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
    		•
  • Between Pathology and Well-Behaviour – A Possible Foundation for Tame Mathematics.Angelo-Vlad Moldovan - 2022 - Studia Universitatis Babeş-Bolyai Philosophia 67 (Special Issue):67-81.
    "An in-depth examination of the foundations of mathematics reveals how its treatment is centered around the topic of “unique foundation vs. no need for a foundation” in a traditional setting. In this paper, I show that by applying Shelah’s stability procedures to mathematics, we confine ourselves to a certain section that manages to escape the Gödel phenomenon and can be classified. We concentrate our attention on this mainly because of its tame nature. This result makes way for a new approach (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
    		•
  • A natural axiomatization of computability and proof of Church’s thesis.Nachum Dershowitz & Yuri Gurevich - 2008 - Bulletin of Symbolic Logic 14 (3):299-350.
    Church's Thesis asserts that the only numeric functions that can be calculated by effective means are the recursive ones, which are the same, extensionally, as the Turing-computable numeric functions. The Abstract State Machine Theorem states that every classical algorithm is behaviorally equivalent to an abstract state machine. This theorem presupposes three natural postulates about algorithmic computation. Here, we show that augmenting those postulates with an additional requirement regarding basic operations gives a natural axiomatization of computability and a proof of Church's (...)
    Direct download (11 more)  
     
    Export citation  
     
    Bookmark   20 citations  
  • When are two algorithms the same?Andreas Blass, Nachum Dershowitz & Yuri Gurevich - 2009 - Bulletin of Symbolic Logic 15 (2):145-168.
    People usually regard algorithms as more abstract than the programs that implement them. The natural way to formalize this idea is that algorithms are equivalence classes of programs with respect to a suitable equivalence relation. We argue that no such equivalence relation exists.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  • On the correspondence between arithmetic theories and propositional proof systems – a survey.Olaf Beyersdorff - 2009 - Mathematical Logic Quarterly 55 (2):116-137.
    The purpose of this paper is to survey the correspondence between bounded arithmetic and propositional proof systems. In addition, it also contains some new results which have appeared as an extended abstract in the proceedings of the conference TAMC 2008 [11].Bounded arithmetic is closely related to propositional proof systems; this relation has found many fruitful applications. The aim of this paper is to explain and develop the general correspondence between propositional proof systems and arithmetic theories, as introduced by Krajíček and (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • The Dividing Line Methodology: Model Theory Motivating Set Theory.John T. Baldwin - 2021 - Theoria 87 (2):361-393.
    We explore Shelah's model‐theoretic dividing line methodology. In particular, we discuss how problems in model theory motivated new techniques in model theory, for example classifying theories by their potential (consistently with Zermelo–Fraenkel set theory with the axiom of choice (ZFC)) spectrum of cardinals in which there is a universal model. Two other examples are the study (with Malliaris) of the Keisler order leading to a new ZFC result on cardinal invariants and attempts to clarify the “main gap” by reducing the (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  • La lógica matemática: una disciplina en busca de encuadre.José Ferreirós - 2010 - Theoria 25 (3):279-299.
    We offer an analysis of the disciplinary transformations underwent by mathematical or symbolic logic since its emergence in the late 19 th century. Examined are its origins as a hybrid of philosophy and mathematics, the maturity and institutionalisation attained under the label “logic and foundations,” a second wave of institutionalisation in the Postwar period, and the institutional developments since 1975 in connection with computer science and with the study of language and informatics. Although some “internal history” is discussed, the main (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Gaps, Gluts, and Theoretical Equivalence.Carlo Nicolai - manuscript
    When are two formal theories of broadly logical concepts, such as truth, equivalent? The paper investigates a case study, involving two well-known variants Kripke-Feferman truth. The first, KF+CONS, features a consistent but partial truth predicate. The second, KF+COMP, an inconsistent but complete truth predicate. It is well-known that the two truth predicates are dual to each other. We show that this duality reveals a much stricter correspondence between the two theories: they are intertraslatable. Intertranslatability under natural assumptions coincides with definitional (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
    		•