Archive for Mathematical Logic 60 (3-4):301-315 (2020)
| Abstract |
The present work determines the arithmetic complexity of the index sets of u.c.e. families which are learnable according to various criteria of algorithmic learning. Specifically, we prove that the index set of codes for families that are TxtFex\-learnable is \-complete and that the index set of TxtFex\-learnable and the index set of TxtFext\-learnable families are both \-complete.
|
| Keywords | No keywords specified (fix it) |
| Categories |
No categories specified (categorize this paper) |
| Reprint years | 2021 |
| DOI | 10.1007/s00153-020-00745-4 |
| Options |
Mark as duplicate
Export citation
Request removal from index
|
Download options
References found in this work BETA
Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets.Robert I. Soare - 1990 - Journal of Symbolic Logic 55 (1):356-357.
Learning Theory in the Arithmetic Hierarchy.Achilles A. Beros - 2014 - Journal of Symbolic Logic 79 (3):908-927.
Anomalous Vacillatory Learning.Achilles A. Beros - 2009 - Journal of Symbolic Logic 78 (4):1183-1188.
Citations of this work BETA
No citations found.
Similar books and articles
Learning Theory in the Arithmetic Hierarchy.Achilles A. Beros - 2014 - Journal of Symbolic Logic 79 (3):908-927.
Relating the Bounded Arithmetic and Polynomial Time Hierarchies.Samuel R. Buss - 1995 - Annals of Pure and Applied Logic 75 (1-2):67-77.
Multifunction Algebras and the Provability of PH↓.Chris Pollett - 2000 - Annals of Pure and Applied Logic 104 (1-3):279-303.
Approximate Counting by Hashing in Bounded Arithmetic.Emil Jeřábek - 2009 - Journal of Symbolic Logic 74 (3):829-860.
Strengths and Weaknesses of LH Arithmetic.Chris Pollett & Randall Pruim - 2002 - Mathematical Logic Quarterly 48 (2):221-243.
The Polynomial and Linear Time Hierarchies in V0.Leszek A. Kołodziejczyk & Neil Thapen - 2009 - Mathematical Logic Quarterly 55 (5):509-514.
On Two Questions About Feasibly Constructive Arithmetic.Morteza Moniri - 2003 - Mathematical Logic Quarterly 49 (4):425.
Poincare on Mathematics, Intuition and the Foundations of Science.Janet Folina - 1994 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1994:217 - 226.
Admissible Closures of Polynomial Time Computable Arithmetic.Dieter Probst & Thomas Strahm - 2011 - Archive for Mathematical Logic 50 (5-6):643-660.
J. B. Paris. A Hierarchy of Cuts in Models of Arithmetic. Model Theory of Algebra and Arithmetic, Proceedings of the Conference on Applications of Logic to Algebra and Arithmetic Held at Karpacz, Poland, September 1–7, 1979, Edited by L. Pacholski, J. Wierzejewski, and A. J. Wilkie, Lecture Notes in Mathematics, Vol. 834, Springer-Verlag, Berlin, Heidelberg, and New York, 1980, Pp. 312–337. - George Mills. A Tree Analysis of Unprovable Combinatorial Statements. Model Theory of Algebra and Arithmetic, Proceedings of the Conference on Applications of Logic to Algebra and Arithmetic Held at Karpacz, Poland, September 1–7, 1979, Pp. 248–311. - Jussi Ketonen and Robert Solovay. Rapidly Growing Ramsey Functions. Annals of Mathematics, Ser. 2 Vol. 113 , Pp. 267–314. [REVIEW]A. J. Wilkie - 1986 - Journal of Symbolic Logic 51 (4):1062-1066.
Notes on Polynomially Bounded Arithmetic.Domenico Zambella - 1996 - Journal of Symbolic Logic 61 (3):942-966.
Notes on Polynomially Bounded Arithmetic.Domenico Zambella - 1996 - Journal of Symbolic Logic 61 (2):942-966.
On Interpretations of Bounded Arithmetic and Bounded Set Theory.Richard Pettigrew - 2009 - Notre Dame Journal of Formal Logic 50 (2):141-152.
Analytics
Added to PP index
2020-08-27
Total views
10 ( #903,150 of 2,518,494 )
Recent downloads (6 months)
1 ( #408,186 of 2,518,494 )
2020-08-27
Total views
10 ( #903,150 of 2,518,494 )
Recent downloads (6 months)
1 ( #408,186 of 2,518,494 )
How can I increase my downloads?
Downloads
