Belligerent jump inversion extends unfriendly coding uniformly through the computable ordinals and yields optimal syntactic-oracle trade-offs for Scott sentences and distinguishing formulas.
Enumerations in computable structure theory , url =
1 Pith paper cite this work, alongside 99 external citations. Polarity classification is still indexing.
1
Pith paper citing it
99
external citations · OpenAlex
fields
math.LO 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Infinite Belligerent Jump Inversion and Computable Scott Analysis
Belligerent jump inversion extends unfriendly coding uniformly through the computable ordinals and yields optimal syntactic-oracle trade-offs for Scott sentences and distinguishing formulas.