An impossibility result for theories of type-free determinateness

Clicks: 1
ID: 314901
2026
Free PDF
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal

Ranked #40 of 48 articles by views in journal of pharmaceutical analysis

Most read Least read

Bar heights use a square-root scale.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Sign in to mint
Abstract
Abstract Halbach and Fujimoto have formulated an axiomatic theory of truth and determinateness, CD. They asked whether the theory can be augmented with a principle saying that all determinateness ascriptions are themselves determinate. We answer their question in the negative. In order to put the problem in a more abstract framework, we introduce the notion of `admissibility', and we obtain a general impossibility result for the class of admissible sentences. In particular, we show that under mild assumptions on the notion of admissibility, the principle that admissibility ascriptions are themselves admissible entails triviality over Strong Kleene logic, even without assuming the transparency of truth.
Reference Key
openalex_W7162314094 Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors Luca Castaldo, Maciej Głowacki, Bartosz Wcisło
Journal journal of pharmaceutical analysis
Year 2026
DOI
10.1093/analys/anag034
URL
https://doi.org/10.1093/analys/anag034
Keywords Keywords not found

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

Comments

No comments yet. Be the first to comment on this article.