T-schema deflationism versus Godel's first incompleteness theorem Export

@article{citeulike:552180, author = {Gauker, Christopher}, citeulike-article-id = {552180}, citeulike-linkout-0 = {http://www.blackwell-synergy.com/doi/abs/10.1111/1467-8284.00282}, citeulike-linkout-1 = {http://dx.doi.org/10.1111/1467-8284.00282}, comment = {T-schema deflationist claims that all that a theory of truth should amount to is listing all correct cases of T-schema. Gauker argues that all correct cases of T-schema in English are not enumerable. The basic argument is like that: (1) The set of true sentences of considered language includes all true sentences of arithmetics. (2) For any true sentence there is a T-schema instance which is materially equivalent to this sentence. (3) For any two distinct true sentences the corresponding instances of T-schema are different. (6) The set of true sentences of arithmetics is not effectively enumerable. (5)Therefore, the set of all T-schemas is not effectively enumerable.}, doi = {10.1111/1467-8284.00282}, journal = {Analysis}, keywords = {analytic, deflationism, philosophy, t-schema}, number = {270}, pages = {129--136}, posted-at = {2006-03-15 03:32:11}, priority = {0}, title = {T-schema deflationism versus Godel's first incompleteness theorem}, url = {http://dx.doi.org/10.1111/1467-8284.00282}, volume = {61}, year = {2001} }

TY - JOUR ID - citeulike:552180 L3 - citeulike-article-id:552180 IS - 270 JF - Analysis EP - 136 TI - T-schema deflationism versus Godel's first incompleteness theorem VL - 61 SP - 129 KW - analytic KW - deflationism KW - philosophy KW - t-schema N1 - T-schema deflationist claims that all that a theory of truth should amount to is listing all correct cases of T-schema. Gauker argues that all correct cases of T-schema in English are not enumerable. The basic argument is like that: (1) The set of true sentences of considered language includes all true sentences of arithmetics. (2) For any true sentence there is a T-schema instance which is materially equivalent to this sentence. (3) For any two distinct true sentences the corresponding instances of T-schema are different. (6) The set of true sentences of arithmetics is not effectively enumerable. (5)Therefore, the set of all T-schemas is not effectively enumerable. AU - Gauker, Christopher PY - 2001/// UR - http://dx.doi.org/10.1111/1467-8284.00282 ER -