In this paper I argue that it’s impossible for there to be a single universal theory of meaning for a language. First, I will consider some minimal expressiveness requirements a language must meet to be able to express semantic claims. Then I will argue that in order to have a single unified theory of meaning, these expressiveness requirements must be satisfied by a language which the semantic theory itself applies to. That is, we would need a language which can express its own meaning. It has been well-known since Tarski that theories of meaning whose central notion is truth can’t be expressed in a language which they apply to. Here, I develop Quine’s formulation of the Liar Paradox in grammatical terms and use this to extend Tarski’s resu...
Quine’s way of dealing with the semantical paradoxes (Ways of Paradox, pp. 9-10) is criticized. The ...
My thesis aims at contributing to classifying the Liar-like paradoxes (and related Truth-teller-like...
Tarski’s Indefinability Theorem can be generalized so that it applies to many-valued languages. We i...
§ 1. introduction. There are two main tasks in which writers on the Liar paradox might see themselve...
Abstract. Michael Kremer defines fixed-point logics of truth based on Saul Kripke’s fixed point sema...
International audienceThe Liar Paradox challenges logicians’ and semanticists’ theories of truth and...
Fully interpreted languages whose interpretations conform to classical logic have fully interpreted ...
Many researchers in Computer Science, Linguistics, Logic, and Philosophy have been discovering in va...
The traditional approach to Natural Language Semantics consists in equating the semantic content of ...
International audienceThe Liar Paradox challenges logicians’ and semanticists’ theories of truth and...
The liar paradox is a famous and ancient paradox related to logic and philosophy. It shows it is per...
ABSTRACT. Michael Kremer defines fixed-point logics of truth based on Saul Kripke’s fixed point sema...
My objective is to provide a theory of truth that is both independently motivated and compatible wit...
Languages which conform to classical logic have extensions for which a consistent theory of truth ca...
I argue that Tarski's truth schema (T) concerns meaning just as much as it concerns truth. Better sa...
Quine’s way of dealing with the semantical paradoxes (Ways of Paradox, pp. 9-10) is criticized. The ...
My thesis aims at contributing to classifying the Liar-like paradoxes (and related Truth-teller-like...
Tarski’s Indefinability Theorem can be generalized so that it applies to many-valued languages. We i...
§ 1. introduction. There are two main tasks in which writers on the Liar paradox might see themselve...
Abstract. Michael Kremer defines fixed-point logics of truth based on Saul Kripke’s fixed point sema...
International audienceThe Liar Paradox challenges logicians’ and semanticists’ theories of truth and...
Fully interpreted languages whose interpretations conform to classical logic have fully interpreted ...
Many researchers in Computer Science, Linguistics, Logic, and Philosophy have been discovering in va...
The traditional approach to Natural Language Semantics consists in equating the semantic content of ...
International audienceThe Liar Paradox challenges logicians’ and semanticists’ theories of truth and...
The liar paradox is a famous and ancient paradox related to logic and philosophy. It shows it is per...
ABSTRACT. Michael Kremer defines fixed-point logics of truth based on Saul Kripke’s fixed point sema...
My objective is to provide a theory of truth that is both independently motivated and compatible wit...
Languages which conform to classical logic have extensions for which a consistent theory of truth ca...
I argue that Tarski's truth schema (T) concerns meaning just as much as it concerns truth. Better sa...
Quine’s way of dealing with the semantical paradoxes (Ways of Paradox, pp. 9-10) is criticized. The ...
My thesis aims at contributing to classifying the Liar-like paradoxes (and related Truth-teller-like...
Tarski’s Indefinability Theorem can be generalized so that it applies to many-valued languages. We i...