A Kripkean approach to unknowability and truth (Q5937827): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(5 intermediate revisions by 5 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1305/ndjfl/1039182253 / rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1305/ndjfl/1039182253 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2088271203 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3993251 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The truth is never simple / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A theory of formal truth arithmetically equivalent to ID<sub>1</sub> / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4146722 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A paradox regained / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Outline of a Theory of Truth / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some remarks on extending and interpreting theories with a partial predicate for truth / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1305/NDJFL/1039182253 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 12:05, 9 December 2024
scientific article; zbMATH DE number 1620822
Language | Label | Description | Also known as |
---|---|---|---|
English | A Kripkean approach to unknowability and truth |
scientific article; zbMATH DE number 1620822 |
Statements
A Kripkean approach to unknowability and truth (English)
0 references
17 July 2001
0 references
The author introduces and carefully discusses four inductive hierarchy rules for defining the extension and anti-extension of both the truth predicate and the predicate `is knowable in principle by a fixed epistemic subject'. The preferred rule \(R_3\) has the wanted property that at the least fixed point, the absolute Gödel sentence, which says of itself that it is unknowable, comes out true, and the absolute knower sentence, which says of its own negation that it is knowable, comes out false. A suitable interaction between truth and unknowability is required and argued for.
0 references
knowability predicate
0 references
inductive hierarchy rules
0 references
truth predicate
0 references
fixed point
0 references
unknowability
0 references