Switch to: References

Add citations

You must login to add citations.
  1. Ordinal Exponentiations of Sets.Laurence Kirby - 2015 - Notre Dame Journal of Formal Logic 56 (3):449-462.
    The “high school algebra” laws of exponentiation fail in the ordinal arithmetic of sets that generalizes the arithmetic of the von Neumann ordinals. The situation can be remedied by using an alternative arithmetic of sets, based on the Zermelo ordinals, where the high school laws hold. In fact the Zermelo arithmetic of sets is uniquely characterized by its satisfying the high school laws together with basic properties of addition and multiplication. We also show how in both arithmetics the behavior of (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Digraph parameters and finite set arithmetic.Laurence Kirby - 2015 - Mathematical Logic Quarterly 61 (4-5):250-262.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • 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