[FOM] finite axiomatisation

[Thomas Forster]

Can anyone on this list state - and cite! - a theorem to the effect that 
to any recursively axiomatisable theory $T$ in a language $L$ there is a 
finitely axiomatisable theory $T'$ in a suitable language $L'$ with $T'$ 
equivalent to $T'$ in some very strong sense.   Somebody must have proved
a rigorous version of this, and I am hoping that listmembers will know
who and how.

    Thomas Forster




URL:  www.dpmms.cam.ac.uk/~tf; 
DPMMS ph: +44-1223-337981; 
mobile in UK +44-7887-701-562; 
mobile in US: +1-412-818-1316; 
mobile in NZ +64-210580093.