| |
| 2005 | ||
|---|---|---|
| 10 | EE | Peter Apostoli, Akira Kanda: Proximity Spaces of Exact Sets. RSFDGrC (1) 2005: 94-103 |
| 2004 | ||
| 9 | EE | Peter Apostoli, Akira Kanda, Lech Polkowski: First Steps Towards Computably-Infinite Information Systems. T. Rough Sets: 151-188 (2004) |
| 2003 | ||
| 8 | EE | Peter Apostoli, Akira Kanda: Upper and Lower Recursion Schemes in Abstract Approximation Spaces. RSFDGrC 2003: 205-212 |
| 2000 | ||
| 7 | EE | Peter Apostoli, Akira Kanda: Approximation Spaces of Type-Free Sets. Rough Sets and Current Trends in Computing 2000: 98-105 |
| 1995 | ||
| 6 | Akira Kanda: Acceptable Numerations of Morphisms and Myhill-Shepherdson Property. Math. Log. Q. 41: 39-48 (1995) | |
| 1989 | ||
| 5 | Akira Kanda: Retracts of Numerations. Ann. Pure Appl. Logic 42(3): 225-242 (1989) | |
| 1981 | ||
| 4 | Akira Kanda: Constructive Category Theory (No. 1). MFCS 1981: 563-577 | |
| 1979 | ||
| 3 | Akira Kanda: Fully Effective Solutions of Recursive Domain Equations. MFCS 1979: 326-336 | |
| 2 | Akira Kanda, David Michael Ritchie Park: When are two Effectively given Domains Identical?. Theoretical Computer Science 1979: 170-181 | |
| 1978 | ||
| 1 | Akira Kanda: Data Types as Initial Algebras: A unification of Scottery and ADJery (Extended Abstract) FOCS 1978: 221-230 | |
| 1 | Peter Apostoli | [7] [8] [9] [10] |
| 2 | David Michael Ritchie Park | [2] |
| 3 | Lech Polkowski | [9] |