Creativeness and completeness in recursion categories of partial recursive operators

DOI10.2307/2274763zbMATH Open0714.03041OpenAlexW2064269870MaRDI QIDQ3199409FDOQ3199409

Authors: Franco Montagna, Andrea Sorbi 

Publication date: 1989

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

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

Recommendations

• REDUCIBILITY IN SOME CATEGORIES OF PARTIAL RECURSIVE OPERATORS
• scientific article; zbMATH DE number 3950509
• scientific article; zbMATH DE number 3979049
• Some properties of the syntactic p-recursion categories generated by consistent, recursively enumerable extensions of Peano arithmetic.
• Precomplete Equivalence Relations in Dominical Categories

zbMATH Keywords

completenessdominical categorycreativenesscategory-theoretic approach to recursion theorycreative domain relative to a criterionpartial recursive operatorsrecursion category

Mathematics Subject Classification ID

Abstract and axiomatic computability and recursion theory (03D75) Categories of machines, automata (18B20)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Creative sets

Cited In (7)

• Recursive categoricity and persistence
• REDUCIBILITY IN SOME CATEGORIES OF PARTIAL RECURSIVE OPERATORS
• Lightface $$\mathop {\varPi }\nolimits _{3}^{0}$$ Π 3 0 -Completeness of Density Sets Under Effective Wadge Reducibility
• Obituary: Franco Montagna (1948--2015)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A relativization mechanism in recursion categories

This page was built for publication: Creativeness and completeness in recursion categories of partial recursive operators

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