On the relationship between computed functions and fixpoints of nondeterministic recursive definitions

DOI10.1016/S0019-9958(81)90117-0MaRDI QIDQ3947102zbMATH OpenFDO

Authors Tsong Yueh Chen

Publication date 1981

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(81)90117-0

zbMATH Keywords

computed functionsfixpointsnondeterministic recursive definitions

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited in

(1)

• On the fixpoints of nondeterministic recursive definitions

This page was built for publication: On the relationship between computed functions and fixpoints of nondeterministic recursive definitions

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