Model theory of the inaccessibility scheme

DOI10.1007/S00153-011-0242-YMaRDI QIDQ647330zbMATH OpenOpenAlexFDO

Authors S. Mohsenipour

Publication date 23 November 2011

Published in Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1006.3916

zbMATH Keywords

inaccessible cardinalelementary end extensioninaccessibility scheme

Mathematics Subject Classification ID

Set-theoretic model theory (03C55) Large cardinals (03E55) Models of arithmetic and set theory (03C62)

Abstract: 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.

Recommendations

• Model theory of the regularity and reflection schemes
• scientific article; zbMATH DE number 3316902
• Elementary extensions of models of set theory
• On Keisler singular-like models
• The theory of \(\kappa\)-like models of arithmetic

Cites work

• scientific article; zbMATH DE number 1490113 (Why is no real title available?)
• A generalization of the Keisler‐Morley theorem to recursively saturated ordered structures
• End extensions and numbers of countable models
• Leibnizian models of set theory
• Model theory of the regularity and reflection schemes
• On Keisler singular-like models

Cited in

(1)

• Jewels of Institution-Independent Model Theory

This page was built for publication: Model theory of the inaccessibility scheme

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q647330)