Switch to: References

Add citations

You must login to add citations.
  1. Paradoxes.Piotr Łukowski - 2011 - Dordrecht and New York: Springer.
    This book, provides a critical approach to all major logical paradoxes: from ancient to contemporary ones. There are four key aims of the book: 1. Providing systematic and historical survey of different approaches – solutions of the most prominent paradoxes discussed in the logical and philosophical literature. 2. Introducing original solutions of major paradoxes like: Liar paradox, Protagoras paradox, an unexpected examination paradox, stone paradox, crocodile, Newcomb paradox. 3. Explaining the far-reaching significance of paradoxes of vagueness and change for philosophy (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Psychophysiological approach to the Liar paradox: Jean Buridan’s virtual entailment principle put to the test.Konrad Rudnicki & Piotr Łukowski - 2019 - Synthese 198 (S22):5573-5592.
    This article presents an empirical examination of the consequences of the virtual entailment principle proposed by Jean Buridan to resolve the Liar paradox. This principle states that every sentence in natural language implicitly asserts its own truth. Adopting this principle means that the Liar sentence is not paradoxical but false, because its content is contradictory to what is virtually implied. As a result, humans should perceive the Liar sentence the same way as any other false sentence. This solution to the (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Linguistics, Logic and the Liar Paradox. Comments on the Article by A. Gawroński ”The ’liar sentence’ as a Recurring Sentence Function (’the Polish Solution’)”.Jan Woleński - 2004 - Studia Semiotyczne—English Supplement 25:10-20.
    There are many versions of the Liar Paradox. J. Agassi names 13 of them. But the most important one is related to Tarski’s theorem that the truth predicate is non-definable for systems that are sufficient for the formalisation of elementary arithmetic of natural numbers. Let S be such a system. We assume that S is consistent and that the syntax of S has been arithmetized as understood by G¨odel. Let E be any sentence of S. E ∗ is the symbol (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark