Advertisement
Published in:
2003 | OriginalPaper | Chapter
Upper and Lower Recursion Schemes in Abstract Approximation Spaces
Authors : Peter Apostoli, Akira Kanda
Published in: Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
Publisher: Springer Berlin Heidelberg
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
An approximation space (U, R) placed in a type-lowering retraction with 2U × U provides a model for a first order calculus of relations for computing over lists and reasoning about the resulting programs. Upper and lower approximations to the scheme of primitive recursion of the Theory of Pairs are derived from the approximation operators of an abstract approximation space (U, ⋄ : u ↦ ⋃[u]R, □ : u ↦ ⋂[u]R).