Skip to main content
Conference Proceedings

Turing progressions and their well-orders

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7318 LNCS 212-221
DOI: 10.1007/978-3-642-30870-3_21
7Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We see how Turing progressions are closely related to the closed fragment of GLP, polymodal provability logic. Next we study natural well-orders in GLP that characterize certain aspects of these Turing progressions. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Fernández Duque, D., & Joosten, J. J. (2012). Turing progressions and their well-orders. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7318 LNCS, pp. 212–221). https://doi.org/10.1007/978-3-642-30870-3_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free