Search
Results: 2
A universal algorithm for Krull's theorem
We give a computational interpretation to an abstract formulation of Krull's theorem, by analysing its classical proof based on Zorn's lemma. Our approach is inspired by proof theory, and uses a form of update recursion to...
Constructive algebra Krull's theorem Maximal ideals Program extraction /dk/atira/pure/subjectarea/asjc/2600/2614 name=Theoretical Computer Science /dk/atira/pure/subjectarea/asjc/1700/1710 name=Information Systems /dk/atira/pure/subjectarea/asjc/1700/1706 name=Computer Science Applications /dk/atira/pure/subjectarea/asjc/1700/1703 name=Computational Theory and Mathematics
A universal algorithm for Krull's theorem
We give a computational interpretation to an abstract formulation of Krull's theorem, by analysing its classical proof based on Zorn's lemma. Our approach is inspired by proof theory, and uses a form of update recursion to...
Constructive algebra Krull's theorem Maximal ideals Program extraction /dk/atira/pure/subjectarea/asjc/2600/2614 name=Theoretical Computer Science /dk/atira/pure/subjectarea/asjc/1700/1710 name=Information Systems /dk/atira/pure/subjectarea/asjc/1700/1706 name=Computer Science Applications /dk/atira/pure/subjectarea/asjc/1700/1703 name=Computational Theory and Mathematics