Diagonal fixed points in algebraic recursion theory

DOI10.1007/S00153-005-0307-XMaRDI QIDQ2576642zbMATH OpenOpenAlexFDO

Authors Jordan Zashev

Publication date 14 December 2005

Published in Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00153-005-0307-x

zbMATH Keywords

algebraic recursion theorycombinatory logicfixed-point theoremsintensional combinatory space

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Abstract and axiomatic computability and recursion theory (03D75)

Review text

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.

Recommendations

• scientific article; zbMATH DE number 218553
• scientific article; zbMATH DE number 3853056
• Fixed points in lambda calculus. an eccentric survey of problems and solutions
• scientific article; zbMATH DE number 3865261
• Fixed points and diagonal method

Cites work

• Code evaluation in operative spaces with storage operation
• Dominical categories: recursion theory without elements
• scientific article; zbMATH DE number 3853056 (Why is no real title available?)
• scientific article; zbMATH DE number 3991488 (Why is no real title available?)
• scientific article; zbMATH DE number 3702629 (Why is no real title available?)
• scientific article; zbMATH DE number 52976 (Why is no real title available?)
• scientific article; zbMATH DE number 3513762 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• On the recursion theorem in iterative operative spaces
• The lambda calculus, its syntax and semantics

Cited in

(4)

• Diagonalization, uniformity, and fixed-point theorems
• On fixed-point theorems in synthetic computability
• scientific article; zbMATH DE number 218553 (Why is no real title available?)
• Combinatory spaces versus operative spaces with storage operation

This page was built for publication: Diagonal fixed points in algebraic recursion theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2576642)