Back
A note on diagonalization
Authors:
- Andrzej Wiśniewski,
- Jerzy Pogonowski
Abstract
We present a diagonal method of constructing a denumerable family of infinite recursive subsets of a recursive set all of which are different from elements of an effectively given family of in finite r.e. subsets of this set. The construction in question leads to some incompleteness results, e.g. in problem solving systems.
- Record ID
- UAMd07c70b03f934a1e9fa332934a4f0ecd
- Author
- Journal series
- Bulletin of the Section of Logic, ISSN 0138-0680
- Issue year
- 2010
- Vol
- 39
- No
- 3/4
- Pages
- 123-131
- ASJC Classification
- ;
- Language
- (en) English
- Score (nominal)
- 0
- Score source
- journalList
- Publication indicators
- = 1; : 2010 = 0.338
Share
- Uniform Resource Identifier
- https://researchportal.amu.edu.pl/info/article/UAMd07c70b03f934a1e9fa332934a4f0ecd/
- URN
urn:amu-prod:UAMd07c70b03f934a1e9fa332934a4f0ecd
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or PerishOpening in a new tab system.