Skip to main content
×
Home
    • Aa
    • Aa

Intrinsic bounds on complexity and definability at limit levels

  • John Chisholm (a1), Ekaterina B. Fokina (a2), Sergey S. Goncharov (a3), Valentina S. Harizanov (a4), Julia F. Knight (a5) and Sara Quinn (a6)...
Abstract
Abstract

We show that for every computable limit ordinal α, there is a computable structure that is categorical, but not relatively categorical (equivalently, it does not have a formally Scott family). We also show that for every computable limit ordinal α, there is a computable structure with an additional relation R that is intrinsically on , but not relatively intrinsically on (equivalently, it is not definable by a computable Σα formula with finitely many parameters). Earlier results in [7], [10], and [8] establish the same facts for computable successor ordinals α.

Copyright
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 1 *
Loading metrics...

Abstract views

Total abstract views: 89 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 22nd October 2017. This data will be updated every 24 hours.