Precomplete Equivalence Relations in Dominical Categories

DOI10.2307/2045781MaRDI QIDQ3741621zbMATH OpenOpenAlexFDO

Authors Claudio Bernardi

Publication date 1986

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

zbMATH Keywords

categorical approach to recursion theoryFixed Point Theoremincompletenessprecomplete equivalence relationprecompletenessrecursion categories

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Abstract and axiomatic computability and recursion theory (03D75) Categorical logic, topoi (03G30)

Recommendations

• Dominical categories: recursion theory without elements
• On Some Properties of Recursively Enumerable Equivalence Relations
• Some properties of the syntactic p-recursion categories generated by consistent, recursively enumerable extensions of Peano arithmetic.
• \(\Sigma^ n_ 0\)-equivalence relations
• scientific article; zbMATH DE number 3950509

Cites work

• Classifying positive equivalence relations
• Dominical categories: recursion theory without elements
• Equivalence relations induced by extensional formulae: classification by means of a new fixed point property
• scientific article; zbMATH DE number 3906415 (Why is no real title available?)
• scientific article; zbMATH DE number 3950509 (Why is no real title available?)
• scientific article; zbMATH DE number 3989334 (Why is no real title available?)
• scientific article; zbMATH DE number 3735770 (Why is no real title available?)
• The hereditary partial effective functionals and recursion theory in higher types

Cited in

(11)

• Combinatory completeness without classical equality
• Categories of partial equivalence relations as localizations
• Creativeness and completeness in recursion categories of partial recursive operators
• scientific article; zbMATH DE number 3979049 (Why is no real title available?)
• scientific article; zbMATH DE number 3989334 (Why is no real title available?)
• Recursive categoricity and persistence
• Dominical categories: recursion theory without elements
• On Some Properties of Recursively Enumerable Equivalence Relations
• Some properties of the syntactic p-recursion categories generated by consistent, recursively enumerable extensions of Peano arithmetic.
• scientific article; zbMATH DE number 1895008 (Why is no real title available?)
• Determinisation of relational substitutions in ordered categories with domain

This page was built for publication: Precomplete Equivalence Relations in Dominical Categories

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