Mathematics – Logic
Scientific paper
2010-06-20
Mathematics
Logic
Scientific paper
Suppose L = {<, . . .} is any countable first order language in which < is interpreted as a linear order. Let T be any complete first order theory in the language L such that T has a kappa-like model where kappa is an inaccessible cardinal. Such T satisfies the Inaccessibility Scheme. In this paper we study model theory of the inaccessibility scheme at the level of the existence of elementary end extensions for various models of it.
No associations
LandOfFree
Model Theory of the Inaccessibility Scheme does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Model Theory of the Inaccessibility Scheme, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Model Theory of the Inaccessibility Scheme will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-185974