Numerical Analysis and Epistemology of InformationMarco Benini
The slides of my presentation at the workshop "Philosophical Aspects of Computer Science", European Centre for Living Technology, University “Ca’ Foscari”, Venice, March 2015.
Analysing the categorical structure of well quasi orders, two proofs of the Higman's lemma are shown, emphasising the structural content of this property of well quasi order in relation to exponentiation.
As a side effect, a variant of the Lemma is found, which says that the finite sequences of elements on A, ordered by embedding, is well-founded if and only if, A is well-founded.
Numerical Analysis and Epistemology of InformationMarco Benini
The slides of my presentation at the workshop "Philosophical Aspects of Computer Science", European Centre for Living Technology, University “Ca’ Foscari”, Venice, March 2015.
Analysing the categorical structure of well quasi orders, two proofs of the Higman's lemma are shown, emphasising the structural content of this property of well quasi order in relation to exponentiation.
As a side effect, a variant of the Lemma is found, which says that the finite sequences of elements on A, ordered by embedding, is well-founded if and only if, A is well-founded.