[FOM] Slaman triples (computability)

[G Barmpalias]

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