Related papers: Generalized Descriptive Set Theory and Classificat…
Four constructions result from a desire to create enhancements to Cantor's infinite real set cardinality. Each continues to keep Cantor's cardinality formulation in place while providing new comparisons of arbitrary infinite sets. To…
We develop a compositional framework for generalized reversible computing using copy-discard categories and resource theories. We introduce partitioned matrices between partitioned sets as subdistribution matrices which preserve the…
We investigate regularity properties derived from tree-like forcing notions in the setting of "generalized descriptive set theory", i.e., descriptive set theory on $\kappa^\kappa$ and $2^\kappa$, for regular uncountable cardinals $\kappa$.
In modern OCaml, single-argument datatype declarations (variants with a single constructor, records with a single field) can sometimes be `unboxed'. This means that their memory representation is the same as their single argument (omitting…
The generality of a derivation is an equivalence relation on the set of occurrences of variables in its premises and conclusion such that two occurrences of the same variable are in this relation iff they must remain occurrences of the same…
Orbit-finite models of computation generalise the standard models of computation, to allow computation over infinite objects that are finite up to symmetries on atoms, denoted by $\mathbb{A}$. Set theory with atoms is used to reason about…
As mathematical induction is applied to prove statements on natural numbers, {\it continuous induction} (or, {\it real induction}) is a tool to prove some statements in real analysis.(Although, this comparison is somehow an overstatement.)…
Cantor's diagonal method is traditionally used to prove the uncountability of the set of all infinite binary sequences. This paper analyzes the expressive limits of this method. It is shown that under any constructive application --…
For a Tychonoff space X, we denote by B(X) the space of all Baire functions on X with the topology of pointwise convergence. In this paper we investigate selectors for sequences of countable dense and countable sequentially dense sets of…
Starting from a description of various generalized function algebras based on sequence spaces, we develop the general framework for considering linear problems with singular coefficients or non linear problems. Therefore, we prove…
We try to understand complete types over a somewhat saturated model of a complete first order theory which is dependent (previously called NIP), by "decomposition theorems for such types". Our thesis is that the picture of dependent theory…
An elementary rheory of concatenation is introduced and used to establish mutual interpretability of Robinson arithmetic, Minimal Predicative Set Theory, the quantifier-free part of Kirby's finitary set theory, and Adjunctive Set Theory,…
A random dense countable set is characterized (in distribution) by independence and stationarity. Two examples are `Brownian local minima' and `unordered infinite sample'. They are identically distributed; the former ad hoc proof of this…
We consider countable linear orders and study the quasi-order of convex embeddability and its induced equivalence relation. We obtain both combinatorial and descriptive set-theoretic results, and further extend our research to the case of…
The concept of quantization consists in replacing commutative quantities by noncommutative ones. In mathematical language an algebra of continuous functions on a locally compact topological space is replaced with a noncommutative…
This report consists of two parts. The first part is a brief exposition of classical descriptive set theory. This part introduces some fundamental concepts, motivations and results from the classical theory and ends with a section on the…
We study genericity of dynamical properties in the space of homeomorphisms of the Cantor set and in the space of subshifts of a suitably large shift space. These rather different settings are related by a Glasner-King type correspondence:…
Dependence logic provides an elegant approach for introducing dependencies between variables into the object language of first-order logic. In [1] generalized quantifiers were introduced in this context. However, a satisfactory account was…
In this work we give a deformation theoretical approach to the problem of quantization. First the notion of a deformation of a noncommutative ringed space over a commutative locally ringed space is introduced within a language coming from…
The problem of comparing concepts of dependence in general rough sets with those in probability theory had been initiated by the present author in some of her recent papers. This problem relates to the identification of the limitations of…