Abstract
AbstractWe 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 .
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
