Some properties of algebraic reducibility of constructivizations
In the paper under review the author studies the notion of algebraic reducibility of constructivizations. The author introduces for any \(n\in \omega\), \(n>0\), the notion of n-algebraic reducibility of constructivizations (which is the usual algebraic reducibility of constructivizations reduced to relations with n free variables) and studies the relationship between these reducibilities. Further, it is shown that any finite Boolean algebra is the structure of algebraic reducibility for some suitable partially ordered set. Moreover, in some natural sense the class of partially ordered sets is complete.
algebraic reducibility of constructivizations
scientific article; zbMATH DE number 4213964