Diagonal fixed points in algebraic recursion theory

摘要: The relation between least and diagonal fixed points is a well known completely studied question for large class of partially ordered models the lambda calculus combinatory logic. Here we consider this in context algebraic recursion theory, whose close connection with logic recently become apparent. We find comparatively simple rather weak general condition which suffices to prove equality canonical (corresponding those produced by Curry combinator calculus) algebras covers both spaces Skordev operative Ivanov. Especially, yields an essential improvement axiomatization theory via spaces.