Skip Navigation


Journal of Logic and Computation Advance Access originally published online on September 24, 2008
Journal of Logic and Computation 2009 19(1):177-197; doi:10.1093/logcom/exn023
This Article
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
19/1/177    most recent
exn023v1
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Selivanov, V. L.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2008. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

This article appears in the following Journal of Logic and Computation issue: Special Issue: Logic and Computation in the Real World: CiE 2007 [View the issue table of contents]

Original Articles

Undecidability in Some Structures Related to Computation Theory

Victor L. Selivanov

A.P. Ershov Institute of Informatics Systems, Siberian Division Russian Academy of Sciences

E-mail: vseliv{at}nspu.ru

Received 10 October 2007.


  Abstract

We show that many of the so called discrete weak semilattices considered earlier in a series of author's publications have hereditary undecidable first-order theories. Since such structures appear naturally in some parts of computation theory, we obtain several new undecidability results. This applies e.g. to the structures of complete numberings, of m-degrees of index sets and of the Wadge degrees of k-partitions in the Baire space and {omega}-algebraic domains. Whenever possible, we try to determine also the exact degrees of undecidability of the theories under discussion.

Keywords: Semilattice; discrete weak semilattice; partition; reducibility; undecidability; theory


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.