Skip to main content
SpringerLink
Log in

Upper and Lower Recursion Schemes in Abstract Approximation Spaces

  • Conference paper
  • First Online:
Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing (RSFDGrC 2003)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2639))

  • 714 Accesses

Abstract

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).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andrews, James H. [2002]: “A Weakly-Typed Higher Order Logic with General Lambda Terms and Y Combinator,” Proceedings, Works In Progress Track, 15th International Conference on Theorem Proving in Higher Order Logics (TPHOLs’ 02), Hampton Roads, Virginia, August 2002, 1–11, NASA Conference Publication CP-2002-211736.

    Google Scholar 

  2. Apostoli, P. [2000]: “The Analytic Conception of Truth and The Foundations of Arithmetic,” J. of Symbolic Logic, 65(1) 33–102.

    Article  MATH  MathSciNet  Google Scholar 

  3. Apostoli P. and A. Kanda [2000]: “Approximation spaces of type-free sets,” with A. Kanda. RSCTC’ 00, eds. W. Ziarko, Y.Y. Yao. LNAI volume 2005. Eds. J. G. Carbonell, J. Siekmann, Springer-Verlag, 98–105.

    Google Scholar 

  4. Bell, J. L. [2000]: “Set and Classes as Many,” J. of Philosophical Logic, 29(6), 595–681.

    Google Scholar 

  5. Cattaneo, G. [1998]: “Abstract Approximation Spaces for Rough Theories,” Rough Sets in Knowledge Discovery: Methodology and Applications, eds. L. Polkowski, A. Skowron. Studies in Fuzziness and Soft Computing. Ed.: J. Kacprzyk. Vol. 18, Springer.

    Google Scholar 

  6. Church A. [1941]: The Calculi of λ-conversion, Annals of Mathematics Studies 6, Princeton University Press, Princeton.

    Google Scholar 

  7. Feferman S. [1984]: “Towards useful type-free theories I,” J. of Symbolic Logic, 49, 75–111.

    Article  MATH  MathSciNet  Google Scholar 

  8. Gilmore P.C. [1986]: “Natural Deduction Based Set Theories: A New Resolution of the Old Paradoxes,” J. of Symbolic Logic, 51, 394–411.

    Article  MathSciNet  Google Scholar 

  9. Gilmore P.C. [1997]: “NaDSyL and some applications,” Kurt Gödel Colloquium, LNCS volume 1289, 153–166, Vienna.

    Google Scholar 

  10. Gilmore P.C. [2001]: “An intensional type-theory: Motivation and cut-elimination,” J. of Symbolic Logic, 66(1), 383–400, March 2001.

    Article  MATH  MathSciNet  Google Scholar 

  11. Hermes, H. [1965]: Enumerability, Decidability, Computability. Berlin: Springer Verlag.

    MATH  Google Scholar 

  12. Lewis, D. [1968]: “Counterpart Theory and Quantified Modal Logic,” J. of Philosophy 65, 113–26.

    Article  Google Scholar 

  13. McCarthy J. [1960]: “Recursive Functions of Symbolic Expressions,” CACM 3.

    Google Scholar 

  14. Pawlak Z. [1982]: “Rough Sets,” International Journal of Computer and Information Sciences, 11, 341–350.

    Article  MATH  MathSciNet  Google Scholar 

  15. Prawitz, D. [1965]: Natural Deduction, Stockholm: Almqvist & Wiksell.

    MATH  Google Scholar 

  16. Sato M. [1983]: “Theory of Symbolic Expressions I,” Theoretical Computer Science, 22, 19–55.

    Article  MATH  MathSciNet  Google Scholar 

  17. Voda P. [1984]: “Theory of Pairs, Part I, Provably Recursive Functions,” Technical Report 84-25 of the Dept. of Computer Science, Univ. of British Columbia.

    Google Scholar 

  18. Yao, Y. Y. [1998b]: “On Generalizing Pawlak Approximation Operators”, eds. L. Polkowski and A. Skowron, RSCTC’98, LNAI 1414, Eds. J. G. Carbonell, J. Siekmann, Springer-Verlag, 289–307.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Philosophy, The University of Toronto, USA

    Peter Apostoli & Akira Kanda

Authors
  1. Peter Apostoli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Akira Kanda
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computer Science and Technology, Chongqing University of Posts and Telecommunications, Chongqing, 400065, P.R. China

    Guoyin Wang

  2. Department of Computer Science, Nanchang University, Nanchang, 330029, P.R. China

    Qing Liu

  3. Department of Computer Science, University of Regina, Regina, Saskatchewan, S4S 0A2, Canada

    Yiyu Yao

  4. Institute of Mathematics, Warsaw University, Banacha 2, 02-097, Warsaw, Poland

    Andrzej Skowron

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Apostoli, P., Kanda, A. (2003). Upper and Lower Recursion Schemes in Abstract Approximation Spaces. In: Wang, G., Liu, Q., Yao, Y., Skowron, A. (eds) Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing. RSFDGrC 2003. Lecture Notes in Computer Science(), vol 2639. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39205-X_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-39205-X_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-14040-5

  • Online ISBN: 978-3-540-39205-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation