Relations enumerable from positive information

arXiv2206.01135MaRDI QIDQ6400948FDOQ6400948

Barbara Csima, Luke MacLean, Dino Rossegger

Publication date: 2 June 2022

Abstract: We study countable structures from the viewpoint of enumeration reducibility. Since enumeration reducibility is based on only positive information, in this setting it is natural to consider structures given by their positive atomic diagram -- the computable join of all relations of the structure. Fixing a structure $mathcalA$, a natural class of relations in this setting are the relations $R$ such that $R^{hatmathcalA}$ is enumeration reducible to the positive atomic diagram of $hatmathcalA$ for every $hatmathcalAcongmathcalA$ -- the relatively intrinsically positively enumerable (r.i.p.e.) relations. We show that the r.i.p.e. relations are exactly the relations that are definable by $Sigm{a}_1^p$ formulas, a subclass of the infinitary $Sigm{a}_1^0$ formulas. We then introduce a new natural notion of the jump of a structure and study its interaction with other notions of jumps. At last we show that positively enumerable functors, a notion studied by Csima, Rossegger, and Yu, are equivalent to a notion of interpretability using $Sigm{a}_1^p$ formulas.

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Other infinitary logic (03C75)

This page was built for publication: Relations enumerable from positive information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6400948)