Skip to main content
Log in

Some unifying fixed point principles

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

This article is written for both the general mathematican and the specialist in mathematical logic. No prior knowledge of metamathematics, recursion theory or combinatory logic is presupposed, although this paper deals with quite general abstractions of standard results in those three areas. Our purpose is to show how some apparently diverse results in these areas can be derived from a common construction. In Section 1 we consider five classical fixed point arguments (or rather, generalizations of them) which we present as problems that the reader might enjoy trying to solve. Solutions are given at the end of the section. In Section 2 we show how all these solutions can be obtained as special cases of a single fixed point theorem. In Section 3 we consider another generalization of the five fixed point results of Section 1 and show that this is of the same strength as that of Section 2. In Section 4 we show some curious strengthenings of results of Section 3 which we believe to be of some interest on their own accounts.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Smullyan, R.M. Some unifying fixed point principles. Stud Logica 50, 129–141 (1991). https://doi.org/10.1007/BF00370391

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00370391

Keywords

Navigation