相关论文: Set mapping reflection

In this paper we first formulate several ``combinatorial principles'' concerning kappa \times omega matrices of subsets of omega and prove that they are valid in the generic extension obtained by adding any number of Cohen reals to any…

We introduce the notion of reflexivity for combinatory algebras. Reflexivity can be thought of as an equational counterpart of the Meyer-Scott axiom of combinatory models, which indeed allows us to characterise an equationally definable…

We show that the tree property, stationary reflection and the failure of approachability at $\kappa^{++}$ are consistent with $\mathfrak{u}(\kappa) = \kappa^+ < 2^\kappa$, where $\kappa$ is a singular strong limit cardinal with the…

We answer a question of Woodin by showing that assuming an inaccessible cardinal $\kappa$ which is a limit of ${<}\kappa$-supercompact cardinals exists, there is a stationary set preserving forcing $\mathbb{P}$ so that $V^{\mathbb…

We show that the classical strong maximum principle, concerning positive supersolutions of linear elliptic equations vanishing on the boundary of the domain $\Omega $ can be extended, under suitable conditions, to the case in which the…

We introduce and explore a new property related to reflexivity that plays an important role in the characterization of norm attaining operators. We also present an application to the theory of compact perturbations of linear operators and…

The purpose of this paper is to present a general method for forcing on $\omega_2$ and $\omega_3$ with finite conditions, while preserving all cardinals and some fragments of $\mathrm{GCH}$. This method is based on the technique of forcing…

Orthogonal weight matrices are used in many areas of deep learning. Much previous work attempt to alleviate the additional computational resources it requires to constrain weight matrices to be orthogonal. One popular approach utilizes…

We construct here an iterative evaluation of all PR map codes: progress of this iteration is measured by descending complexity within "Ordinal" O := N[\omega] of polynomials in one indeterminate, ordered lexicographically. Non-infinit…

Assume ZFC. Let $\kappa$ be a cardinal. A ${<\kappa}$-ground is a transitive proper class $W$ modelling ZFC and such that $V$ is a generic extension of $W$ via a forcing $\mathbb{P}\in W$ of cardinality ${<\kappa}$. The $\kappa$-mantle is…

This dissertation aims to provide a comprehensive account of set theory with urelements. In Chapter 1, I present mathematical and philosophical motivations for studying urelement set theory and lay out the necessary technical preliminaries.…

Let \alpha be a countable ordinal and \P(\alpha) the collection of its subsets isomorphic to \alpha. We show that the separative quotient of the set \P (\alpha) ordered by the inclusion is isomorphic to a forcing product of iterated reduced…

In \cite{MV} we defined and proved the consistency of the principle ${\rm GM}^+(\omega_3,\omega_1)$ which implies that many consequences of strong forcing axioms hold simultaneously at $\omega_2$ and $\omega_3$. In this paper we formulate a…

The main result of this paper is to show that for any compact space $X$ and any family $\{f_\alpha \colon \alpha< 2^\kappa, f_\alpha \colon X \stackrel{onto}{\longrightarrow} \beta \kappa\}$ of open mappings there exists a point $x \in X$…

We show how lattice paths and the reflection principle can be used to give easy proofs of unimodality results. In particular, we give a "one-line" combinatorial proof of the unimodality of the binomial coefficients. Other examples include…

We produce, relative to a ${\sf ZFC}$ model with a supercompact cardinal, a ${\sf ZFC}$ model of the Proper Forcing Axiom in which the nonstationary ideal on $\omega_1$ is $\Pi_1$-definable in a parameter from $H_{\aleph_2}$.

We study the logical content of several maximality principles related to the finite intersection principle ($F\IP$) in set theory. Classically, these are all equivalent to the axiom of choice, but in the context of reverse mathematics their…

Let $\kappa$ be an uncountable cardinal such that $2^{<\kappa} = \kappa$ or just ${\rm cf}(\kappa) > \omega$, $2^{2^{<\kappa}}= 2^\kappa$, and $([\kappa]^\kappa, \supseteq)$ collapses $2^\kappa$ to $\omega$. We show under these assumptions…

We generalise Jensen's result on the incompatibility of subcompactness with square. We show that alpha^+-subcompactness of some cardinal less than or equal to alpha precludes square_alpha, but also that square may be forced to hold…

We consider several formalizations in the language of second-order arithmetic of "The formula $\phi$ is a theorem of $\omega$-logic", including some which have been studied in the literature and a new variant defined via a least fixed…