Switch to: References

Citations of:

Carnap and the logic of inductive inference

In Dov M. Gabbay, John Woods & Akihiro Kanamori (eds.), Handbook of the History of Logic. Elsevier. pp. 10--265 (2004)

Add citations

You must login to add citations.
  1. Are Algorithms Value-Free?Gabbrielle M. Johnson - 2023 - Journal Moral Philosophy 21 (1-2):1-35.
    As inductive decision-making procedures, the inferences made by machine learning programs are subject to underdetermination by evidence and bear inductive risk. One strategy for overcoming these challenges is guided by a presumption in philosophy of science that inductive inferences can and should be value-free. Applied to machine learning programs, the strategy assumes that the influence of values is restricted to data and decision outcomes, thereby omitting internal value-laden design choice points. In this paper, I apply arguments from feminist philosophy of (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Finite additivity, another lottery paradox and conditionalisation.Colin Howson - 2014 - Synthese 191 (5):1-24.
    In this paper I argue that de Finetti provided compelling reasons for rejecting countable additivity. It is ironical therefore that the main argument advanced by Bayesians against following his recommendation is based on the consistency criterion, coherence, he himself developed. I will show that this argument is mistaken. Nevertheless, there remain some counter-intuitive consequences of rejecting countable additivity, and one in particular has all the appearances of a full-blown paradox. I will end by arguing that in fact it is no (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   24 citations  
  • What conceptual spaces can do for Carnap's late inductive logic.Marta Sznajder - 2016 - Studies in History and Philosophy of Science Part A 56:62-71.
  • Solomonoff Prediction and Occam’s Razor.Tom F. Sterkenburg - 2016 - Philosophy of Science 83 (4):459-479.
    Algorithmic information theory gives an idealized notion of compressibility that is often presented as an objective measure of simplicity. It is suggested at times that Solomonoff prediction, or algorithmic information theory in a predictive setting, can deliver an argument to justify Occam’s razor. This article explicates the relevant argument and, by converting it into a Bayesian framework, reveals why it has no such justificatory force. The supposed simplicity concept is better perceived as a specific inductive assumption, the assumption of effectiveness. (...)
    Direct download (12 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  • An Axiomatic Theory of Inductive Inference.Luciano Pomatto & Alvaro Sandroni - 2018 - Philosophy of Science 85 (2):293-315.
    This article develops an axiomatic theory of induction that speaks to the recent debate on Bayesian orgulity. It shows the exact principles associated with the belief that data can corroborate universal laws. We identify two types of disbelief about induction: skepticism that the existence of universal laws of nature can be determined empirically, and skepticism that the true law of nature, if it exists, can be successfully identified. We formalize and characterize these two dispositions toward induction by introducing novel axioms (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • A Conciliatory Answer to the Paradox of the Ravens.William Peden - 2020 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 51 (1):45-64.
    In the Paradox of the Ravens, a set of otherwise intuitive claims about evidence seems to be inconsistent. Most attempts at answering the paradox involve rejecting a member of the set, which seems to require a conflict either with commonsense intuitions or with some of our best confirmation theories. In contrast, I argue that the appearance of an inconsistency is misleading: ‘confirms’ and cognate terms feature a significant ambiguity when applied to universal generalisations. In particular, the claim that some evidence (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Hume’s theorem.Colin Howson - 2013 - Studies in History and Philosophy of Science Part A 44 (3):339-346.
    A common criticism of Hume’s famous anti-induction argument is that it is vitiated because it fails to foreclose the possibility of an authentically probabilistic justification of induction. I argue that this claim is false, and that on the contrary, the probability calculus itself, in the form of an elementary consequence that I call Hume’s Theorem, fully endorses Hume’s argument. Various objections, including the often-made claim that Hume is defeated by de Finetti’s exchangeability results, are considered and rejected.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • All Ravens can be Black, After All.Ruurik Holm - 2021 - Journal of Logic, Language and Information 30 (4):657-669.
    This article discusses the problem of non-zero probabilities for non-tautologous universal generalizations in Rudolf Carnap’s inductive logic when the domain of discourse is infinite. A solution is provided for a generalization of the form “all Xs are Ys”, for example “all ravens all black”. The solution is based on assuming that a significant part of the domain consists of non-Xs. This assumption can often be justified as a kind of ceteris paribus principle.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Foundations of Probability.Rachael Briggs - 2015 - Journal of Philosophical Logic 44 (6):625-640.
    The foundations of probability are viewed through the lens of the subjectivist interpretation. This article surveys conditional probability, arguments for probabilism, probability dynamics, and the evidential and subjective interpretations of probability.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • Philosophy as conceptual engineering: Inductive logic in Rudolf Carnap's scientific philosophy.Christopher F. French - 2015 - Dissertation, University of British Columbia
    My dissertation explores the ways in which Rudolf Carnap sought to make philosophy scientific by further developing recent interpretive efforts to explain Carnap’s mature philosophical work as a form of engineering. It does this by looking in detail at his philosophical practice in his most sustained mature project, his work on pure and applied inductive logic. I, first, specify the sort of engineering Carnap is engaged in as involving an engineering design problem and then draw out the complications of design (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation