scientific article; zbMATH DE number 1390024

Publication date: 14 November 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

survey index sets creativity computable numberings

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Theory of numerations, effectively presented structures (03D45)

Related Items (59)

The fixed-point property for represented spaces ⋮ On \(p \)-universal and \(p \)-minimal numberings ⋮ Rogers semilattices of punctual numberings ⋮ Completeness of the hyperarithmetic isomorphism equivalence relation ⋮ Effectivity questions for Kleene's recursion theorem ⋮ Rice’s Theorem in Effectively Enumerable Topological Spaces ⋮ Computable reducibility of metrics on the reals ⋮ Minimal generalized computable enumerations and high degrees ⋮ Effective categoricity for distributive lattices and Heyting algebras ⋮ Two theorems on minimal generalized computable numberings ⋮ On a Question of Frank Stephan ⋮ Computable elements and functions in effectively enumerable topological spaces ⋮ Effectively infinite classes of numberings of computable families of reals ⋮ Minimal generalized computable numberings and families of positive preorders ⋮ Rogers semilattices of limitwise monotonic numberings ⋮ Extremal numberings and fixed point theorems ⋮ ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS ⋮ ON ISOMORPHISM CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS ⋮ On two types of concept lattices in the theory of numberings ⋮ Reducibilities among equivalence relations induced by recursively enumerable structures ⋮ A Friedberg enumeration of equivalence structures ⋮ On the main scientific achievements of Victor Selivanov ⋮ Effectively infinite classes of numberings and computable families of reals ⋮ A local version of the Slaman-Wehner theorem and families closed under finite differences ⋮ On the embedding of the first nonconstructive ordinal in the Rogers semilattices ⋮ Computability and universal determinability of negatively representable models ⋮ Inductive inference and computable numberings ⋮ A family with a single minimal but not least numbering ⋮ Universal generalized computable numberings and hyperimmunity ⋮ Classifying equivalence relations in the Ershov hierarchy ⋮ Complexity of \(\Sigma^0_n\)-classifications for definable subsets ⋮ Amount of nonconstructivity in deterministic finite automata ⋮ Effectively closed sets and enumerations ⋮ Completion of choice ⋮ Some absolute properties of \(A\)-computable numberings ⋮ Elementary theories and hereditary undecidability for semilattices of numberings ⋮ Learnability and positive equivalence relations ⋮ The Rogers semilattices of generalized computable enumerations ⋮ Numberings and Randomness ⋮ Program Self-reference in Constructive Scott Subdomains ⋮ Equivalence Relations on Classes of Computable Structures ⋮ Friedberg numberings in the Ershov hierarchy ⋮ Strong reducibility of partial numberings ⋮ On computably enumerable structures ⋮ Outline of partial computability in computable topology ⋮ Theories of Rogers semilattices of analytical numberings ⋮ Absolute and relative properties of negatively numbered families ⋮ On the degree structure of equivalence relations under computable reducibility ⋮ Weakly precomplete equivalence relations in the Ershov hierarchy ⋮ Amount of Nonconstructivity in Finite Automata ⋮ On the classification of (effective) \(\varphi \)-spaces ⋮ Reductions between types of numberings ⋮ WEIHRAUCH GOES BROUWERIAN ⋮ Generalized computable universal numberings ⋮ Enumerations of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msubsup><mml:mi mathvariant="normal">Π</mml:mi><mml:mn>1</mml:mn><mml:mn>0</mml:mn></mml:msubsup></mml:math> Classes: Acceptability and Decidable Classes ⋮ Graphs realised by r.e. equivalence relations ⋮ Computability of Subsets of Metric Spaces ⋮ One note on positive A-computable numberings ⋮ On the degrees of constructively immune sets

This page was built for publication: