SearcharxivSearch

arXiv · 2012.11648

Rosen's no-go theorem for regular categories

Abstract

The famous biologist Robert Rosen argued for an intrinsic difference between biological and artificial life, supporting the claim that `living systems are not mechanisms'. This result, understood as the claim that life-like mechanisms are non-computable, can be phrased as the non-existence of an equivalence between a category of `static'/analytic elements and a category of `variable'/synthetic elements. The property of a system of being synthetic, understood as being the gluing of `variable families' of analytica, must imply that the latter class of objects does not retain sufficient information in order to describe said variability; we contribute to this thesis with an argument rooted in elementary category theory. Seen as such, Rosen's `proof' that no living system can be a mechanism arises from a tension between two contrapuntal needs: on one side, the necessity to consider (synthetically) variable families of systems; on the other, the necessity to describe a syntheticum via an universally chosen analyticum.

Explore related subjects

Keep this discovery

BibTeXRIS

Fosco Loregian. 2020-12-21. Rosen's no-go theorem for regular categories. https://arxiv.org/abs/2012.11648

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A model structure for cartesian 2-fibrations

Cartesian 2-fibrations provide a way to understand indexed categories, but their classical ``straightening'' construction requires several layers of weak coherence data. This paper develops a homotopical framework that replaces much of this bookkeeping with a fully strict model. By using marked 2-categories to record the cartesian morphisms and 2-cells, we construct a model structure whose fibrant objects are precisely the cartesian 2-fibrations over a fixed 2-category $\mathcal{C}$. We then show that the marked Grothendieck construction identifies these 2-fibrations, up to weak equivalence, with strict 2-functors from $\mathcal{C}$ into $2\mathrm{Cat}$. As an additional contribution, we construct localizations of 2-categories that simultaneously invert selected morphisms and 2-cells.

math.CT

A Natural Fuzzy Order on Fuzzy Numbers

This paper introduces a natural fuzzy order on fuzzy numbers that extends the natural orders on real numbers and interval numbers. We investigate its completeness properties and show that the space of uniformly bounded fuzzy numbers is conically complete and conically cocomplete, and that it is complete if and only if the underlying continuous t-norm is the G\"odel t-norm. Moreover, it is proved that this space constitutes a \([0,1]\)-enriched domain if and only if the underlying continuous t-norm satisfies the (S) condition. These results provide a foundation for ordering fuzzy numbers.

math.CT

Noetherian forms of free non-symmetric operads

In this paper, we study certain categories of labeled finite rooted ordered trees over a fixed set of labels where each label is equipped with an arity: a fixed number of children that the vertex with the given label must have. Equivalently, these are expression trees for operations in a free non-symmetric operad. A morphism between these trees matches a pruning of one tree (a prefix) with an entire subtree of another (a suffix). We characterize such categories, up to isomorphism, in terms of suitable exactness properties. It turns out that these categories exhibit strong algebraic behavior, in the sense that every such category, when appended with a strict initial object, has a particularly nice noetherian form.

math.CT