Strength and Weakness in Computable Structure Theory-Reference-Cited by-同舟云学术

Strength and Weakness in Computable Structure Theory

Published:2016-12-01 Issue: Volume: Page:302-323
ISSN:0302-9743
Container-title:Computability and Complexity
language:
Short-container-title:

Author:

Franklin Johanna N. Y.

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-50062-1_20

Reference35 articles.

1. Anderson, B.A., Csima, B.F.: Degrees that are not degrees of categoricity. Notre Dame J. Formal Logic (to appear)

2. Ash, C.J., Knight, J.: Computable structures and the hyperarithmetical hierarchy. In: Studies in Logic and the Foundations of Mathematics, vol. 144. North-Holland (2000)

3. Csima, B.: Degrees of categoricity and related notions. In: BIRS Computable Model Theory Workshop, November 2013

4. Csima, F.B., Franklin, J.N.Y., Shore, R.A.: Degrees of categoricity and the hyperarithmetic hierarchy. Notre Dame J. Formal Logic 54(2), 215–231 (2013)

5. Csima, B.F., Harrison-Trainor, M.: Degrees of categoricity on a cone. J. Symbolic Logic (to appear)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Degrees of categoricity and treeable degrees;Journal of Mathematical Logic;2023-08-11

2. Every Δ20 degree is a strong degree of categoricity;Journal of Mathematical Logic;2022-08-11

3. Computable Heyting Algebras with Distinguished Atoms and Coatoms;Journal of Logic, Language and Information;2022-07-27

4. Coding in the automorphism group of a computably categorical structure;Journal of Mathematical Logic;2020-02-18

5. Finite computable dimension and degrees of categoricity;Annals of Pure and Applied Logic;2019-01