Related papers: Infinite Computations and the Generic Finite
The Univalence Principle is the statement that equivalent mathematical structures are indistinguishable. We prove a general version of this principle that applies to all set-based, categorical, and higher-categorical structures defined in a…
Cantor's famous proof of the non-denumerability of real numbers does apply to any infinite set. The set of exclusively all natural numbers does not exist. This shows that the concept of countability is not well defined. There remains no…
We give a new description of classical Besov spaces in terms of a new modulus of continuity. Then a similar approach is used to introduce Besov classes on an infinite-dimensional space endowed with a Gaussian measure.
In this paper, we introduce a new generalization of the perfect numbers, called $\mathcal{S}$-perfect numbers. Briefly stated, an $\mathcal{S}$-perfect number is an integer equal to a weighted sum of its proper divisors, where the weights…
computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all abstract computable…
Following ideas of Lawvere and Linton we prove that classical varieties are precisely the exact categories with a varietal generator. This means a strong generator which is abstractly finite and regularly projective. An analogous…
The category $\bcalNT$ was defined in \cite{Lobos2}, it is a category whose objects are commutative nil graded algebras over a field, defined by presentation encoded by triangular matrices. A natural problem related to this category is to…
This paper focuses on the equivalent expression of fractional integrals/derivatives with an infinite series. A universal framework for fractional Taylor series is developed by expanding an analytic function at the initial instant or the…
We associate a rational number $\chi(\mathcal{A})$ to every category $\mathcal{A}$ whose object and morphism sets are finite. We show that the assignment $\chi$ is additive under disjoint union and it preserves products. Hence we consider…
We give an alternative proof of the theorem by Kuznetsov and Lunts, stating that any separated scheme of finite type over a field of characteristic zero admits a categorical resolution of singularities. Their construction makes use of the…
It is shown that any finitely generated subring of a global field has a universal first-order definition in its fraction field. This covers Koenigsmann's result for the ring of integers and its subsequent extensions to rings of integers in…
We define a notion of an arithmetic set in an arbitrary countable group and study properties of these sets in the cases of Abelian groups and non-abelian free groups.
As the first part of the treatise on A General Theory of Concept Lattice (I-V), this work develops the general concept lattice for the problem concerning categorization of objects according to their properties. Unlike the conventional…
We propose a more general definition of generic-case complexity, based on using a random process for generating inputs of an algorithm and using the time needed to generate an input as a way of measuring the size of that input.
We use fast-growing finite and infinite sequences of natural numbers and more complicated constructs to define models of hypercomputation and interpret non-arithmetic predicates, with the strongest extensions reaching full second order…
A group of individuals wishes to classify $m$ objects into $n$ categories in such a way that no class is left empty, a condition known as surjectivity. The opinions of the individuals are aggregated separately for each object using an…
We study cofinal systems of finite subsets of $\omega_1$. We show that while such systems can be NIP, they cannot be defined in an NIP structure. We deduce a positive answer to a question of Chernikov and Simon from 2013: in an NIP theory,…
We define a generalization of the winding number of a piecewise $C^1$ cycle in the complex plane which has a geometric meaning also for points which lie on the cycle. The computation of this winding number relies on the Cauchy principal…
A generic computation of a subset A of the natural numbers consists of a a computation that correctly computes most of the bits of A, and which never incorrectly computes any bits of A, but which does not necessarily give an answer for…
The purpose of this note is to describe a space that is regular but not completely regular, but only barely so: all closed sets are $G_\delta$-sets and every singleton is a zero-set.