Upper and lower recursion schemes in abstract approximation spaces

DOI10.1007/3-540-39205-X_26MaRDI QIDQ4426950zbMATH OpenFDO

Authors Peter Apostoli, Akira Kanda

Publication date 18 September 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2639/26390205.htm

zbMATH Keywords

abstract approximation spacesmodal logicnatural deduction set theorynegation in logic programming systemsrough setssecond recursion theorem

Mathematics Subject Classification ID

Logic in computer science (03B70) Logic programming (68N17) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• scientific article; zbMATH DE number 1748448
• Generic objects in recursion theory. II: Operations on recursive approximation spaces
• On the connection between the abstract recursion theory and the method of successive approximations
• scientific article; zbMATH DE number 1389358
• The uniform approximation of recurrent functions and almost recurrent functions
• On upper and lower approximative liftings
• Approximation of some linear recursive sequences and applications
• scientific article; zbMATH DE number 3108331
• Upper (lower) approximation based on congruence on free semilinear spaces
• scientific article; zbMATH DE number 5051663

Cited in

(1)

• Generic objects in recursion theory. II: Operations on recursive approximation spaces

This page was built for publication: Upper and lower recursion schemes in abstract approximation spaces

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