相关论文: What internal set theory knows about standard sets

It is known that the set of permutations, under the pattern containment ordering, is not a partial well-order. Characterizing the partially well-ordered closed sets (equivalently: down sets or ideals) in this poset remains a wide-open…

The axiom of choice ensures precisely that, in ZFC, every set is projective: that is, a projective object in the category of sets. In constructive ZF (CZF) the existence of enough projective sets has been discussed as an additional axiom…

The Ising model is well-known for illustrating the fundamental characteristics of phase transitions in closed systems. In this article, we propose a generalization of the two-dimensional Ising model to open systems, considering the…

The compactness phenomenon is one of the featured aspects of structuralism in mathematics. In simple and broad words, a compactness property holds in a structure if a related property is satisfied by sufficiently many substructures of that…

We propose a set theory strong enough to interpret powerful type theories underlying proof assistants such as LEGO and also possibly Coq, which at the same time enables program extraction from its constructive proofs. For this purpose, we…

This paper is a technical continuation of ``Natural Axiom Schemata Extending ZFC. Truth in the Universe?'' In that paper we argue that $CIFS$ is a natural axiom schema for the universe of sets. In particular it is a natural closure…

In classification, it is usual to observe that models trained on a given set of classes can generalize to previously unseen ones, suggesting the ability to learn beyond the initial task. This ability is often leveraged in the context of…

Given two relations containing multiple measurements - possibly with uncertainties - our objective is to find which sets of attributes from the first have a corresponding set on the second, using exclusively a sample of the data. This…

We prove that the theory of the models constructible using finitely many cofinality quantifiers - $C_{\lambda_{1},...,\lambda_{n}}^{*}$ and $C_{<\lambda_{1},...,<\lambda_{n}}^{*}$ for $\lambda_{1},...,\lambda_{n}$ regular cardinals - is…

Obtaining a well-trained model involves expensive data collection and training procedures, therefore the model is a valuable intellectual property. Recent studies revealed that adversaries can `steal' deployed models even when they have no…

In this paper, we unify the study of classical and non-classical algebra-valued models of set theory, by studying variations of the interpretation functions for identity and set-membership. Although, these variations coincide with the…

We show that, under the assumption of the existence of $M_1^{\#}$, there exists a model on which the restricted nonstationary ideal $\hbox{NS} \upharpoonright A$ is $\aleph_2$-saturated, for $A$ a stationary co-stationary subset of…

An elementary embedding $j:M\rightarrow N$ between two inner models of ZFC is cardinal preserving if $M$ and $N$ correctly compute the class of cardinals. We look at the case $N=V$ and show that there is no nontrivial cardinal preserving…

We present a system of axioms motivated by a topological intuition: The set of subsets of any set is a topology on that set. On the one hand, this system is a common weakening of Zermelo-Fraenkel set theory ZF, the positive set theory GPK…

Finitary/static semantics in the form of intersection type assignments have become a paradigm for analysing the fine structure of all sorts of lambda-models. The key step is the construction of a filter model isomorphic to a given…

We propose a natural theory SO axiomatizing the class of sets of ordinals in a model of ZFC set theory. Both theories possess equal logical strength. Constructibility theory in SO corresponds to a natural recursion theory on ordinals.

For which (first-order complete, usually countable) $T$ do there exist non-isomorphic models of $T$ which become isomorphic after forcing with a forcing notion $\mathbb{P}$? Necessarily, $\mathbb{P}$ is non-trivial; i.e.~it adds some new…

Concept embeddings offer a practical and efficient mechanism for injecting commonsense knowledge into downstream tasks. Their core purpose is often not to predict the commonsense properties of concepts themselves, but rather to identify…

A set A of natural numbers is finitely embeddable in another such set B if every finite subset of A has a rightward translate that is a subset of B. This notion of finite embeddability arose in combinatorial number theory, but in this paper…

For any first order theory T we construct a Boolean valued model M, in which precisely the T--provable formulas hold, and in which every (Boolean valued) subset which is invariant under all automorphisms of M is definable by a first order…