Switch to: References

Add citations

You must login to add citations.
  1. Bounds on the Strength of Ordinal Definable Determinacy in Small Admissible Sets.Diego Rojas-Rebolledo - 2012 - Notre Dame Journal of Formal Logic 53 (3):351-371.
    We give upper and lower bounds for the strength of ordinal definable determinacy in a small admissible set. The upper bound is roughly a premouse with a measurable cardinal $\kappa$ of Mitchell order $\kappa^{++}$ and $\omega$ successors. The lower bound are models of ZFC with sequences of measurable cardinals, extending the work of Lewis, below a regular limit of measurable cardinals.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  • “Mathematics is the Logic of the Infinite”: Zermelo’s Project of Infinitary Logic.Jerzy Pogonowski - 2021 - Studies in Logic, Grammar and Rhetoric 66 (3):673-708.
    In this paper I discuss Ernst Zermelo’s ideas concerning the possibility of developing a system of infinitary logic that, in his opinion, should be suitable for mathematical inferences. The presentation of Zermelo’s ideas is accompanied with some remarks concerning the development of infinitary logic. I also stress the fact that the second axiomatization of set theory provided by Zermelo in 1930 involved the use of extremal axioms of a very specific sort.1.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Can logic be combined with probability? Probably.Colin Howson - 2009 - Journal of Applied Logic 7 (2):177-187.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  • Supervenience and infinitary property-forming operations.Ralf M. Bader - 2012 - Philosophical Studies 160 (3):415-423.
    This paper provides an account of the closure conditions that apply to sets of subvening and supervening properties, showing that the criterion that determines under which property-forming operations a particular family of properties is closed is applicable both to the finitary and to the infinitary case. In particular, it will be established that, contra Glanzberg, infinitary operations do not give rise to any additional difficulties beyond those that arise in the finitary case.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Infinitary logic.John L. Bell - 2008 - Stanford Encyclopedia of Philosophy.
    Traditionally, expressions in formal systems have been regarded as signifying finite inscriptions which are—at least in principle—capable of actually being written out in primitive notation. However, the fact that (first-order) formulas may be identified with natural numbers (via "Gödel numbering") and hence with finite sets makes it no longer necessary to regard formulas as inscriptions, and suggests the possibility of fashioning "languages" some of whose formulas would be naturally identified as infinite sets . A "language" of this kind is called (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   7 citations