Toshimichi Usuba
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Toshimichi Usuba has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Arthur W. Apter
Department of Mathematics, Baruch College of CUNY New York, New York, USA
1 shared publication - Stamatis Dimopoulos
Department of Mathematics and Statistics, University of Cyprus, Nicosia, Cyprus
1 shared publication - Yo Matsubara
Nagoya University
1 shared publication - Yo Matsubara
Chubu University
1 shared publication
Latest Publications
- Open Access
- 15 October 2026
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- p. 1-11
COUNTABLE STATIONARY TOWERS AND REFLECTION PRINCIPLES
In this article, we prove that the precipitousness of $\mathbb {Q}_\gamma $ double struck upper Q Subscript gamma , the countable stationary tower of height $\gamma $ gamma , where $\gamma $ gamma is a limit ordinal $>\omega $ greater than omega , is a consequence of a certain stationary reflection principle for $\mathcal {P}_{\omega _1} H_{\left \vert {V_\gamma } \right \vert {}^+}$ script upper P Subscript omega 1 Baseline upper H Subscript StartAbsoluteValue upper V Sub Subscript gamma Subscript EndAbsoluteValue Sub Superscript plus . Using this, we prove the consistency of the precipitousness of $\mathbb {Q}_\gamma $ double struck upper Q Subscript gamma for some singular $\gamma $ gamma assuming a sufficiently strong large cardinal axiom. Furthermore, assuming the existence of proper class many supercompact cardinals, we build a model where $\mathbb {Q}_\gamma $ double struck upper Q Subscript gamma is precipitous for every limit ordinal $>\omega $ greater than omega .- 15 October 2026
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- p. 1-11
Open AccessCOUNTABLE STATIONARY TOWERS AND REFLECTION PRINCIPLES
In this article, we prove that the precipitousness of $\mathbb {Q}_\gamma $ double struck upper Q Subscript gamma , the countable stationary tower of height $\gamma $ gamma , where $\gamma $ gamma is a limit ordinal $>\omega $ greater than omega , is a consequence of a certain stationary reflection principle for $\mathcal {P}_{\omega _1} H_{\left \vert {V_\gamma } \right \vert {}^+}$ script upper P Subscript omega 1 Baseline upper H Subscript StartAbsoluteValue upper V Sub Subscript gamma Subscript EndAbsoluteValue Sub Superscript plus . Using this, we prove the consistency of the precipitousness of $\mathbb {Q}_\gamma $ double struck upper Q Subscript gamma for some singular $\gamma $ gamma assuming a sufficiently strong large cardinal axiom. Furthermore, assuming the existence of proper class many supercompact cardinals, we build a model where $\mathbb {Q}_\gamma $ double struck upper Q Subscript gamma is precipitous for every limit ordinal $>\omega $ greater than omega . - Open Access
- 12 March 2026
- Published by Springer Nature in Archive for Mathematical Logic
- Vol. 65 (4) , 545-568
Monotonicity of the ultrafilter number function
- 12 March 2026
- Published by Springer Nature in Archive for Mathematical Logic
- Vol. 65 (4) , 545-568
Open AccessMonotonicity of the ultrafilter number function
- 1 August 2025
- Published by Duke University Press in Notre Dame Journal of Formal Logic
- Vol. 66 (3) , 353-369
Generically Extendible Cardinals
In this paper, we study the notion of a generically extendible cardinal, which is a generic version of an extendible cardinal. We prove that the generic extendibility of or has small consistency strength, but that of a cardinal does not. We also consider some results concerned with generically extendible cardinals, such as indestructibility, generic absoluteness of the reals, and Boolean-valued second-order logic.- 1 August 2025
- Published by Duke University Press in Notre Dame Journal of Formal Logic
- Vol. 66 (3) , 353-369
Generically Extendible Cardinals
In this paper, we study the notion of a generically extendible cardinal, which is a generic version of an extendible cardinal. We prove that the generic extendibility of or has small consistency strength, but that of a cardinal does not. We also consider some results concerned with generically extendible cardinals, such as indestructibility, generic absoluteness of the reals, and Boolean-valued second-order logic.- Open Access
Variants of Łoś's Theorem
We study \L o\'s's theorem in a choiceless context. We introduce some variants of \L o\'s's theorem. These variants seem weaker than \L o\'s's theorem, but we prove that these are equivalent to \L o\'s's theorem.
Open AccessVariants of Łoś's Theorem
We study \L o\'s's theorem in a choiceless context. We introduce some variants of \L o\'s's theorem. These variants seem weaker than \L o\'s's theorem, but we prove that these are equivalent to \L o\'s's theorem.
- Open Access
A note on uniform ultrafilters in a choiceless context
In \cite{HK}, Hayut and Karagila asked some questions about uniform ultrafilters in a choiceless context. We provide several answers to their questions.
Open AccessA note on uniform ultrafilters in a choiceless context
In \cite{HK}, Hayut and Karagila asked some questions about uniform ultrafilters in a choiceless context. We provide several answers to their questions.
- 1 January 2024
- Published by Institute of Mathematics, Polish Academy of Sciences in Bulletin of the Polish Academy of Sciences. Mathematics
- Vol. 72 (1) , 17-44
A note on Łoś theorem without the Axiom of Choice
We study some topics around Łoś’s theorem without assuming the Axiom of Choice. We prove that Łoś’s fundamental theorem on ultraproducts is equivalent to a weak form that every ultrapower is elementarily equivalent to its source structure. On the other ha
- 1 January 2024
- Published by Institute of Mathematics, Polish Academy of Sciences in Bulletin of the Polish Academy of Sciences. Mathematics
- Vol. 72 (1) , 17-44
A note on Łoś theorem without the Axiom of Choice
We study some topics around Łoś’s theorem without assuming the Axiom of Choice. We prove that Łoś’s fundamental theorem on ultraproducts is equivalent to a weak form that every ultrapower is elementarily equivalent to its source structure. On the other ha
- Open Access
Generically extendible cardinals
In this paper, we study generically extendible cardinal, which is a generic version of extendible cardinal. We prove that the generic extendibility of $\omega_1$ or $\omega_2$ has small consistency strength, but of a cardinal $>\omega_2$ is not. We also consider some results concerning with generic extendible cardinals, such as indestructibility, generic absoluteness of the reals, and Boolean valued second order logic.Open AccessGenerically extendible cardinals
In this paper, we study generically extendible cardinal, which is a generic version of extendible cardinal. We prove that the generic extendibility of $\omega_1$ or $\omega_2$ has small consistency strength, but of a cardinal $>\omega_2$ is not. We also consider some results concerning with generic extendible cardinals, such as indestructibility, generic absoluteness of the reals, and Boolean valued second order logic. - 3 June 2023
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 259 (1) , 1-39
The list-chromatic number and the coloring number of uncountable graphs
- 3 June 2023
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 259 (1) , 1-39
The list-chromatic number and the coloring number of uncountable graphs
- Open Access
The list-chromatic number and the coloring number of uncountable graphs
We study the list-chromatic number and the coloring number of graphs, especially uncountable graphs. We show that the coloring number of a graph coincides with its list-chromatic number provided that the diamond principle holds. Under the GCH assumption, we prove the singular compactness theorem for the list-chromatic number. We also investigate reflection principles for the list-chromatic number and the coloring number of graphs.
Open AccessThe list-chromatic number and the coloring number of uncountable graphs
We study the list-chromatic number and the coloring number of graphs, especially uncountable graphs. We show that the coloring number of a graph coincides with its list-chromatic number provided that the diamond principle holds. Under the GCH assumption, we prove the singular compactness theorem for the list-chromatic number. We also investigate reflection principles for the list-chromatic number and the coloring number of graphs.
- Open Access
Geology of symmetric grounds
Let us say that a model of $\mathsf{ZF}$ is a symmetric ground if $V$ is a symmetric extension of the model. In this paper, we investigate set-theoretic geology of symmetric grounds. Under a certain assumption, we show that all symmetric grounds of $V$ are uniformly definable. We also show that if $\mathsf{AC}$ is forceable over $V$, then the symmetric grounds are downward directed.Open AccessGeology of symmetric grounds
Let us say that a model of $\mathsf{ZF}$ is a symmetric ground if $V$ is a symmetric extension of the model. In this paper, we investigate set-theoretic geology of symmetric grounds. Under a certain assumption, we show that all symmetric grounds of $V$ are uniformly definable. We also show that if $\mathsf{AC}$ is forceable over $V$, then the symmetric grounds are downward directed.