Search arXiv⌕ Search

arXiv · 2610.17388

Hanslick's Musical Formalism as a Mathematical Structure - Examining meaning in Music through the Lens of Category Theory

Abstract

We investigate Eduard Hanslicks formalist aesthetics through the prism of Category Theory

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ilyas Khan. 2026-10-12. Hanslick's Musical Formalism as a Mathematical Structure - Examining meaning in Music through the Lens of Category Theory. https://arxiv.org/abs/2610.17388

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

KEEP EXPLORING

Related papers

What kind of linearly distributive category do polynomial functors form?

This paper has two purposes. The first is to extend the theory of linearly distributive categories by considering the structures that emerge in a special case: the normal duoidal category $(\mathsf{Poly} ,\mathcal{y}, \otimes, \triangleleft )$ of polynomial functors under Dirichlet and substitution product. This is an isomix LDC which is neither $*$-autonomous nor fully symmetric. The additional structures of interest here are a closure for $\otimes$ and a co-closure for $\triangleleft$, making $\mathsf{Poly}$ a bi-closed LDC, which is a notion we introduce in this paper. The second purpose is to use $\mathsf{Poly}$ as a source of examples and intuition about various structures that can occur in the setting of LDCs, including duals, cores, linear monoids, and others, as well as how these generalize to the non-symmetric setting. To that end, we characterize the linearly dual objects in $\mathsf{Poly}$: every linear polynomial has a right dual which is a representable. It turns out that the linear and representable polynomials also form the left and right cores of $\mathsf{Poly}$. Finally, we provide examples of linear monoids, linear comonoids, and linear bialgebras in $\mathsf{Poly}$.

math.CT↗

A Compositional Account of Generalized Reversible Computing

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 equivalence relation of its domain. We model computational and physical transformations as subdistribution matrices over the category of sets and partitioned matrices on partitioned sets, respectively. We show that the interactions between the physical and computational transformations are governed by an aggregation functor whose functoriality and monoidality we deduce from general principles of the formal theory of monads. We study the associated copy-discard structures, in particular, general conditions for determinism and partial invertibility. We then define several notions of entropies that we use to state and prove the fundamental theorem of generalized reversible computing.

math.CT↗

Beth companions of finitary essentially algebraic theories

For categories, being balanced (meaning that every arrow that is both epic and monic is an isomorphism) can be regarded as a strong tameness property which plays an important role, for example, in algebra and logic. We study the problem of associating a balanced companion category, called a \emph{Beth companion}, to a locally finitely presentable category (equivalently, the category of models of a finitary essentially algebraic theory). We show that, if it exists, the Beth companion is unique and can be described in terms of \emph{saturated} objects. Under additional assumptions, we prove that Beth companions can be computed as orthogonality classes, and admit a syntactic presentation via Gabriel--Ulmer duality. Furthermore, we establish conditions for the transfer of properties from a category to its Beth companion. A number of examples of categories that do or do not admit a Beth companion are provided. In particular, we show that the category of commutative rings does not admit a Beth companion, and employ Pierce sheaf representations to describe the Beth companion of other classes of rings.

math.CT↗