相关论文: Mouse Sets

The usual definition of the set of constructible reals is $\Sigma ^1_2$. This set can have a simpler definition if, for example, it is countable or if every real is constructible. H. Friedman asked if the set of constructible reals can be…

In this thesis, we develop various techniques for working with sets in machine learning. Each input or output is not an image or a sequence, but a set: an unordered collection of multiple objects, each object described by a feature vector.…

We prove that there exists a countable $\beta$-model in which, for all reals $X$ and $Y$, $X$ is definable from $Y$ if and only $X$ is hyperarithmetical in $Y$. We also obtain some related results and pose some related questions.

It is true in the Cohen, Solovay-random, dominaning, and Sacks generic extension that every countable ordinal-definable set of reals belongs to to the ground universe

Motivated by ideas from the model theory of metric structures, we introduce a metric set theory, $\mathsf{MSE}$, which takes bounded quantification as primitive and consists of a natural metric extensionality axiom (the distance between two…

We introduce a new inner model $C(aa)$ arising from stationary logic. We show that assuming a proper class of Woodin cardinals, or alternatively $MM^{++}$, the regular uncountable cardinals of $V$ are measurable in the inner model $C(aa)$,…

In this short note, we study C((t)) in the language of valued rings. We show that a definable subset of C((t))n (or in monster model, Mn) is definably compact iff it is closed and unbounded. Then we give some comments on definable groups…

We give an example of two ordered structures M, N in the same language L with the same universe, the same order and admitting the same one-variable definable subsets such that M is a model of the common theory of o-minimal L-structures and…

This is the second in a series of papers on the relation between algebraic set theory and predicative formal systems. In part I, we introduced the notion of a predicative category of small maps and obtained the result that such categories…

We show that any translate of a model set is a model set in some modified cut-and-project scheme. Restricting to Euclidean direct space, we show that any translate of an inter model set is a model set in some modified cut-and-project scheme…

The aim of this note is to provide a conceptually simple demonstration of the fact that repetitive model sets are characterized as the repetitive Meyer sets with an almost automorphic associated dynamical system.

This is a survey on the ongoing development of a descriptive theory of represented spaces, which is intended as an extension of both classical and effective descriptive set theory to deal with both sets and functions between represented…

Laminar set systems consist of non-crossing subsets of a universe with set inclusion essentially corresponding to the descendant relationship of a tree, the so-called laminar tree. Laminar set systems lie at the core of many graph…

We study monitorable sets from a topological standpoint. In particular, we use descriptive set theory to describe the complexity of the family of monitorable sets in a countable space $X$. When $X$ is second countable, we observe that the…

Although some work has been done on the metamathematics of Metamath, there has not been a clear definition of a model for a Metamath formal system. We define the collection of models of an arbitrary Metamath formal system, both for…

Using ideas from synthetic topology, a new approach to descriptive set theory is suggested. Synthetic descriptive set theory promises elegant explanations for various phenomena in both classic and effective descriptive set theory.…

We characterize those standard models M of ZFC which are embeddable, as the class of all standard sets, in a model of internal set theory IST. The necessary and sufficient condition is that 1) there is a wellordering < of M which does not…

By reformulating a learning process of a set system L as a game between Teacher and Learner, we define the order type of L to be the order type of the game tree, if the tree is well-founded. The features of the order type of L (dim L in…

Let R be a commutative ring with unity, M a module over R and let S be a G-set for a finite group G. We define a set MS to be the set of elements expressed as the formal finite sum of the form similar to the elements of group ring RG. The…

The success of neural networks builds to a large extent on their ability to create internal knowledge representations from real-world high-dimensional data, such as images, sound, or text. Approaches to extract and present these…