Related papers: Enumeration degrees and non-metrizable topology
We describe the canonical correspondence between set of all finite metric spaces and set of special symmetric convex polytopes, and formulate the problem about classification of the metric spaces in terms of combinatorial structure of those…
We develop a notion of causal order on a generic manifold as independent of the underlying differential and topological structure. We show that sufficiently regular causal orders can be recovered from a distinguished algebra of sets, which…
We show that the concept of topological order, introduced to describe ordered quantum systems which cannot be classified by broken symmetries, also applies to classical systems. Starting from a specific example, we show how to use pure…
A `whole-part' theory is developed for a set of finite quantum systems $\Sigma (n)$ with variables in ${\mathbb Z}(n)$. The partial order `subsystem' is defined, by embedding various attributes of the system $\Sigma (m)$ (quantum states,…
We define E-theory for separable C*-algebras over second countable topological spaces and establish its basic properties. This includes an approximation theorem that relates the E-theory over a general space to the E-theories over finite…
We study degree-theoretic properties of reals that are not random with respect to any continuous probability measure (NCR). To this end, we introduce a family of generalized Hausdorff measures based on the iterates of the "dissipation"…
An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…
We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…
We define and study hierarchies of topological spaces induced by the classical Borel and Luzin hierarchies of sets. Our hierarchies are divided into two classes: hierarchies of countably based spaces induced by their embeddings into the…
Categorification is the process of finding category-theoretic analogs of set-theoretic concepts by replacing sets with categories, functions with functors, and equations between functions by natural isomorphisms between functors, which in…
We present the concept of the \emph{information efficiency of functions} as a technique to understand the interaction between information and computation. Based on these results we identify a new class of objects that we call…
The coarse similarity class $[A]$ of $A$ is the set of all $B$ whose symmetric difference with $A$ has asymptotic density 0. There is a natural metric $\delta$ on the space $\mathcal{S}$ of coarse similarity classes defined by letting…
Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…
We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…
Given $mp$ different $p$-planes in general position in $(m+p)$-dimensional space, a classical problem is to ask how many $p$-planes intersect all of them. For example when $m = p = 2$, this is precisely the question of "lines meeting four…
We associate to each $r$-multigraded, locally finitely generated ideal in the "large polynomial ring" on countably many indeterminates a power series in $r$ variables; this power series is the limit in the adic topology of the numerators of…
This article has been withdrawn in 2013. The class of LOTS (linearly ordered topological spaces) contains many important spaces, like the set of real numbers, the set of rational numbers and the ordinals. Such spaces have rich topological…
We study some generalized notions of cohesiveness which arise naturally in connection with effective versions of Ramsey's Theorem. An infinite set $A$ of natural numbers is $n$--cohesive (respectively, $n$--r--cohesive) if $A$ is almost…
In first order logic, it is known that you can define a topology so that the countable models of some theory $T$ form a Polish Space (i.e. completely metrizable second countable space). In this paper we use the Baldwin- Boney Relational…
We survey two new compactification methods for the KSBA moduli space of general type surfaces so that both of them admit a perfect obstruction theory. Virtual fundamental classes exist on these two moduli spaces, and tautological invariants…