[FOM] Slaman triples (computability)

[Steve Leonhardi]

I first heard the term used by Steffen Lempp, my advisor at the time.

My impression is that the term was well-established in the oral tradition
before it appeared in print. 

Steve

At 06:12 PM 1/22/03 +0000, you wrote:
>A question about computability: who coined the term `Slaman triple' for
the well 
>known triples in the c.e. Turing degrees, constructed by Slaman and first 
>appeared (in the literature) in 
>
>Shore, Richard A.; Slaman, Theodore A.
>Working below a high recursively enumerable degree,
>{\em J. Symbolic Logic}
>\textbf{58} (1993), no.3, 824--859
>
>
>?
>
>The earliest paper I'm aware of which uses this term is
>
>Leonhardi, Steven D. 
>Nonbounding and Slaman triples,  
>{\em Ann. Pure Appl. Logic}
>\textbf{79} (1996), no. 2, 139--163
>
>George Barmpalias
>
>_______________________________________________
>FOM mailing list
>FOM at cs.nyu.edu
>http://www.cs.nyu.edu/mailman/listinfo/fom
>


Dr. Steven D. Leonhardi				(507) 457-2359 (office)
Dept. of Mathematics and Statistics		(507) 457-5376 (fax)
175 W. Mark St., Gildemeister 322
Winona State University	
Winona, MN  55987-5838

email: sleonhardi at winona.edu
http:  //www.winona.edu/mathematics/faculty/leonhardi.htm