scientific article; zbMATH DE number 1390024
From MaRDI portal
Publication:4934289
Recommendations
Cited in
(81)- On the classification of (effective) \(\varphi \)-spaces
- Universal generalized computable numberings and hyperimmunity
- Some absolute properties of \(A\)-computable numberings
- Elementary theories and hereditary undecidability for semilattices of numberings
- The Rogers semilattices of generalized computable enumerations
- Strong reducibility of partial numberings
- Peano's concept of number
- Amount of nonconstructivity in deterministic finite automata
- Outline of partial computability in computable topology
- Theories of Rogers semilattices of analytical numberings
- Absolute and relative properties of negatively numbered families
- Precomplete numberings
- On the degrees of constructively immune sets
- The fixed-point property for represented spaces
- On \(p \)-universal and \(p \)-minimal numberings
- Completeness of the hyperarithmetic isomorphism equivalence relation
- Computable reducibility of metrics on the reals
- Classifying equivalence relations in the Ershov hierarchy
- Completion of choice
- Learnability and positive equivalence relations
- On computably enumerable structures
- On the degree structure of equivalence relations under computable reducibility
- Weakly precomplete equivalence relations in the Ershov hierarchy
- Reductions between types of numberings
- Generalized computable universal numberings
- Graphs realised by r.e. equivalence relations
- Minimal generalized computable enumerations and high degrees
- Effective categoricity for distributive lattices and Heyting algebras
- Inductive inference and computable numberings
- Effectivity questions for Kleene's recursion theorem
- Minimal generalized computable numberings and families of positive preorders
- Computability and universal determinability of negatively representable models
- Complexity of \(\Sigma^0_n\)-classifications for definable subsets
- Some remarks on completions of numberings
- Rice's theorem in effectively enumerable topological spaces
- CONNECTIONS BETWEEN IDENTIFYING FUNCTIONALS, STANDARDIZING OPERATIONS, AND COMPUTABLE NUMBERINGS
- On a Question of Frank Stephan
- Numberings and randomness
- Program self-reference in constructive Scott subdomains
- Equivalence Relations on Classes of Computable Structures
- Amount of Nonconstructivity in Finite Automata
- Computable elements and functions in effectively enumerable topological spaces
- A Friedberg enumeration of equivalence structures
- Enumerations of ^0_1 classes: acceptability and decidable classes
- Computability of Subsets of Metric Spaces
- Rogers semilattices of punctual numberings
- On isomorphism classes of computably enumerable equivalence relations
- Weihrauch goes Brouwerian
- One note on positive A-computable numberings
- Friedberg numberings in the Ershov hierarchy
- Two theorems on minimal generalized computable numberings
- Effectively infinite classes of numberings of computable families of reals
- 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 two types of concept lattices in the theory of numberings
- 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
- A family with a single minimal but not least numbering
- On Non-principal Arithmetical Numberings and Families
- On computable numberings of families of Turing degrees
- On the computability of ordered fields
- Effectively infinite classes of numberings and fixed point theorems
- Some properties of precompletely and positively numbered sets
- On cardinalities of Rogers semilattices for families in the Ershov hierarchy
- Fixed point theorems for minimal numberings
- Notes on classes of minimal numberings of arithmetical set families
- Unoids with finiteness conditions over computably separable equivalences
- On infinite direct sums of minimal numberings of functional families
- A family whose computable numberings are all complete
- Control structures in computable numberings and the completion operator
- On e-principal and e-complete numberings
- On the group of computable automorphisms of the linear order of the reals
- Relative completeness of arithmetical numberings
- On the number of minimal elements of ideals of Rogers semilattices
- Computably enumerable sets of reals in constructive mathematical analysis
- Recursion theorems in numbered sets
- Reducibilities among equivalence relations induced by recursively enumerable structures
- Effectively closed sets and enumerations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4934289)
