Switch to: References

Add citations

You must login to add citations.
  1. Logic of informal provability with truth values.Pawel Pawlowski & Rafal Urbaniak - 2023 - Logic Journal of the IGPL 31 (1):172-193.
    Classical logic of formal provability includes Löb’s theorem, but not reflection. In contrast, intuitions about the inferential behavior of informal provability (in informal mathematics) seem to invalidate Löb’s theorem and validate reflection (after all, the intuition is, whatever mathematicians prove holds!). We employ a non-deterministic many-valued semantics and develop a modal logic T-BAT of an informal provability operator, which indeed does validate reflection and invalidates Löb’s theorem. We study its properties and its relation to known provability-related paradoxical arguments. We also (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Proof systems for BAT consequence relations.Pawel Pawlowski - 2018 - Logic Journal of the IGPL 26 (1):96-108.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Frameworks, models, and case studies: a new methodology for studying conceptual change in science and philosophy.Matteo De Benedetto - 2022 - Dissertation, Ludwig Maximilians Universität, München
    This thesis focuses on models of conceptual change in science and philosophy. In particular, I developed a new bootstrapping methodology for studying conceptual change, centered around the formalization of several popular models of conceptual change and the collective assessment of their improved formal versions via nine evaluative dimensions. Among the models of conceptual change treated in the thesis are Carnap’s explication, Lakatos’ concept-stretching, Toulmin’s conceptual populations, Waismann’s open texture, Mark Wilson’s patches and facades, Sneed’s structuralism, and Paul Thagard’s conceptual revolutions. (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Mathematical Inference and Logical Inference.Yacin Hamami - 2018 - Review of Symbolic Logic 11 (4):665-704.
    The deviation of mathematical proof—proof in mathematical practice—from the ideal of formal proof—proof in formal logic—has led many philosophers of mathematics to reconsider the commonly accepted view according to which the notion of formal proof provides an accurate descriptive account of mathematical proof. This, in turn, has motivated a search for alternative accounts of mathematical proof purporting to be more faithful to the reality of mathematical practice. Yet, in order to develop and evaluate such alternative accounts, it appears as a (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Informal provability and dialetheism.Pawel Pawlowski & Rafal Urbaniak - 2023 - Theoria 89 (2):204-215.
    According to the dialetheist argument from the inconsistency of informal mathematics, the informal version of the Gödelian argument leads us to a true contradiction. On one hand, the dialetheist argues, we can prove that there is a mathematical claim that is neither provable nor refutable in informal mathematics. On the other, the proof of its unprovability is given in informal mathematics and proves that very sentence. We argue that the argument fails, because it relies on the unjustified and unlikely assumption (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Explication as a Three-Step Procedure: the case of the Church-Turing Thesis.Matteo De Benedetto - 2021 - European Journal for Philosophy of Science 11 (1):1-28.
    In recent years two different axiomatic characterizations of the intuitive concept of effective calculability have been proposed, one by Sieg and the other by Dershowitz and Gurevich. Analyzing them from the perspective of Carnapian explication, I argue that these two characterizations explicate the intuitive notion of effective calculability in two different ways. I will trace back these two ways to Turing’s and Kolmogorov’s informal analyses of the intuitive notion of calculability and to their respective outputs: the notion of computorability and (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation