Effective operations in a general setting

DOI10.2307/2270370MaRDI QIDQ5623673zbMATH OpenOpenAlexFDO

Authors Alistair H. Lachlan

Publication date 1964

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2270370

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Computability and recursion theory (03D99)

Cites work

• A Comparison of Five “Computable” Operators
• Effective operations on partial recursive functions
• Some Stone spaces and recursion theory

Cited in

(8)

• Lower bounds on degrees of game-theoretic structures
• On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making
• Topological variants of the continuity theorem for mappings and related theorems
• Constructive functionals in spaces of almost-periodic functions
• An Effective Operator, Continuous but not Partial Recursive
• Effective second countability in computable analysis
• Multi-representation associated to the numbering of a subbasis and formal inclusion relations
• Effective bases and notions of effective second countability in computable analysis

This page was built for publication: Effective operations in a general setting

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