Can a Many-Valued Language Functionally Represent its own Semantics?
dc.contributor.author
Ketland, Jeffrey
en
dc.date.accessioned
2006-07-13T16:19:47Z
dc.date.available
2006-07-13T16:19:47Z
dc.date.issued
2003
dc.description.abstract
Tarski’s Indefinability Theorem can be generalized so that it applies to many-valued languages. We introduce a notion of strong semantic self-representation applicable to any (sufficiently rich) interpreted many-valued language L. A sufficiently rich interpreted many-valued language L is SSSR just in case it has a function symbol n(x) such that, for any f Sent(L), the denotation of the term n(“f”) in L is precisely ||f||L, the semantic value of f in L. By a simple diagonal construction (finding a sentence l such that l is equivalent to n(“l”) T), it is shown that no such language strongly represents itself semantically. Hence, no such language can be its own metalanguage.
en
dc.format.extent
91143 bytes
en
dc.format.mimetype
application/pdf
en
dc.identifier.citation
Analysis 63/4, 292-297.
dc.identifier.uri
http://hdl.handle.net/1842/1341
dc.language.iso
en
dc.publisher
Blackwells
en
dc.subject
Philosophy
en
dc.subject
philosophy of mathematics
en
dc.title
Can a Many-Valued Language Functionally Represent its own Semantics?
en
dc.type
Article
en
Files
Original bundle
1 - 1 of 1
- Name:
- KetlandAnalysis2003MVL.pdf
- Size:
- 89.01 KB
- Format:
- Adobe Portable Document Format
This item appears in the following Collection(s)