Ivan Soskov: a life in computability

DOI10.1007/978-3-319-43669-2_2zbMATH Open1544.01026MaRDI QIDQ6599282FDOQ6599282

Authors: Hristo Ganchev, Dimiter Skordev 

Publication date: 6 September 2024

zbMATH Keywords

primitive functionjoint spectrumenumeration reducibilitymass problemjump operator

Mathematics Subject Classification ID

Biographies, obituaries, personalia, bibliographies (01A70) History of mathematical logic and foundations (03-03)

Cites Work

• Elementary induction on abstract structures
• Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ₂ sets are dense
• A jump inversion theorem for the enumeration jump
• Jumps of quasi-minimal enumeration degrees
• Title not available (Why is that?)
• DEFINABILITY OF THE JUMP OPERATOR IN THE ENUMERATION DEGREES
• On minimal pairs of enumeration degrees
• Interpreting true arithmetic in the local structure of the enumeration degrees
• Arithmetical Reducibilities I
• Definability via enumerations
• Degrees of Unsolvability. (AM-55)
• Intrinsically Hyperarithmetical Sets
• A criterion for completeness of degrees of unsolvability
• Degrees coded in jumps of orderings
• Degrees of Structures
• Cupping and definability in the local structure of the enumeration degrees
• Computability by means of effectively definable schemes and definability via enumerations
• Abstract First Order Computability. I
• Abstract Computability and Invariant Definability
• Notes on the Jump of a Structure
• Title not available (Why is that?)
• A Jump Inversion Theorem for the Degree Spectra
• Every Set has a Least Jump Enumeration
• Title not available (Why is that?)
• The jump operator on the \(\omega \)-enumeration degrees
• Embedding countable partial orderings in the enumeration degrees and the \(\omega \)-enumeration degrees
• The  -Enumeration Degrees
• The high/low hierarchy in the local structure of the \(\omega\)-enumeration degrees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Intrinsically II Relations
• Π₁¹ relations and paths through
• A Note on ω-Jump Inversion of Degree Spectra of Structures
• Uniform regular enumerations
• Reducibilities in two models for combinatory logic
• Hyperenumeration reducibility
• Title not available (Why is that?)
• Title not available (Why is that?)
• Embedding distributive lattices in the \(\Sigma ^0_2\) enumeration degrees
• Regular enumerations
• Quasi-minimal enumeration degrees and minimal Turing degrees
• Definability via Kalimullin pairs in the structure of the enumeration degrees
• New Computational Paradigms
• Prime and Search Computability, Characterized as Definability in Certain Sublanguages of Constructible L ω1, ω
• Title not available (Why is that?)
• The \(\omega\)-Turing degrees
• Constructing minimal pairs of degrees
• Second Order Definability Via enumerations
• Effective properties of Marker's extensions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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)