Productive sets and constructively nonpartial-recursive functions

DOI10.1007/BF01625833MaRDI QIDQ1105589zbMATH OpenOpenAlexFDO

Authors Akira Kanda

Publication date 1988

Published in Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01625833

zbMATH Keywords

constructively nonpartial-recursive functionsproductive sets

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Recursive functions and relations, subrecursive hierarchies (03D20) Computability and recursion theory (03D99)

Recommendations

• A proof-theoretic characterization of the primitive recursive set functions
• Recursive set constructions and iterated function systems. Separation conditions and dimension
• Productive functions and isomorphisms
• Provably recursive functions of constructive and relatively constructive theories
• Generalized recurrence and the nonwandering set for products
• On compactifications and product‐free sets
• Constructive sets in computable sets
• Products of Perfectly Meager Sets and Lusin's Function
• Products of Perfectly Meager Sets and Lusin's Function
• scientific article; zbMATH DE number 3885889

Cites work

• Constructively nonpartial recursive functions

Cited in

(4)

• On constructive and enumerable sets
• ON WAYS OF CHARACTERIZING COMPLETE SETS
• A Non-Uniformly C-Productive Sequence & Non-Constructive Disjunctions
• Effective Nonrecursiveness

This page was built for publication: Productive sets and constructively nonpartial-recursive functions

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