Search arXiv⌕ 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

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO↗
arXiv2026

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO↗
arXiv2026

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO↗