Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2603.11624

An observer-based approach to the sorites paradox and the logic derived from that

Athanassios Tzouvaras
View original source ↗Read source document ↗Export metadata ↓

Abstract

We approach the sorites paradox (SP) through an observer-based and time-dependent approach to truth of vague assertions. Formally the approach gives rise to a semantics, called fluxing-object semantics (FOS), because it involves models that contain ``fluxing objects'', that is, entities changing with time and observer. The models are equipped with agents (observers) and a linear and discrete time axis for time. The changing entities are represented by partial functions of time and agent, and this partiality causes truth-value gaps. If we interpret a truth-value gap as a third truth value, then FOS becomes a three-valued logic, which, quite interestingly, is proved identical to strong Kleene three-valued logic. The sorites phenomena can be represented in a structure of FOS as special objects that change imperceptibly with respect to an observer and with respect to a particular attribute. In this account the key point that eliminates the paradoxical character of sorites is the partiality of functions. When the observer is fixed the partiality corresponds to interrupted watching on his part. The interruption creates watching gaps during which the attributed property of the object as understood by the observer may change, without violating the imperceptibility condition. Interrupted watching has, according to experts on visual attention and focusing capabilities of humans, a firm physiological justification. The relationship of watching gaps with horizon crossing is also discussed.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Athanassios Tzouvaras. 2026-03-12. An observer-based approach to the sorites paradox and the logic derived from that. https://doi.org/10.1093/jigpal%2Fjzaf028

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↗