Least Fixed Points in Preassociative Combinatory Algebras

摘要: The intention of the investigations to which present work belongs is find an axiomatic basis recursion theory for following qualities are desirable possess:(1) be algebraically styled; that means we expect a suitable algebraic language, simple and well working allows us obtain connection between same structures may interesting by themselves; (2) have as large possible area applications, i.e. those many easy constructable models: (3) allow prove all basic facts in abstract case, especially least fixed point or first theorem.