default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKentaro Sato
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Kentaro Sato:
A new model construction by making a detour via intuitionistic theories IV: A closer connection between KPω and BI. Ann. Pure Appl. Log. 175(7): 103422 (2024)- 2023
- [j14]Kentaro Sato:
A new model construction by making a detour via intuitionistic theories III: Ultrafinitistic proofs of conservations of Σ11 collection. Ann. Pure Appl. Log. 174(3): 103207 (2023) - 2022
- [j13]Kentaro Sato:
Bounded inductive dichotomy: separation of open and clopen determinacies with finite alternatives in constructive contexts. Arch. Math. Log. 61(3-4): 399-435 (2022) - [c2]Satoru Izumi, Kentaro Sato, Akiko Takahashi, Shinji Chiba:
Introductory Education for IoT Technology for First-Year Students. TALE 2022: 715-718 - 2020
- [j12]Kentaro Sato:
Ordinal analyses for monotone and cofinal transfinite inductions. Arch. Math. Log. 59(3-4): 277-291 (2020) - [j11]Kentaro Sato:
Elementary inductive dichotomy: Separation of open and clopen determinacies with infinite alternatives. Ann. Pure Appl. Log. 171(3) (2020)
2010 – 2019
- 2015
- [j10]Kentaro Sato:
Full and hat inductive definitions are equivalent in NBG. Arch. Math. Log. 54(1-2): 75-112 (2015) - [j9]Kentaro Sato, Rico Zumbrunnen:
A new model construction by making a detour via intuitionistic theories I: Operational set theory without choice is Π1-equivalent to KP. Ann. Pure Appl. Log. 166(2): 121-186 (2015) - [j8]Kentaro Sato:
A new model construction by making a detour via intuitionistic theories II: Interpretability lower bound of Feferman's explicit mathematics T0. Ann. Pure Appl. Log. 166(7-8): 800-835 (2015) - 2014
- [j7]Dandolo Flumini, Kentaro Sato:
From hierarchies to well-foundedness. Arch. Math. Log. 53(7-8): 855-863 (2014) - [j6]Kentaro Sato:
Forcing for hat inductive definitions in arithmetic. Math. Log. Q. 60(4-5): 314-318 (2014) - 2011
- [j5]Kentaro Sato:
The strength of extensionality II - Weak weak set theories without infinity. Ann. Pure Appl. Log. 162(8): 579-646 (2011)
2000 – 2009
- 2009
- [j4]Kentaro Sato:
The strength of extensionality I - weak weak set theories with infinity. Ann. Pure Appl. Log. 157(2-3): 234-268 (2009) - 2007
- [j3]Kentaro Sato:
Double helix in large large cardinals and iteration of elementary embeddings. Ann. Pure Appl. Log. 146(2-3): 199-236 (2007) - [j2]Katsuhiko Sano
, Kentaro Sato:
Semantical Characterizations for Irreflexive and Generalized Modal Languages. Notre Dame J. Formal Log. 48(2): 205-228 (2007) - 2005
- [j1]Keikichi Hirose, Kentaro Sato, Yasufumi Asano, Nobuaki Minematsu:
Synthesis of F0 contours using generation process model parameters predicted from unlabeled corpora: application to emotional speech synthesis. Speech Commun. 46(3-4): 385-404 (2005) - 2004
- [c1]Keikichi Hirose, Kentaro Sato, Nobuaki Minematsu:
Corpus-based synthesis of fundamental frequency contours with various speaking styles from text using F0 contour generation process model. SSW 2004: 161-166
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-08-01 20:09 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:
