相关论文: Mouse Sets

Sequential modelling entails making sense of sequential data, which naturally occurs in a wide array of domains. One example is systems that interact with users, log user actions and behaviour, and make recommendations of items of potential…

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…

This paper revisits visual saliency prediction by evaluating the recent advancements in this field such as crowd-sourced mouse tracking-based databases and contextual annotations. We pursue a critical and quantitative approach towards some…

A complete first order theory of a relational signature is called monomorphic iff all its models are monomorphic (i.e. have all the $n$-element substructures isomorphic, for each positive integer $n$). We show that a complete theory…

We develop a basic translation procedure that translates a hod mouse to an equivalent mouse. Unlike the translation procedure used by Steel and Zhu, our procedure works in a coarse setting without assuming AD. Nevertheless, the procedure…

This is the second paper in a series that aims to provide mathematical descriptions of objects and constructions related to the first few steps of the semantical theory of dependent type systems. We construct for any pair $(R,LM)$, where…

The thesis presents the subject of synthetic topology, especially with relation to metric spaces. A model of synthetic topology is a categorical model in which objects possess an intrinsic topology in a suitable sense, and all morphisms are…

This paper provides a complete suite of axioms for a version of set theory that I call Explication. Explication borrows from the two most prominent existing systems of set theory. Explication starts with class variables. After several…

In this paper, the classification task for a family of sets representing the realisation of some random set models is solved. Both unsupervised and supervised classification methods are utilised using the similarity measure between two…

We adapt the notion of a (relatively) definable subset of Aut(M) when M is a saturated model to the case Aut(M/A) when M is atomic and strongly omega-homogeneous over A. We discuss the existence and uniqueness of invariant measures on the…

This is the third installment in a series of papers on algebraic set theory. In it, we develop a uniform approach to sheaf models of constructive set theories based on ideas from categorical logic. The key notion is that of a "predicative…

Using only basic topological properties of real algebraic sets and regular morphisms we show that any injective regular self-mapping of a real algebraic set is surjective. Then we show that injective morphisms between germs of real…

The set of open subsets in a proximity space (X,{\zeta}) forms a topological system that enables the definition of proximal and descriptive topological groups. This framework naturally extends to proximal and descriptive topological rings…

The process of cognition is analysed to adjust the set theory to physical description. Postulates and basic definitions are revised. The specific sets of predicates, called presets, corresponding to the physical objects identified by an…

Marker and Steinhorn shown that given two models $M\prec N$ of an o-minimal theory, if all 1-types over $M$ realized in $N$ are definable, then all types over $M$ realized in $N$ are definable. In this article we characterize pairs of…

To a definable subset of Z_p^n (or to a scheme of finite type over Z_p) one can associate a tree in a natural way. It is known that the corresponding Poincare series P(X) = \sum_i N_i X^i is rational, where N_i is the number of nodes of the…

With every pca $\mathcal{A}$ and subpca $\mathcal{A}_\#$ we associate the nested realizability topos $\mathsf{RT}(\mathcal{A},\mathcal{A}_\#)$ within which we identify a class of small maps $\mathcal{S}$ giving rise to a model of…

Inferential models have recently gained in popularity for valid uncertainty quantification. In this paper, we investigate inferential models by exploring relationships between inferential models, fiducial inference, and confidence curves.…

Here it is shown that standard set theory can be interpreted in a theory about order. The ordering here is about non-extensional flat classes, i.e. classes that are not elements of classes. So, stipulating a nearly well order over all those…

Let (G, *) be a semigroup, D subset of G, and n >= 2 be an integer. We say that (D, *) is an n-closed subset of G if a_1* ... *a_n in D for every a_1, ..., a_n in D. Hence every closed set is a 2-closed set. The concept of n-closed sets…