On external Scott algebras in nonstandard models of Peano arithmetic
Copyright policy )On external Scott algebras in nonstandard models of Peano arithmetic
AbstractWe prove that a necessary and sufficient condition for a countable set of sets of integers to be equal to the algebra of all sets of integers definable in a nonstandard elementary extension of ω by a formula of the PA language which may include the standardness predicate but does not contain nonstandard parameters, is as follows: is closed under arithmetical definability and contains 0(ω) the set of all (Gödel numbers of) true arithmetical sentences.Some results related to definability of sets of integers in elementary extensions of ω are included.
First-order arithmetic and fragments, forcing, Nonstandard models of arithmetic, standardness predicate, Scott sets, Scott algebra, models of arithmetic
First-order arithmetic and fragments, forcing, Nonstandard models of arithmetic, standardness predicate, Scott sets, Scott algebra, models of arithmetic
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!