Priority arguments and separation problems - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Доклады Академии Наук / Doklady Mathematics Year : 1979

Priority arguments and separation problems

Alexander Shen

Abstract

Different constructions in the recursion theory use the so-called priority arguments. A general scheme was suggested by A.~Lachlan. Based on his work, we define the notion of a priority-closed class of requirements. Then, for a specific priority construction, we need to check only that all requirements we want to satisfy belong to some priority-closed class (defined in game terms). This game version of Lachlan's approach is used to present some results about recursively inseparable sets obtained by the author.

Domains

Logic [math.LO]
Fichier principal
Vignette du fichier
1979eng.pdf (61.89 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

lirmm-01923125 , version 1 (15-11-2018)

Identifiers

Cite

Alexander Shen. Priority arguments and separation problems. Доклады Академии Наук / Doklady Mathematics, 1979, 248 (6), pp.1309-1313. ⟨lirmm-01923125⟩
60 View
19 Download

Altmetric

Share

Gmail Facebook X LinkedIn More