A possible mathematical specification of “degree-0” or “degree-0 plus a little” learnability

Behavioral and Brain Sciences 12 (2):345-347 (1989)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1017/s0140525x00048998

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

On Lachlan’s major sub-degree problem.S. Barry Cooper & Angsheng Li - 2008 - Archive for Mathematical Logic 47 (4):341-434.
On relative enumerability of Turing degrees.Shamil Ishmukhametov - 2000 - Archive for Mathematical Logic 39 (3):145-154.
Isolation and the high/low hierarchy.Shamil Ishmukhametov & Guohua Wu - 2002 - Archive for Mathematical Logic 41 (3):259-266.
Density results in the Δ 2 0 e-degrees.Marat M. Arslanov, Iskander Sh Kalimullin & Andrea Sorbi - 2001 - Archive for Mathematical Logic 40 (8):597-614.
A minimal pair joining to a plus cupping Turing degree.Dengfeng Li & Angsheng Li - 2003 - Mathematical Logic Quarterly 49 (6):553-566.
The child's trigger experience: Degree-0 learnability.David Lightfoot - 1989 - Behavioral and Brain Sciences 12 (2):321-334.
Joining to high degrees via noncuppables.Jiang Liu & Guohua Wu - 2010 - Archive for Mathematical Logic 49 (2):195-211.
Bounding Homogeneous Models.Barbara F. Csima, Valentina S. Harizanov, Denis R. Hirschfeldt & Robert I. Soare - 2007 - Journal of Symbolic Logic 72 (1):305 - 323.
Some observations on degree of learnability.C. L. Baker - 1989 - Behavioral and Brain Sciences 12 (2):334-335.
An almost-universal cupping degree.Jiang Liu & Guohua Wu - 2011 - Journal of Symbolic Logic 76 (4):1137-1152.
On a conjecture of Lempp.Angsheng Li - 2000 - Archive for Mathematical Logic 39 (4):281-309.
Prime models of computably enumerable degree.Rachel Epstein - 2008 - Journal of Symbolic Logic 73 (4):1373-1388.
A high noncuppable $${\Sigma^0_2}$$ e-degree.Matthew B. Giorgi - 2008 - Archive for Mathematical Logic 47 (3):181-191.
There is no low maximal d. c. e. degree– Corrigendum.M. Arslanov & S. B. Cooper - 2004 - Mathematical Logic Quarterly 50 (6):628.
Degrees of categoricity of computable structures.Ekaterina B. Fokina, Iskander Kalimullin & Russell Miller - 2010 - Archive for Mathematical Logic 49 (1):51-67.

Analytics

Added to PP
2014-01-20

Downloads
20 (#747,345)

6 months
9 (#290,637)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Restricting grammatical complexity.Robert Frank - 2004 - Cognitive Science 28 (5):669-697.

Add more citations

References found in this work

Aspects of the Theory of Syntax.Noam Chomsky - 1965 - Cambridge, MA, USA: MIT Press.
Knowledge of Language: Its Nature, Origin, and Use.Noam Chomsky - 1986 - Prager. Edited by Darragh Byrne & Max Kölbel.
Rules and representations.Noam Chomsky (ed.) - 1980 - New York: Columbia University Press.
Rules and representations.Noam A. Chomsky - 1980 - Behavioral and Brain Sciences 3 (127):1-61.

View all 38 references / Add more references