Switch to: References

Add citations

You must login to add citations.
  1. The computable testability of theories making uncomputable predictions.Kevin T. Kelly & Oliver Schulte - 1995 - Erkenntnis 43 (1):29 - 66.
  • Reichenbach, induction, and discovery.Kevin T. Kelly - 1991 - Erkenntnis 35 (1-3):123 - 149.
    I have applied a fairly general, learning theoretic perspective to some questions raised by Reichenbach's positions on induction and discovery. This is appropriate in an examination of the significance of Reichenbach's work, since the learning-theoretic perspective is to some degree part of Reichenbach's reliabilist legacy. I have argued that Reichenbach's positivism and his infatuation with probabilities are both irrelevant to his views on induction, which are principally grounded in the notion of limiting reliability. I have suggested that limiting reliability is (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  • When is a Schema Not a Schema? On a Remark by Suszko.Lloyd Humberstone & Allen Hazen - 2020 - Studia Logica 108 (2):199-220.
    A 1971 paper by Roman Suszko, ‘Identity Connective and Modality’, claimed that a certain identity-free schema expressed the condition that there are at most two objects in the domain. Section 1 here gives that schema and enough of the background to this claim to explain Suszko’s own interest in it and related conditions—via non-Fregean logic, in which the objects in question are situations and the aim is to refrain from imposing this condition. Section 3 shows that the claim is false, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark