• Korean Journal of Logic
• /
• v.16 no.3
• /
• pp.381-406
• /
• 2013

This paper deals with the question whether the para-completeness theory of Kripkian style can avoid the revenge problem. According to the para-completeness theory, there are some sentences that are neither true nor false. And the liar sentence is the exemplar of such sentences. But the para-completeness theory has been criticised to give rise to the revenge problem, since Kripke suggested his theory. Maudlin argues that he can construct the para-completeness theory which avoids the problem by appealing to his foundationalist semantics. The aim of this paper shows that the para-completeness theory, including Maudlin's, cannot avoid the problem. Furthermore, it is argued that Maudlin's view is ad hoc suggestion just to avoid the problem.