default search action
Akira Kanda
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2005
- [c7]Peter Apostoli, Akira Kanda:
Proximity Spaces of Exact Sets. RSFDGrC (1) 2005: 94-103 - 2004
- [j10]Peter Apostoli, Akira Kanda, Lech Polkowski:
First Steps Towards Computably-Infinite Information Systems. Trans. Rough Sets 2: 151-188 (2004) - 2003
- [c6]Peter Apostoli, Akira Kanda:
Upper and Lower Recursion Schemes in Abstract Approximation Spaces. RSFDGrC 2003: 205-212 - 2000
- [c5]Peter Apostoli, Akira Kanda:
Approximation Spaces of Type-Free Sets. Rough Sets and Current Trends in Computing 2000: 98-105
1990 – 1999
- 1995
- [j9]Akira Kanda:
Acceptable Numerations of Morphisms and Myhill-Shepherdson Property. Math. Log. Q. 41: 39-48 (1995)
1980 – 1989
- 1989
- [j8]Akira Kanda:
Retracts of Numerations. Ann. Pure Appl. Log. 42(3): 225-242 (1989) - 1988
- [j7]Akira Kanda:
Productive sets and constructively nonpartial-recursive functions. Arch. Math. Log. 27(1): 49-50 (1988) - [j6]Akira Kanda:
Recursion theorems and effective domains. Ann. Pure Appl. Log. 38(3): 289-300 (1988) - 1987
- [j5]Akira Kanda, Alistair H. Lachlan:
Alternative Characterizations of Precomplete Numerations. Math. Log. Q. 33(2): 97-100 (1987) - 1986
- [j4]Akira Kanda:
Classes of Numeration Models of λ-Calculus. Math. Log. Q. 32(19-24): 315-322 (1986) - [j3]Akira Kanda:
Numeration Models of λβ-Calculus. Math. Log. Q. 32(25-30): 409-414 (1986) - 1985
- [j2]Akira Kanda:
Numeration Models of λ-Calculus. Math. Log. Q. 31(14-18): 209-220 (1985) - [j1]Akira Kanda:
Acceptable Numerations of Function Spaces. Math. Log. Q. 31(31-34): 503-508 (1985) - 1981
- [c4]Akira Kanda:
Constructive Category Theory (No. 1). MFCS 1981: 563-577 - 1980
- [b1]Akira Kanda:
Effective solutions of recursive domain equations. University of Warwick, Coventry, UK, 1980
1970 – 1979
- 1979
- [c3]Akira Kanda:
Fully Effective Solutions of Recursive Domain Equations. MFCS 1979: 326-336 - [c2]Akira Kanda, David Michael Ritchie Park:
When are two Effectively given Domains Identical?. Theoretical Computer Science 1979: 170-181 - 1978
- [c1]Akira Kanda:
Data Types as Initial Algebras: A unification of Scottery and ADJery (Extended Abstract). FOCS 1978: 221-230
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: