Relatively precomplete numerations and arithmetic
From MaRDI portal
Cited in
(15)- Effective inseparability and its applications
- Generic generalized Rosser fixed points
- A note on uniform density in weak arithmetical theories
- A survey on universal computably enumerable equivalence relations
- Remarks on Uniformly Finitely Precomplete Positive Equivalences
- Precomplete numberings
- EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS
- Weakly precomplete computably enumerable equivalence relations
- Universal computably enumerable equivalence relations
- Jumps of computably enumerable equivalence relations
- Word problems and ceers
- The provability logics of recursively enumerable theories extending Peano arithmetic at arbitrary theories extending Peano arithmetic
- Graphs realised by r.e. equivalence relations
- Obituary: Franco Montagna (1948--2015)
- The theory of ceers computes true arithmetic
This page was built for publication: Relatively precomplete numerations and arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1171055)