The Power of the Depth of Iteration in Defining Relations by Induction
Abstract
In this paper we provoke the question of whether the sequence ... is strictly increasing, i.e., the question of whether increasing the depth of iteration increases the expressive power of defining by induction. Solving this question should have a deep impact on computer science as well as on mathematical logic since it is a question in a subject on the crossroads between them, namely, descriptive complexity. We shall mention a potential way of tackling the problem.
Full Text:
PDFCopyright (c) 2013 Author(s)

This work is licensed under a Creative Commons Attribution 4.0 International License.
© 2012-2022 ANGLISTICUM. Journal of the Association-Institute for English Language and American Studies,Tetovo, North Macedonia.
ISSN (print): 1857-8179. ISSN (online): 1857-8187.
Disclaimer: Articles on Anglisticum have been reviewed and authenticated by the Authors before sending for the publication.
The Journal, Editors and the editorial board are not entitled or liable to either justify or responsible for inaccurate and misleading data if any. It is the sole responsibility of the Author concerned.