Computability in Europe 2008
Logic and Theory of Algorithms
|Speaker:||Basil A. Karadais|
|Slot:||Wed, 11:30-11:50, Amphitheater B (col. 2)|
By a "Plotkin definability theorem" we mean here a statement of the following sort: a PCF-like language can be extended to a language so that a functional will be definable by a term if and only if it is computable. We prove this result directly for a class of Scott information systems that feature "atomicity" and "coherence".
|websites: Arnold Beckmann||2008-05-28|