Related papers: Categoricity without Power
The purpose of this paper is to clarify the relationship between various conditions implying essential undecidability: our main result is that there exists a theory $T$ in which all partially recursive functions are representable, yet $T$…
We define a Weil-\'etale complex with compact support for duals (in the sense of the Bloch dualizing cycles complex $\mathbb{Z}^c$) of a large class of $\mathbb{Z}$-constructible sheaves on an integral $1$-dimensional proper arithmetic…
We present a setting for the study of torsion theories in general categories. The idea is to associate, with any pair ($\mathcal T$, $\mathcal F$) of full replete subcategories in a category $\mathcal C$, the corresponding full subcategory…
We use type-theoretic techniques to present an algebraic theory of $\infty$-categories with strict units. Starting with a known type-theoretic presentation of fully weak $\infty$-categories, in which terms denote valid operations, we extend…
We develop category theory within Univalent Foundations, which is a foundational system for mathematics based on a homotopical interpretation of dependent type theory. In this system, we propose a definition of "category" for which equality…
Completeness proofs in categorical semantics usually proceed by building a syntactic category whose composition is given by substitution. For untyped effectful Call-by-Value languages, this runs into a basic obstacle: there is no canonical…
This article concerns commutative algebras over a field $k$ of characteristic zero which are finite dimensional as vectorspaces, and particularly those of such algebras which are graded. Here the term graded is applied to non-negatively…
Building on work of J. Robinson and A. Shlapentokh, we develop a general framework to obtain definability and decidability results of large classes of infinite algebraic extensions of $\mathbb{F}_p(t)$. As an application, we show that for…
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 a fragment of monadic infinitary second-order logic corresponding to an abstract separation property. We use this to define the concept of a separation subclass. We use model theoretic techniques and games to show that separation…
We investigate an enriched-categorical approach to a field of discrete mathematics. The main result is a duality theorem between a class of enriched categories (called $\overline{\mathbb{Z}}$- or $\overline{\mathbb{R}}$-categories) and that…
We introduce a new definition of topological degree for a meaningful class of operators which need not be continuous. Subsequently, we derive a number of fixed point theorems for such operators. As an application, we deduce a new existence…
In this paper we discuss the categorical properties of $\mathbb{Z}$-graded manifolds. We start by describing the local model paying special attention to the differences in comparison to the $\mathbb{N}$-graded case. In particular we explain…
Although there is a somewhat standard formalization of computability on countable sets given by Turing machines, the same cannot be said about uncountable sets. Among the approaches to define computability in these sets, order-theoretic…
Let $\Gamma \subset PSL_2(\mathbb{R})$ be a non-arithmetic Fuchsian group of the first kind with finite covolume, and let $j_{\Gamma}$ be a corresponding uniformizer. In this paper we introduce a natural $L_{\omega_1,\omega}$-axiomatization…
An algebra is said to be \emph{$\tau$-tilting finite} provided it has only a finite number of $\tau$-rigid objects up to isomorphism. We associate a category to each such algebra. The objects are the wide subcategories of its category of…
Category theory provides an alternative to Hilbert's Formal Axiomatic method and goes beyond Mathematical Structuralism
This work is motivated by the problem of finding the limit of the applicability of the first incompleteness theorem ($\sf G1$). A natural question is: can we find a minimal theory for which $\sf G1$ holds? We examine the Turing degree…
Selman's Theorem in classical Computability Theory gives a characterization of the enumeration reducibility for arbitrary sets in terms of the enumeration reducibility on the total sets: $A \le_e B \iff \forall X [X \equiv_{e} X \oplus…
This article explores the model-dependent nature of set cardinality, emphasizing that cardinality is not absolute but varies across different axiomatic frameworks. Although Cantor's diagonal argument shows the real numbers are…