Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-14T16:53:17.995Z Has data issue: false hasContentIssue false

A STRONG REFLECTION PRINCIPLE

Published online by Cambridge University Press:  01 November 2017

Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

This article introduces a new reflection principle. It is based on the idea that whatever is true in all entities of some kind is also true in a set-sized collection of them. Unlike standard reflection principles, it does not re-interpret parameters or predicates. This allows it to be both consistent in all higher-order languages and remarkably strong. For example, I show that in the language of second-order set theory with predicates for a satisfaction relation, it is consistent relative to the existence of a 2-extendible cardinal (Theorem 7.12) and implies the existence of a proper class of 1-extendible cardinals (Theorem 7.9).

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2017