Bounded Scott Set Saturation

DOI<link itemprop=identifier href="https://doi.org/10.1002/1521-3870(200202)48:2<245::AID-MALQ245>3.0.CO;2-7" /><245::AID-MALQ245>3.0.CO;2-7 10.1002/1521-3870(200202)48:2<245::AID-MALQ245>3.0.CO;2-7zbMath0999.03032OpenAlexW2070696628MaRDI QIDQ4531088

Alex M. McAllister

Publication date: 28 November 2002

Full work available at URL: https://doi.org/10.1002/1521-3870(200202)48:2<245::aid-malq245>3.0.co;2-7

zbMATH Keywords

models of arithmeticScott setsrelative computabilityrecursive saturationflexible formulas

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Nonstandard models of arithmetic (03H15) Models of arithmetic and set theory (03C62) Models with special properties (saturated, rigid, etc.) (03C50)

Related Items (2)

Unnamed Item ⋮ A note on standard systems and ultrafilters

Cites Work

• Unnamed Item
• Unnamed Item
• Expansions of models and turing degrees
• Gödel's diagonalization technique and related properties of theories
• Computability in structures representing a Scott set

This page was built for publication: Bounded Scott Set Saturation