# Resplendent models and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Sigma_1^1}$$\end{document} -definability with an oracle [Book Review]

Archive for Mathematical Logic 47 (6):607-623 (2008)

# Abstract

In this article we find some sufficient and some necessary \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Sigma^1_1}$$\end{document} -conditions with oracles for a model to be resplendent or chronically resplendent. The main tool of our proofs is internal arguments, that is analogues of classical theorems and model-theoretic constructions conducted inside a model of first-order Peano Arithmetic: arithmetised back-and-forth constructions and versions of the arithmetised completeness theorem, namely constructions of recursively saturated and resplendent models from the point of view of a model of arithmetic. These internal arguments are used in conjunction with Pabion’s theorem that ensures that certain oracles are coded in a sufficiently saturated model of arithmetic. Examples of applications are provided for the theories of dense linear orders and of discrete linear orders. These results are then generalised to other ω-categorical theories and theories with a unique countable recursively saturated model.

# Other Versions

No versions found

## PhilArchive

Upload a copy of this work     Papers currently archived: 95,443

Setup an account with your affiliations in order to access resources via your University's proxy server

# Similar books and articles

Chains of saturated models in AECs.Will Boney & Sebastien Vasey - 2017 - Archive for Mathematical Logic 56 (3-4):187-213.
Rationalizing epistemic bounded rationality.Konrad Grabiszewski - 2015 - Theory and Decision 78 (4):629-637.
Hard Provability Logics.Mojtaba Mojtahedi - 2021 - In Mojtaba Mojtahedi, Shahid Rahman & MohammadSaleh Zarepour (eds.), Mathematics, Logic, and their Philosophies: Essays in Honour of Mohammad Ardeshir. Springer. pp. 253-312.

2013-12-26

8 (#1,379,000)

6 months
4 (#1,067,968)