Strong downward Löwenheim–Skolem theorems for stationary logics, I

Archive for Mathematical Logic 60 (1-2):17-47 (2020)
  Copy   BIBTEX

Abstract

This note concerns the model theoretic properties of logics extending the first-order logic with monadic second-order variables equipped with the stationarity quantifier. The eight variations of the strong downward Löwenheim–Skolem Theorem down to <ℵ2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$<\aleph _2$$\end{document} for this logic with the interpretation of second-order variables as countable subsets of the structures are classified into four principles. The strongest of these four is shown to be equivalent to the conjunction of CH and the Diagonal Reflection Principle for internally clubness of S. Cox. We show that a further strengthening of this SDLS and its variations follow from the Game Reflection Principle of B. König and its generalizations.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,745

External links

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

Through your library

Similar books and articles

Definability in the enumeration degrees.Theodore A. Slaman & W. Hugh Woodin - 1997 - Archive for Mathematical Logic 36 (4-5):255-267.
Two-cardinal diamond and games of uncountable length.Pierre Matet - 2015 - Archive for Mathematical Logic 54 (3-4):395-412.

Analytics

Added to PP
2020-04-10

Downloads
18 (#201,463)

6 months
10 (#1,198,792)

Historical graph of downloads
How can I increase my downloads?