Skip Navigation

Journal of Logic and Computation 1999 9(6):915-957; doi:10.1093/logcom/9.6.915
© 1999 by Oxford University Press
This Article
Right arrow Full Text (PDF)
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 Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (3)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Arratia-Quesada, A.
Right arrow Articles by Stewart, I.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Hierarchies in classes of program schemes

AA Arratia-QuesadaA1, SR ChauhanA2 and IA StewartA3

A1 Departamento de Matemáticas, Universidad Simón Bolívar, Apartado 89000, Caracas 1080-A, Venezuela E-mail: arratio@ldc.usb.ve A2 Department of Computer Science, University of Wales Swansea, Swansea SA2 8PP, UK E-mail: s.r.chaunan@swansea.ac.uk A3 Department of Mathematics and Computer Science, University of Leicester, Leicester LE1 7RH, UK E-mail: i.a.stewart@mcs.le.ac.uk

We begin by proving that the class of problems accepted by the program schemes of NPS is exactly the class of problems defined by the sentences of transitive closure logic (program schemes of NPS are obtained by generalizing basic non-deterministic while-programs whose tests within while instructions are quantifier-free first-order formulae). We then show that our program schemes form a proper infinite hierarchy within NPS whose analogy in transitive closure logic is a proper infinite hierarchy, the union of which is full transitive closure logic but for which every level of the hierarchy has associated with it a first-order definable problem not in that level. We then proceed to add a stack to our program schemes, so obtaining the class of program schemes NPSS, and characterize the class of problems accepted by the program schemes of NPSS as the class of problems defined by the sentences of path system logic. We show that there is a proper infinite hierarchy within NPSS, with an analogous hierarchy within path system logic (again, such that every level of the hierarchy has associated with it a first-order definable problem not in that level). Like the hierarchies in transitive closure logic and NPS, the hierarchies in path system logic and NPSS are all proper even when we consider only problems involving undirected trees or problems involving out-trees. One aspect of our analysis that we believe to be particularly interesting is that we do not use Ehrenfeucht-Fraïssé games for our inexpressibility results, as is usually the case in finite model theory, but we simply consider computations of program schemes on certain finite structures.

Keywords: Finite model theory, descriptive complexity theory


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


This article has been cited by other articles:


Home page
 J Logic ComputationHome page
I. A. Stewart
Logical and Complexity-theoretic Aspects of Models of Computation with Restricted Access to Arrays
J Logic Computation, July 24, 2008; (2008) exn025v1.
[Abstract] [PDF]


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.