On fixed-point theorems in synthetic computability

DOI10.1515/TMJ-2017-0107zbMath1403.03076OpenAlexW2768826633MaRDI QIDQ1683373

Andrej Bauer

Publication date: 8 December 2017

Published in: Tbilisi Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/tmj-2017-0107

zbMATH Keywords

fixed-point theoremscontinuity principlessynthetic computability

Mathematics Subject Classification ID

Fixed-point and coincidence theorems (topological aspects) (54H25) Other constructive mathematics (03F65) Abstract and axiomatic computability and recursion theory (03D75)

Cites Work

• Metric spaces in synthetic topology
• Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
• A lattice-theoretical fixpoint theorem and its applications
• Church's thesis without tears
• Effective operations on partial recursive functions
• Foundations for Computable Topology
• On notation for ordinal numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On fixed-point theorems in synthetic computability