The Mermin Fixed Point

Foundations of Physics 33 (11):1691-1698 (2003)
  Copy   BIBTEX

Abstract

The most efficient known method for solving certain computational problems is to construct an iterated map whose fixed points are by design the problem's solution. Although the origins of this idea go back at least to Newton, the clearest expression of its logical basis is an example due to Mermin. A contemporary application in image recovery demonstrates the power of the method.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Yet another hierarchy theorem.Max Kubierschky - 2000 - Journal of Symbolic Logic 65 (2):627-640.
The Fixed Point Property in Modal Logic.Lorenzo Sacchetti - 2001 - Notre Dame Journal of Formal Logic 42 (2):65-86.
Fixed point logics.Anuj Dawar & Yuri Gurevich - 2002 - Bulletin of Symbolic Logic 8 (1):65-88.
On Non-wellfounded Sets as Fixed Points of Substitutions.Matti Pauna - 2001 - Notre Dame Journal of Formal Logic 42 (1):23-40.
Guarded quantification in least fixed point logic.Gregory McColm - 2004 - Journal of Logic, Language and Information 13 (1):61-110.
Comparing fixed-point and revision theories of truth.Philip Kremer - 2009 - Journal of Philosophical Logic 38 (4):363-403.
Some unifying fixed point principles.Raymond M. Smullyan - 1991 - Studia Logica 50 (1):129 - 141.

Analytics

Added to PP
2013-12-01

Downloads
17 (#846,424)

6 months
5 (#629,136)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Add more references