
Summary: 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.
admissible set, recursively saturated model, computable model, hereditarily finite superstructure, Computability and recursion theory on ordinals, admissible sets, etc., \(\Sigma \)-definability, decidable model, \(\Sigma \)-reducibility, Classification theory, stability, and related concepts in model theory, hyperadmissible set, Theory of numerations, effectively presented structures
admissible set, recursively saturated model, computable model, hereditarily finite superstructure, Computability and recursion theory on ordinals, admissible sets, etc., \(\Sigma \)-definability, decidable model, \(\Sigma \)-reducibility, Classification theory, stability, and related concepts in model theory, hyperadmissible set, Theory of numerations, effectively presented structures
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
