Tbilisi Mathematical Journal

On fixed-point theorems in synthetic computability

Andrej Bauer

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

Lawvere's fixed point theorem captures the essence of diagonalization arguments. Cantor's theorem, Gödel's incompleteness theorem, and Tarski's undefinability of truth are all instances of the contrapositive form of the theorem. It is harder to apply the theorem directly because non-trivial examples are not easily found, in fact, none exist if excluded middle holds.

We study Lawvere's fixed-point theorem in synthetic computability, which is higher-order intuitionistic logic augmented with the Axiom of Countable Choice, Markov's principle, and the Enumeration axiom, which states that there are countably many countable subsets of $\mathbb{N}$. These extra-logical principles are valid in the effective topos, as well as in any realizability topos built over Turing machines with an oracle, and suffice for an abstract axiomatic development of a computability theory.

We show that every countably generated $\omega$-chain complete pointed partial order ($\omega$cppo) is countable, and that countably generated $\omega$cppos are closed under countable products. Therefore, Lawvere's fixed-point theorem applies and we obtain fixed points of all endomaps on countably generated $\omega$cppos. Similarly, the Knaster-Tarski theorem guarantees existence of least fixed points of continuous endomaps. To get the best of both theorems, namely that all endomaps on domains ($\omega$cppos generated by a countable set of compact elements) have least fixed points, we prove a synthetic version of the Myhill-Shepherdson theorem: every map from an $\omega$cpo to a domain is continuous. The proof relies on a new fixed-point theorem, the synthetic Recursion Theorem, so called because it subsumes the classic Kleene-Rogers Recursion Theorem. The Recursion Theorem takes the form of Lawvere's fixed point theorem for multi-valued endomaps.

Note

This material is based upon work supported by the Air Force Office of Scientific Research, Air Force Materiel Command, USAF under Award No. FA9550-14-1-0096

Article information

Source
Tbilisi Math. J., Volume 10, Issue 3 (2017), 167-181.

Dates
Received: 30 September 2017
Revised: 29 October 2017
First available in Project Euclid: 20 April 2018

Permanent link to this document
https://projecteuclid.org/euclid.tbilisi/1524232079

Digital Object Identifier
doi:10.1515/tmj-2017-0107

Mathematical Reviews number (MathSciNet)
MR3725758

Zentralblatt MATH identifier
06816534

Subjects
Primary: 03D75: Abstract and axiomatic computability and recursion theory
Secondary: 54H25: Fixed-point and coincidence theorems [See also 47H10, 55M20] 03F65: Other constructive mathematics [See also 03D45]

Keywords
synthetic computability fixed-point theorems continuity principles

Citation

Bauer, Andrej. On fixed-point theorems in synthetic computability. Tbilisi Math. J. 10 (2017), no. 3, 167--181. doi:10.1515/tmj-2017-0107. https://projecteuclid.org/euclid.tbilisi/1524232079


Export citation