Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2104.13288

The Geometrization of Meaning

Michael Heller
View original source ↗Read source document ↗Export metadata ↓

Abstract

One of the greatest problems in philosophy is that of meaning. The turning point in thinking on meaning was Tarski's definition of truth, and the rapid development of logical semantics and model theory was a consequence of this achievement. Perhaps less well-known among classical logicians and philosophers is that it is category theory that provides adequate mathematical tools to study the relationship between the syntax of formalized theories and their semantics. The aim of this article is to change this situation and make a preliminary philosophical analysis of the results obtained so far. They concern formalized algebraic theories with axioms in the form of equational laws, theories based on propositional logic and coherent Boolean logic, as well as decidable logic which is not necessarily Boolean. The syntactic-semantics relation for these theories takes the form of dualisms between the respective syntactic and semantic categories. These dualisms are given by the appropriate adjoint functors. In all the considered cases, the syntax--semantics dualism corresponds to the algebra-geometry dualism. We analyze the philosophical significance of these results. They allow us to look at the problem of meaning in a new light and formulate a criterion distinguishing formal theories from empirical theories. The disputes that were once fought over Tarski's definition of truth are transferred to a new context. The polemics as to whether Tarski actually succeeded in reducing the problem of meaning to purely syntactic terms has been superseded: between the syntactic and semantic categories there is not a relation of reducibility but rather that of interaction, and this relation is given by adjoint functors. We also touch upon other philosophical aspects of the categorical approach to the problem of meaning.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Michael Heller. 2021-04-27. The Geometrization of Meaning. https://arxiv.org/abs/2104.13288

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

KEEP EXPLORING

Related papers

arXiv2026

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO↗
arXiv2026

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO↗
arXiv2026

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO↗