Abstract
We find an example of a computable admissible set whose level of computability is higher than that of the standard model of Peano arithmetic. As a byproduct, we construct a 1-decidable model of an undecidable submodel complete theory.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have