Switch to: References

Citations of:

Finite mathematics

Synthese 103 (3):389 - 420 (1995)

Add citations

You must login to add citations.
  1. Fair infinite lotteries.Sylvia Wenmackers & Leon Horsten - 2013 - Synthese 190 (1):37-61.
    This article discusses how the concept of a fair finite lottery can best be extended to denumerably infinite lotteries. Techniques and ideas from non-standard analysis are brought to bear on the problem.
    Download  
     
    Export citation  
     
    Bookmark   42 citations  
  • (1 other version)Forever Finite: The Case Against Infinity (Expanded Edition).Kip K. Sewell - 2023 - Alexandria, VA: Rond Books.
    EXPANDED EDITION (eBook): -/- Infinity Is Not What It Seems...Infinity is commonly assumed to be a logical concept, reliable for conducting mathematics, describing the Universe, and understanding the divine. Most of us are educated to take for granted that there exist infinite sets of numbers, that lines contain an infinite number of points, that space is infinite in expanse, that time has an infinite succession of events, that possibilities are infinite in quantity, and over half of the world’s population believes (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Ultralarge lotteries: Analyzing the Lottery Paradox using non-standard analysis.Sylvia Wenmackers - 2013 - Journal of Applied Logic 11 (4):452-467.
    A popular way to relate probabilistic information to binary rational beliefs is the Lockean Thesis, which is usually formalized in terms of thresholds. This approach seems far from satisfactory: the value of the thresholds is not well-specified and the Lottery Paradox shows that the model violates the Conjunction Principle. We argue that the Lottery Paradox is a symptom of a more fundamental and general problem, shared by all threshold-models that attempt to put an exact border on something that is intrinsically (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Bounded finite set theory.Laurence Kirby - 2021 - Mathematical Logic Quarterly 67 (2):149-163.
    We define an axiom schema for finite set theory with bounded induction on sets, analogous to the theory of bounded arithmetic,, and use some of its basic model theory to establish some independence results for various axioms of set theory over. Then we ask: given a model M of, is there a model of whose ordinal arithmetic is isomorphic to M? We show that the answer is yes if.
    Download  
     
    Export citation  
     
    Bookmark  
  • Finitary Set Theory.Laurence Kirby - 2009 - Notre Dame Journal of Formal Logic 50 (3):227-244.
    I argue for the use of the adjunction operator (adding a single new element to an existing set) as a basis for building a finitary set theory. It allows a simplified axiomatization for the first-order theory of hereditarily finite sets based on an induction schema and a rigorous characterization of the primitive recursive set functions. The latter leads to a primitive recursive presentation of arithmetical operations on finite sets.
    Download  
     
    Export citation  
     
    Bookmark   11 citations