Ivan Soskov: a life in computability
From MaRDI portal
Publication:6599282
Recommendations
Cites work
- scientific article; zbMATH DE number 3841851 (Why is no real title available?)
- scientific article; zbMATH DE number 4145891 (Why is no real title available?)
- scientific article; zbMATH DE number 3933053 (Why is no real title available?)
- scientific article; zbMATH DE number 52976 (Why is no real title available?)
- scientific article; zbMATH DE number 3508476 (Why is no real title available?)
- scientific article; zbMATH DE number 598184 (Why is no real title available?)
- scientific article; zbMATH DE number 729927 (Why is no real title available?)
- scientific article; zbMATH DE number 218508 (Why is no real title available?)
- scientific article; zbMATH DE number 218551 (Why is no real title available?)
- scientific article; zbMATH DE number 3248010 (Why is no real title available?)
- scientific article; zbMATH DE number 3349780 (Why is no real title available?)
- scientific article; zbMATH DE number 2237372 (Why is no real title available?)
- scientific article; zbMATH DE number 2237373 (Why is no real title available?)
- A Jump Inversion Theorem for the Degree Spectra
- A Note on ω-Jump Inversion of Degree Spectra of Structures
- A criterion for completeness of degrees of unsolvability
- A jump inversion theorem for the enumeration jump
- Abstract Computability and Invariant Definability
- Abstract First Order Computability. I
- Arithmetical Reducibilities I
- Computability by means of effectively definable schemes and definability via enumerations
- Constructing minimal pairs of degrees
- Cupping and definability in the local structure of the enumeration degrees
- DEFINABILITY OF THE JUMP OPERATOR IN THE ENUMERATION DEGREES
- Definability via Kalimullin pairs in the structure of the enumeration degrees
- Definability via enumerations
- Degrees coded in jumps of orderings
- Degrees of Structures
- Degrees of Unsolvability. (AM-55)
- Effective properties of Marker's extensions
- Elementary induction on abstract structures
- Embedding countable partial orderings in the enumeration degrees and the \(\omega \)-enumeration degrees
- Embedding distributive lattices in the \(\Sigma ^0_2\) enumeration degrees
- Every Set has a Least Jump Enumeration
- Hyperenumeration reducibility
- Interpreting true arithmetic in the local structure of the enumeration degrees
- Intrinsically Hyperarithmetical Sets
- Intrinsically II Relations
- Jumps of quasi-minimal enumeration degrees
- New Computational Paradigms
- Notes on the Jump of a Structure
- On minimal pairs of enumeration degrees
- Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ2 sets are dense
- Prime and Search Computability, Characterized as Definability in Certain Sublanguages of Constructible L ω1, ω
- Quasi-minimal enumeration degrees and minimal Turing degrees
- Reducibilities in two models for combinatory logic
- Regular enumerations
- Second Order Definability Via enumerations
- The \(\omega\)-Turing degrees
- The high/low hierarchy in the local structure of the \(\omega\)-enumeration degrees
- The jump operator on the \(\omega \)-enumeration degrees
- The -Enumeration Degrees
- Uniform regular enumerations
- Π11 relations and paths through
This page was built for publication: Ivan Soskov: a life in computability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6599282)