Switch to: References

Add citations

You must login to add citations.
  1. Conditioning by Minimizing Accessibility.Konstantinos Georgatos - 2010 - In Giacomo Bonanno, Benedikt Löwe & Wiebe Hoek (eds.), Logic and the Foundations of Game and Decision Theory €“ Loft 8. Springer Berlin Heidelberg. pp. 20-33.
    This paper presents an axiomatization of a class of set-theoretic conditional operators using minimization of the geodesic distance defined as the shortest path generated by the accessibility relation on a frame. The objective of this modeling is to define conditioning based on a notion of similarity generated by degrees of indistinguishability.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • A Counterfactual Analysis of Infinite Regress Arguments.İskender Taşdelen - 2014 - Acta Analytica 29 (2):195-213.
    I propose a counterfactual theory of infinite regress arguments. Most theories of infinite regress arguments present infinite regresses in terms of indicative conditionals. These theories direct us to seek conditions under which an infinite regress generates an infinite inadmissible set. Since in ordinary language infinite regresses are usually expressed by means of infinite sequences of counterfactuals, it is natural to expect that an analysis of infinite regress arguments should be based on a theory of counterfactuals. The Stalnaker–Lewis theory of counterfactuals, (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • A Comment on Work by Booth and Co-authors.Dov M. Gabbay & Karl Schlechta - 2010 - Studia Logica 94 (3):403-432.
    Booth and his co-authors have shown in [2], that many new approaches to theory revision (with fixed K ) can be represented by two relations, , where is a sub-relation of < . They have, however, left open a characterization of the infinite case, which we treat here.
    Download  
     
    Export citation  
     
    Bookmark   1 citation