Model theory of the inaccessibility scheme

DOI10.1007/S00153-011-0242-YzbMATH Open1243.03055arXiv1006.3916OpenAlexW2009453528MaRDI QIDQ647330FDOQ647330

Authors: S. Mohsenipour 

Publication date: 23 November 2011

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

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.

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

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

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)

Cites Work

• Title not available (Why is that?)
• End extensions and numbers of countable models
• On Keisler singular-like models
• A generalization of the Keisler‐Morley theorem to recursively saturated ordered structures
• Leibnizian models of set theory
• Model theory of the regularity and reflection schemes

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)