Article contents
PUNCTUAL CATEGORICITY AND UNIVERSALITY
Published online by Cambridge University Press: 22 October 2020
Abstract
We describe punctual categoricity in several natural classes, including binary relational structures and mono-unary functional structures. We prove that every punctually categorical structure in a finite unary language is ${\text {PA}}(0')$-categorical, and we show that this upper bound is tight. We also construct an example of a punctually categorical structure whose degree of categoricity is
$0''$. We also prove that, with a bit of work, the latter result can be pushed beyond
$\Delta ^1_1$, thus showing that punctually categorical structures can possess arbitrarily complex automorphism orbits.
As a consequence, it follows that binary relational structures and unary structures are not universal with respect to primitive recursive interpretations; equivalently, in these classes every rich enough interpretation technique must necessarily involve unbounded existential quantification or infinite disjunction. In contrast, it is well-known that both classes are universal for Turing computability.
- Type
- Articles
- Information
- Copyright
- © The Association for Symbolic Logic 2020
References
REFERENCES
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20210413074150464-0894:S0022481220000511:S0022481220000511_inline4.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20210413074150464-0894:S0022481220000511:S0022481220000511_inline5.png?pub-status=live)
- 5
- Cited by