Related papers: Cover Schemes, Frame-Valued Sets and Their Potenti…
In a previous paper we have suggested a number of ideas to attack circuit size complexity with cohomology. As a simple example, we take circuits that can only compute the AND of two inputs, which essentially reduces to SET COVER. We show a…
Higher-dimensional category theory is the study of n-categories, operads, braided monoidal categories, and other such exotic structures. Although it can be treated purely as an algebraic subject, it is inherently topological in nature: the…
A co-valuation is, essentially, a minimal finite cover. We introduce a logic based on co-valuations, which play the role of valuations of free variables in classical first-order logic, and show that the fundamental tools of model theory --…
We define a notion on preadditive categories which plays a role similar to the notion of a Grothendieck pretopology on an unenriched category. Each such additive pretopology defines an additive Grothendieck topology and suffices to define…
With a model of a geometric theory in an arbitrary topos, we associate a site obtained by endowing a category of generalized elements of the model with a Grothendieck topology, which we call the antecedent topology. Then we show that the…
The development of mathematics has been characterized by the increasing interconnectivity of seemingly separate disciplines. Such interplay has been facilitated by a massive development in formalism; category theory has provided a common…
Through the subsequent discussion we consider a certain particular sort of (topological) algebras, which may substitute the `` structure sheaf algebras'' in many--in point of fact, in all--the situations of a geometrical character that…
Algorithmicists are well-aware that fast dynamic programming algorithms are very often the correct choice when computing on compositional (or even recursive) graphs. Here we initiate the study of how to generalize this folklore intuition to…
We study relationships between the Nisnevich topology on smooth schemes and certain Grothendieck topologies on proper and not necessarily proper modulus pairs which were introduced respectively in [9] and [3]. Our results play an important…
Covering problems belong to the foundation of graph theory. There are several types of covering problems in graph theory such as covering the vertex set by stars (domination problem), covering the vertex set by cliques (clique covering…
Rough set theory, a mathematical tool to deal with inexact or uncertain knowledge in information systems, has originally described the indiscernibility of elements by equivalence relations. Covering rough sets are a natural extension of…
Grothendieck Duality -- the theory of the twisted inverse image pseudofunctor (-)^! over a suitable category of scheme-maps -- can be developed concretely, with emphasis on explicit constructions, or abstractly, with emphasis on…
We use categorification of monoid actions to study algebraic geometry over symmetric monoidal categories. This brings together the relative algebraic geometry over symmetric monoidal categories developed by To\"{e}n and Vaqui\'{e}, along…
In this paper, we unify various approaches to generalized covering space theory by introducing a categorical framework in which coverings are defined purely in terms of unique lifting properties. For each category $\mathcal{C}$ of…
The concept of typed topological space is introduced, for which open sets in a topology on a finite set will be assigned types (from lattice). The neighborhood system of a point, the closure and the connectedness can be defined according to…
This is an expended and revised version of the preprint "Schematization of homotopy types". The purpose of this work is to introduce a notion of \emph{affine stacks}, which is a homotopy version of the notion of affine schemes, and to give…
This series of works revisits the geometry, dynamics, and covariant phase space of spherically symmetric spacetimes with the aim of exploring the thermodynamics of spacetime from their dynamical properties. In this first paper, we examine…
Typical-case computation complexity is a research topic at the boundary of computer science, applied mathematics, and statistical physics. In the last twenty years the replica-symmetry-breaking mean field theory of spin glasses and the…
Frame theory is recently an active research area in mathematics, computer science and engineering with many exciting applications in a variety of different fields. This theory has been generalized rapidly and various generalizations of…
This chapter is an up-to-date account of results on globally hyperbolic spacetimes, and serves several purposes. We begin with the exposition of results from a foundational level, where the main tools are order theory and general topology,…