The Theoretical Aspects of the Optimal Fixedpoint
From MaRDI portal
Publication:4130959
DOI10.1137/0205033zbMath0358.68017OpenAlexW1977815811MaRDI QIDQ4130959
Publication date: 1976
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/b0dd02bcaa2c6f5e4f5f4ca817516454fb578e38
Recursive functions and relations, subrecursive hierarchies (03D20) General topics in the theory of software (68N01)
Related Items (17)
Partial models and logic programming ⋮ The fixed points of logic programs with Herbrand base \({\mathbb{N}}\) ⋮ Sets with structure, mappings and fixed point property: fixed point structures ⋮ Properties of data flow frameworks: A unified model ⋮ Unnamed Item ⋮ Iterative belief revision in extended logic programming ⋮ Extremal solutions of inequations over lattices with applications to supervisory control ⋮ Unnamed Item ⋮ Partiality and recursion in interactive theorem provers – an overview ⋮ Fixing Zeno gaps ⋮ The convergence of functions to fixedpoints of recursive definitions ⋮ Formal definitions and proofs for partial (co)recursive functions ⋮ On the existence of optimal fixpoints ⋮ Programming in three-valued logic ⋮ Four valued semantics and the Liar ⋮ On the fixpoints of nondeterministic recursive definitions ⋮ Optimal fixedpoints of logic programs
This page was built for publication: The Theoretical Aspects of the Optimal Fixedpoint