Diagonal fixed points in algebraic recursion theory (Q2576642)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 2238615
Language Label Description Also known as
default for all languages
No label defined
    English
    Diagonal fixed points in algebraic recursion theory
    scientific article; zbMATH DE number 2238615

      Statements

      Diagonal fixed points in algebraic recursion theory (English)
      0 references
      0 references
      14 December 2005
      0 references
      In algebraic recursion theory diagonal fixed points originate from the so-called normal form theorem -- an analog of Kleene's normal form theorem in classical recursion theory. In this work a special type of partially ordered algebra, called intensional combinatory space, is considered. For such algebras it is established that, under some weak first-order expressible condition, the least fixed point coincides with the canonical diagonal fixed point for any inductive operation w.r.t. a suitable normal representation procedure.
      0 references
      algebraic recursion theory
      0 references
      combinatory logic
      0 references
      fixed-point theorems
      0 references
      intensional combinatory space
      0 references

      Identifiers