Skip to main content Accessibility help
×
×
Home

COMPUTABLE POLISH GROUP ACTIONS

  • ALEXANDER MELNIKOV (a1) and ANTONIO MONTALBÁN (a2)

Abstract

Using methods from computable analysis, we establish a new connection between two seemingly distant areas of logic: computable structure theory and invariant descriptive set theory. We extend several fundamental results of computable structure theory to the more general setting of topological group actions. As we will see, the usual action of ${S_\infty }$ on the space of structures in a given language is effective in a certain algorithmic sense that we need, and ${S_\infty }$ itself carries a natural computability structure (to be defined). Among other results, we give a sufficient condition for an orbit under effective ${\cal G}$ -action of a computable Polish ${\cal G}$ to split into infinitely many disjoint effective orbits. Our results are not only more general than the respective results in computable structure theory, but they also tend to have proofs different from (and sometimes simpler than) the previously known proofs of the respective prototype results.

Copyright

References

Hide All
[1]Brattka, V., Hertling, P., and Weihrauch, K., A tutorial on computable analysis, New Computational Paradigms (Cooper, S. B., Löwe, B., and Sorbi, A., editors), Springer, New York, 2008, pp. 425491.
[2]Effros, E. G., Transformation groups and ${C^{\rm{*}}}$-algebras. Annals of Mathematics, vol. 81 (1965), no. 2, pp. 3855.
[3]Ershov, Y. L. and Goncharov, S. S., Constructive Models, Siberian School of Algebra and Logic, Consultants Bureau, New York, 2000.
[4]Gao, S., Invariant Descriptive Set Theory, Pure and Applied Mathematics (Boca Raton), vol. 293, CRC Press, Boca Raton, FL, 2009.
[5]Gončarov, S. S., Selfstability, and computable families of constructivizations. Algebra i Logika, vol. 14 (1975), no. 6, pp. 647680, 727.
[6]Lopez-Escobar, E. G. K., An interpolation theorem for denumerably long formulas. Fundamenta Mathematicae, vol. 57 (1965), pp. 253272.
[7]Martin, D. A., Classes of recursively enumerable sets and degrees of unsolvability. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 12 (1966), pp. 295310.
[8]Montalbán, A., A robuster scott rank. Proceedings of the American Mathematical Society, vol. 143 (2015), no. 12, pp. 54275436.
[9]Ventsov, Y. G., The effective choice problem for relations and reducibilities in classes of constructive and positive models. Algebra i Logika, vol. 31 (1992), no. 2, pp. 101118, 220.
[10]Weihrauch, K., On computable metric spaces Tietze-Urysohn extension is computable, Computability and Complexity in Analysis (Swansea, 2000) (Blanck, J., Brattka, V., and Hertling, P., editors), Lecture Notes in Computer Science, vol. 2064, Springer, Berlin, 2001, pp. 357368.
[11]Weihrauch, K. and Grubba, T., Elementary computable topology. Journal of Universal Computer Science, vol. 15 (2009), no. 6, pp. 13811422.
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? *
×

Keywords

Metrics

Full text views

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

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed