{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:10:44Z","timestamp":1725487844009},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540140405"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-39205-x_26","type":"book-chapter","created":{"date-parts":[[2007,7,21]],"date-time":"2007-07-21T18:23:13Z","timestamp":1185042193000},"page":"205-212","source":"Crossref","is-referenced-by-count":0,"title":["Upper and Lower Recursion Schemes in Abstract Approximation Spaces"],"prefix":"10.1007","author":[{"given":"Peter","family":"Apostoli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akira","family":"Kanda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","unstructured":"Andrews, James H. [2002]: \u201cA Weakly-Typed Higher Order Logic with General Lambda Terms and Y Combinator,\u201d Proceedings, Works In Progress Track, 15th International Conference on Theorem Proving in Higher Order Logics (TPHOLs\u2019 02), Hampton Roads, Virginia, August 2002, 1\u201311, NASA Conference Publication CP-2002-211736."},{"issue":"1","key":"26_CR2","doi-asserted-by":"publisher","first-page":"33","DOI":"10.2307\/2586525","volume":"65","author":"P. Apostoli","year":"2000","unstructured":"Apostoli, P. [2000]: \u201cThe Analytic Conception of Truth and The Foundations of Arithmetic,\u201d J. of Symbolic Logic, 65(1) 33\u2013102.","journal-title":"J. of Symbolic Logic"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Apostoli P. and A. Kanda [2000]: \u201cApproximation spaces of type-free sets,\u201d with A. Kanda. RSCTC\u2019 00, eds. W. Ziarko, Y.Y. Yao. LNAI volume 2005. Eds. J. G. Carbonell, J. Siekmann, Springer-Verlag, 98\u2013105.","DOI":"10.1007\/3-540-45554-X_11"},{"issue":"6","key":"26_CR4","first-page":"595","volume":"29","author":"J. L. Bell","year":"2000","unstructured":"Bell, J. L. [2000]: \u201cSet and Classes as Many,\u201d J. of Philosophical Logic, 29(6), 595\u2013681.","journal-title":"J. of Philosophical Logic"},{"key":"26_CR5","unstructured":"Cattaneo, G. [1998]: \u201cAbstract Approximation Spaces for Rough Theories,\u201d 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."},{"key":"26_CR6","volume-title":"Annals of Mathematics Studies","author":"A. Church","year":"1941","unstructured":"Church A. [1941]: The Calculi of \u03bb-conversion, Annals of Mathematics Studies 6, Princeton University Press, Princeton."},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.2307\/2274093","volume":"49","author":"S. Feferman","year":"1984","unstructured":"Feferman S. [1984]: \u201cTowards useful type-free theories I,\u201d J. of Symbolic Logic, 49, 75\u2013111.","journal-title":"J. of Symbolic Logic"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"394","DOI":"10.2307\/2274063","volume":"51","author":"P.C. Gilmore","year":"1986","unstructured":"Gilmore P.C. [1986]: \u201cNatural Deduction Based Set Theories: A New Resolution of the Old Paradoxes,\u201d J. of Symbolic Logic, 51, 394\u2013411.","journal-title":"J. of Symbolic Logic"},{"key":"26_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/3-540-63385-5_40","volume-title":"Kurt G\u00f6del Colloquium","author":"P.C. Gilmore","year":"1997","unstructured":"Gilmore P.C. [1997]: \u201cNaDSyL and some applications,\u201d Kurt G\u00f6del Colloquium, LNCS volume 1289, 153\u2013166, Vienna."},{"issue":"1","key":"26_CR10","doi-asserted-by":"publisher","first-page":"383","DOI":"10.2307\/2694928","volume":"66","author":"P.C. Gilmore","year":"2001","unstructured":"Gilmore P.C. [2001]: \u201cAn intensional type-theory: Motivation and cut-elimination,\u201d J. of Symbolic Logic, 66(1), 383\u2013400, March 2001.","journal-title":"J. of Symbolic Logic"},{"key":"26_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-11686-9","volume-title":"Enumerability, Decidability, Computability","author":"H. Hermes","year":"1965","unstructured":"Hermes, H. [1965]: Enumerability, Decidability, Computability. Berlin: Springer Verlag."},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"113","DOI":"10.2307\/2024555","volume":"65","author":"D. Lewis","year":"1968","unstructured":"Lewis, D. [1968]: \u201cCounterpart Theory and Quantified Modal Logic,\u201d J. of Philosophy 65, 113\u201326.","journal-title":"J. of Philosophy"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"McCarthy J. [1960]: \u201cRecursive Functions of Symbolic Expressions,\u201d CACM 3.","DOI":"10.1145\/367177.367199"},{"key":"26_CR14","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BF01001956","volume":"11","author":"Z. Pawlak","year":"1982","unstructured":"Pawlak Z. [1982]: \u201cRough Sets,\u201d International Journal of Computer and Information Sciences, 11, 341\u2013350.","journal-title":"International Journal of Computer and Information Sciences"},{"key":"26_CR15","volume-title":"Natural Deduction","author":"D. Prawitz","year":"1965","unstructured":"Prawitz, D. [1965]: Natural Deduction, Stockholm: Almqvist & Wiksell."},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0304-3975(83)90137-8","volume":"22","author":"M. Sato","year":"1983","unstructured":"Sato M. [1983]: \u201cTheory of Symbolic Expressions I,\u201d Theoretical Computer Science, 22, 19\u201355.","journal-title":"Theoretical Computer Science"},{"key":"26_CR17","unstructured":"Voda P. [1984]: \u201cTheory of Pairs, Part I, Provably Recursive Functions,\u201d Technical Report 84-25 of the Dept. of Computer Science, Univ. of British Columbia."},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Yao, Y. Y. [1998b]: \u201cOn Generalizing Pawlak Approximation Operators\u201d, eds. L. Polkowski and A. Skowron, RSCTC\u201998, LNAI 1414, Eds. J. G. Carbonell, J. Siekmann, Springer-Verlag, 289\u2013307.","DOI":"10.1007\/3-540-69115-4_41"}],"container-title":["Lecture Notes in Computer Science","Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-39205-X_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,20]],"date-time":"2021-08-20T07:13:25Z","timestamp":1629443605000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-39205-X_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540140405"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-39205-x_26","relation":{},"subject":[]}}