default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKojiro Higuchi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j9]Kojiro Higuchi, Yoshihiro Horihata:
Weak theories of concatenation and minimal essentially undecidable theories - An encounter of $${\mathsf{WTC}}$$ WTC and $${\mathsf{S2S}}$$ S 2 S. Arch. Math. Log. 53(7-8): 835-853 (2014)- [j8]Kojiro Higuchi, W. M. Phillip Hudelson, Stephen G. Simpson
, Keita Yokoyama:
Propagation of partial randomness. Ann. Pure Appl. Log. 165(2): 742-758 (2014) - [j7]Kojiro Higuchi, Takayuki Kihara:
Inside the Muchnik degrees I: Discontinuity, learnability and constructivism. Ann. Pure Appl. Log. 165(5): 1058-1114 (2014) - [j6]Kojiro Higuchi, Takayuki Kihara:
Inside the Muchnik degrees II: The degree structures induced by the arithmetical hierarchy of countably continuous functions. Ann. Pure Appl. Log. 165(6): 1201-1241 (2014) - [j5]Kojiro Higuchi, Takayuki Kihara:
On effectively closed sets of effective strong measure zero. Ann. Pure Appl. Log. 165(9): 1445-1469 (2014) - [j4]Makoto Fujiwara, Kojiro Higuchi, Takayuki Kihara:
On the strength of marriage theorems and uniformity. Math. Log. Q. 60(3): 136-153 (2014) - [j3]Kojiro Higuchi, NingNing Peng:
Defining a randomness notion via another. Math. Log. Q. 60(4-5): 280-288 (2014) - 2013
- [i2]Kojiro Higuchi, Takayuki Kihara:
Inside the Muchnik Degrees II: The Degree Structures induced by the Arithmetical Hierarchy of Countably Continuous Functions. CoRR abs/1309.1937 (2013) - 2012
- [j2]Kojiro Higuchi:
Effectively closed mass problems and intuitionism. Ann. Pure Appl. Log. 163(6): 693-697 (2012) - [c3]Kojiro Higuchi, Takayuki Kihara:
Effective Strong Nullness and Effectively Closed Sets. CiE 2012: 303-312 - [c2]NingNing Peng, Kojiro Higuchi, Takeshi Yamazaki, Kazuyuki Tanaka:
Relative Randomness for Martin-Löf Random Sets. CiE 2012: 581-588 - [i1]Kojiro Higuchi, Takayuki Kihara:
Inside the Muchnik Degrees: Discontinuity, Learnability, and Constructivism. CoRR abs/1210.0697 (2012) - 2011
- [j1]Kojiro Higuchi, Arno Pauly:
The degree structure of Weihrauch-reducibility. Log. Methods Comput. Sci. 9(2) (2011) - 2010
- [c1]Kojiro Higuchi:
Pw{\cal P}_w Is Not a Heyting Algebra. CiE 2010: 190-194
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-10-07 21:26 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:
