Studia Logica 90 (2):249 - 256 (2008)

Authors
Abstract
Sharvy’s puzzle concerns a situation in which common knowledge of two parties is obtained by repeated observation each of the other, no fixed point being reached in finite time. Can a fixed point be reached?
Keywords Philosophy   Computational Linguistics   Mathematical Logic and Foundations   Logic
Categories (categorize this paper)
DOI 10.1007/s11225-008-9153-2
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 50,118
Through your library

References found in this work BETA

Accelerating Turing Machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.
Tasks and Supertasks.James Thomson - 1954 - Analysis 15 (1):1--13.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

There is No Puzzle About Change.Pablo Rychter - 2009 - Dialectica 63 (1):7-22.
A Puzzle About Withholding.John Turri - 2012 - Philosophical Quarterly 62 (247):355-364.
Sharvy's Theory of Definite Descriptions Revisited.Berit Brogaard - 2007 - Pacific Philosophical Quarterly 88 (2):160–180.
A Pragmatic Solution to Ostertag’s Puzzle.Philip Atkins - 2013 - Philosophical Studies 163 (2):359-365.
Searle on Programs and Intentionality.Richard Sharvy - 1985 - Canadian Journal of Philosophy, Supplementary Volume 11:39-54.
Dogmatism Repuzzled.Assaf Sharon & Levi Spectre - 2010 - Philosophical Studies 148 (2):307 - 321.
A Puzzle About 'Because'.Benjamin Schnieder - 2010 - Logique Et Analyse 53.

Analytics

Added to PP index
2009-01-28

Total views
26 ( #373,284 of 2,324,560 )

Recent downloads (6 months)
3 ( #309,669 of 2,324,560 )

How can I increase my downloads?

Downloads

My notes