Fixed point theorems in computability theory

DOI10.1007/978-3-031-61716-4_14MaRDI QIDQ7030780zbMATH OpenFDO

Authors Sebastiaan A. Terwijn

Publication date 7 February 2025

Full work available at URL https://doi.org/10.1007/978-3-031-61716-4_14

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• A survey on universal computably enumerable equivalence relations
• A Universal Approach to Self-Referential Paradoxes, Incompleteness and Fixed Points
• Classical recursion theory. The theory of functions and sets of natural numbers
• Classifying positive equivalence relations
• Computability in partial combinatory algebras
• Descriptive set theory
• Embeddings between partial combinatory algebras
• Fixed point theorems for precomplete numberings
• Fixed-point selection functions
• Fixpoints and relative precompleteness
• GENERALIZATIONS OF THE RECURSION THEOREM
• Higher-order computability
• scientific article; zbMATH DE number 3827843 (Why is no real title available?)
• scientific article; zbMATH DE number 3735770 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 3536064 (Why is no real title available?)
• scientific article; zbMATH DE number 3556031 (Why is no real title available?)
• scientific article; zbMATH DE number 722611 (Why is no real title available?)
• scientific article; zbMATH DE number 3346618 (Why is no real title available?)
• Index sets of quotient objects of the Post numeration
• Introduction to Turing categories
• Kleene's amazing second recursion theorem
• On fixed-point theorems in synthetic computability
• On notation for ordinal numbers.
• Ordinal analysis of partial combinatory algebras
• Partial combinatory algebra and generalized numberings
• Realizability. An introduction to its categorical side
• Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion
• The lambda calculus. Its syntax and semantics. Rev. ed.
• The noneffectivity of Arslanov's completeness criterion and related theorems
• Weakly precomplete computably enumerable equivalence relations
• ∏ 0 1 Classes and Degrees of Theories

Cited in

(1)

• Relative completeness of arithmetical numberings

This page was built for publication: Fixed point theorems in computability theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7030780)