Computable structure theory of partial combinatory algebras

DOI10.1007/978-3-031-64309-5_21MaRDI QIDQ7030900zbMATH OpenFDO

Authors E. B. Fokina, Sebastiaan A. Terwijn

Publication date 7 February 2025

Full work available at URL https://doi.org/10.1007/978-3-031-64309-5_21

zbMATH Keywords

computably enumerable structuresindex setisomorphism problempartial combinatory algebrapartial structures

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Cites work

• \(\Sigma_1^0\) and \(\Pi_1^0\) equivalence structures
• A journey to computably enumerable structures (tutorial lectures)
• A sufficient condition for completability of partial combinatory algebras
• ALGORITHMIC PROBLEMS IN VARIETIES
• Classical recursion theory. The theory of functions and sets of natural numbers
• Classical recursion theory. Vol. II
• Classifying positive equivalence relations
• Classifying word problems of finitely generated algebras via computable reducibility
• Computability and models. Perspectives east and west
• Computability-theoretic properties of injection structures
• Computably enumerable equivalence relations
• Constructivism in mathematics. An introduction. Volume I
• Descriptive set theory
• Embeddings between partial combinatory algebras
• Extensional realizability
• Extensional realizability for intuitionistic set theory
• Finitely presented expansions of groups, semigroups, and algebras
• Higher-order computability
• scientific article; zbMATH DE number 3900744 (Why is no real title available?)
• scientific article; zbMATH DE number 4053598 (Why is no real title available?)
• scientific article; zbMATH DE number 194101 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 3503199 (Why is no real title available?)
• scientific article; zbMATH DE number 3556031 (Why is no real title available?)
• scientific article; zbMATH DE number 1302872 (Why is no real title available?)
• scientific article; zbMATH DE number 722611 (Why is no real title available?)
• scientific article; zbMATH DE number 2047478 (Why is no real title available?)
• scientific article; zbMATH DE number 1405588 (Why is no real title available?)
• scientific article; zbMATH DE number 3216177 (Why is no real title available?)
• Isomorphism relations on computable structures
• ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS
• Ordered partial combinatory algebras
• Ordinal analysis of partial combinatory algebras
• Realizability and recursive set theory
• Realizability. An introduction to its categorical side
• Recursive Pseudo-Well-Orderings
• The lambda calculus. Its syntax and semantics. Rev. ed.
• The word problem
• Theorie der Numerierungen I
• Turing's legacy. Developments from Turing's ideas in logic
• Word problems and ceers

Cited in

(1)

• Completions of Kleene's second model

This page was built for publication: Computable structure theory of partial combinatory algebras

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