scispace - formally typeset
Journal ArticleDOI

An Illocutionary Logical Explanation of the Surprise Execution

John T. Kearns
- 02 Oct 1999 - 
- Vol. 20, pp 195-213
TLDR
This paper further develops the system of illocutionary logic to accommodate an ‘I believe that’ operator and resolve Moore's Paradox and shows that the logical system can be expanded to resolve the surprise execution paradox puzzle.
Abstract
This paper further develops the system of illocutionary logic presented in ‘Propositional logic of supposition and assertion’ (Notre Dame Journal of Formal Logic 1997, 38, 325-349) to accommodate an ‘I believe that’ operator and resolve Moore's Paradox. This resolution is accomplished by providing both a truth-conditional and a commitment-based semantics. An important feature of the logical system is that the correctness of some arguments depends on who it is that makes the argument. The paper then shows that the logical system can be expanded to resolve the surprise execution paradox puzzle. The prisoner's argument showing that he can't be executed by surprise is correct but his beliefs are incoherent. The judge's beliefs (and our beliefs) about this situation are not incoherent.

read more

Citations
More filters
Journal ArticleDOI

The Surprise Examination or Unexpected Hanging Paradox

TL;DR: The surprise examination or Unexpected hanging paradox as mentioned in this paper is a classic example of a paradox in the setting of algebraic geometry, and it has been studied extensively in the literature.
Journal ArticleDOI

Conditional assertion, denial, and supposition as illocutionary acts

TL;DR: In this article, the use of conditional sentences to make conditional assertions, as well as their use for making conditional denials and suppositions, has been studied in the context of illocutionary logic.
Journal ArticleDOI

An Illocutionary Logical Explanation of the Liar Paradox

TL;DR: In this article, the authors use the resources of illocutionary logic to provide a new understanding of the Liar Paradox, in which denials are irreducible counterparts of assertions; denial does not in every case amount to the same as the assertion of the negation of the statement that is denied.
Posted Content

Is Classical Mathematics Appropriate for Theory of Computation

Farzad Didehvar
- 01 May 2017 - 
TL;DR: The concept of turning back in time in paradoxes causes inconsistency in modeling of the concept of Time in some semantic situations, and it is demonstrated that any formalized system for the Theory of Computation based on Classical Logic and Turing model leads us to a contradiction.

Russell's Epistemic Understanding of Logic

TL;DR: In this article, a theory of speech acts is used to sketch an account of referring which explains how we use language to access objects in the world, the very objects we intend.
References
More filters
Book

How to do things with words

TL;DR: In this paper, the authors presented a series of lectures with the following topics: Lecture I * Lecture II* Lecture III * Lectures IV* Lectures V * LectURE VI * LectURES VI * LII * LIII * LIV * LVI * LIX
Journal ArticleDOI

Propositional Logic of Supposition and Assertion

TL;DR: In this paper, the relations between truth conditions and commitment conditions, and between semantic concepts defined in terms of these conditions are explored. But the relation between truth and commitment is not explored.
Journal ArticleDOI

A procedural solution to the unexpected hanging and Sorites paradoxes

TL;DR: The paradox of the Unexpected Hanging, related prediction paradoxes, and the sorites paradoxes all involve reasoning about ordered collections of entities: days ordered by date and men ordered by the number of hairs on their heads in the case of the bald man version of the sorite.
Journal ArticleDOI

Conflict and Co-ordination in the Aftermath of Oracular Statements

TL;DR: In the famous puzzle of the surprise execution, it is indisputable that the judge's announcement of the sentence does not make fulfilment of that sentence impossible, and so it follows that the sentence is both self-consistent and consistent with the prisoner's knowledge of it.