To the standard propositional modal system of provability logic constants are added to account for the arithmetical fixed points introduced by Bernardi-Montagna in [5]. With that interpretation in mind, a system LR of modal propositional logic is axiomatized, a modal completeness theorem is established for LR and, after that, a uniform arithmetical completeness theorem with respect to PA is obtained for LR.

We investigate dependence of recursively enumerable graphs on the equality relation given by a specific r.e. equivalence relation on ω. In particular we compare r.e. equivalence relations in terms of graphs they permit to represent. This defines partially ordered sets that depend on classes of graphs under consideration. We investigate some algebraic properties of these partially ordered sets. For instance, we show that some of these partial ordered sets possess atoms, minimal and maximal elements. We also fully describe the isomorphism (...) types of some of these partial orders. (shrink)

Answering a question raised by Shavrukov and Visser :569–582, 2014), we show that the lattice of \-sentences ) over any computable enumerable consistent extension T of \ is uniformly dense. We also show that for every \ and \ refer to the known hierarchies of arithmetical formulas introduced by Burr for intuitionistic arithmetic) the lattices of \-sentences over any c.e. consistent extension T of the intuitionistic version of Robinson Arithmetic \ are uniformly dense. As an immediate consequence of the proof, (...) all these lattices are also locally universal. (shrink)

We study effectively inseparable (abbreviated as e.i.) prelattices (i.e., structures of the form$L = \langle \omega, \wedge, \vee,0,1,{ \le _L}\rangle$whereωdenotes the set of natural numbers and the following four conditions hold: (1)$\wedge, \vee$are binary computable operations; (2)${ \le _L}$is a computably enumerable preordering relation, with$0{ \le _L}x{ \le _L}1$for everyx; (3) the equivalence relation${ \equiv _L}$originated by${ \le _L}$is a congruence onLsuch that the corresponding quotient structure is a nontrivial bounded lattice; (4) the${ \equiv _L}$-equivalence classes of 0 and 1 (...) form an effectively inseparable pair of sets). Solving a problem in (Montagna & Sorbi, 1985) we show (Theorem 4.2), that ifLis an e.i. prelattice then${ \le _L}$is universal with respect to all c.e. preordering relations, i.e., for every c.e. preordering relationRthere exists a computable functionfreducingRto${ \le _L}$, i.e.,$xRy$if and only if$f\left( x \right){ \le _L}f\left( y \right)$, for all$x,y$. In fact (Corollary 5.3)${ \le _L}$is locally universal, i.e., for every pair$a{ < _L}b$and every c.e. preordering relationRone can find a reducing functionffromRto${ \le _L}$such that the range offis contained in the interval$\left\{ {x:a{ \le _L}x{ \le _L}b} \right\}$. Also (Theorem 5.7)${ \le _L}$is uniformly dense, i.e., there exists a computable functionfsuch that for every$a,b$if$a{ < _L}b$then$a{ < _L}f\left( {a,b} \right){ < _L}b$, and if$a{ \equiv _L}a\prime$and$b{ \equiv _L}b\prime$then$f\left( {a,b} \right){ \equiv _L}f\left( {a\prime,b\prime } \right)$. Some consequences and applications of these results are discussed: in particular (Corollary 7.2) for$n \ge 1$the c.e. preordering relation on${{\rm{\Sigma }}_n}$sentences yielded by the relation of provable implication of any c.e. consistent extension of Robinson’s systemRorQis locally universal and uniformly dense; and (Corollary 7.3) the c.e. preordering relation yielded by provable implication of any c.e. consistent extension of Heyting Arithmetic is locally universal and uniformly dense. (shrink)

Let$ \le _c $be computable the reducibility on computably enumerable equivalence relations. We show that for every ceerRwith infinitely many equivalence classes, the index sets$\left\{ {i:R_i \le _c R} \right\}$,$\left\{ {i:R_i \ge _c R} \right\}$, and$\left\{ {i:R_i \equiv _c R} \right\}$are${\rm{\Sigma }}_3^0$complete, whereas in caseRhas only finitely many equivalence classes, we have that$\left\{ {i:R_i \le _c R} \right\}$is${\rm{\Pi }}_2^0$complete, and$\left\{ {i:R \ge _c R} \right\}$ is${\rm{\Sigma }}_2^0$complete. Next, solving an open problem from [1], we prove that the index set of (...) the effectively inseparable ceers is${\rm{\Pi }}_4^0$complete. Finally, we prove that the 1-reducibility preordering on c.e. sets is a${\rm{\Sigma }}_3^0$complete preordering relation, a fact that is used to show that the preordering relation$ \le _c $on ceers is a${\rm{\Sigma }}_3^0$complete preordering relation. (shrink)

This note addresses the issue as to which ceers can be realized by word problems of computably enumerable (or, simply, c.e.) structures (such as c.e. semigroups, groups, and rings), where being realized means to fall in the same reducibility degree (under the notion of reducibility for equivalence relations usually called “computable reducibility”), or in the same isomorphism type (with the isomorphism induced by a computable function), or in the same strong isomorphism type (with the isomorphism induced by a computable permutation (...) of the natural numbers). We observe, e.g., that every ceer is isomorphic to the word problem of some c.e. semigroup, but (answering a question of Gao and Gerdes) not every ceer is in the same reducibility degree of the word problem of some finitely presented semigroup, nor is it in the same reducibility degree of some non‐periodic semigroup. We also show that the ceer provided by provable equivalence of Peano Arithmetic is in the same strong isomorphism type as the word problem of some non‐commutative and non‐Boolean c.e. ring. (shrink)

We show that the theory of the partial order of computably enumerable equivalence relations (ceers) under computable reduction is 1-equivalent to true arithmetic. We show the same result for the structure comprised of the dark ceers and the structure comprised of the light ceers. We also show the same for the structure of L-degrees in the dark, light, or complete structure. In each case, we show that there is an interpretable copy of (N, +, \times) .

The paper contains some observations on e-complete, precomplete, and uniformly finitely precomplete r. e. equivalence relations. Among these are a construction of a uniformly finitely precomplete r. e. equivalence which is neither e- nor precomplete, an extension of Lachlan's theorem that all precomplete r. e. equivalences are isomorphic, and a characterization of sets of fixed points of endomorphisms of uniformly finitely precomplete r. e. equivalences.

Using computable reducibility ⩽ on equivalence relations, we investigate weakly precomplete ceers (a “ceer” is a computably enumerable equivalence relation on the natural numbers), and we compare their class with the more restricted class of precomplete ceers. We show that there are infinitely many isomorphism types of universal (in fact uniformly finitely precomplete) weakly precomplete ceers, that are not precomplete; and there are infinitely many isomorphism types of non‐universal weakly precomplete ceers. Whereas the Visser space of a precomplete ceer always (...) contains an infinite effectively discrete subset, there exist weakly precomplete ceers whose Visser spaces do not contain infinite effectively discrete subsets. As a consequence, contrary to precomplete ceers which always yield partitions into effectively inseparable sets, we show that although weakly precomplete ceers always yield partitions into computably inseparable sets, nevertheless there are weakly precomplete ceers for which no equivalence class is creative. Finally, we show that the index set of the precomplete ceers is Σ3‐complete, whereas the index set of the weakly precomplete ceers is Π3‐complete. As a consequence of these results, we also show that the index sets of the uniformly precomplete ceers and of the e‐complete ceers are Σ3‐complete. (shrink)