arXiv subjects

Yuto Takeda

Publications and source records attributed to Yuto Takeda.

4 recordsLinked to original sources

arXiv2026

Frame definability in second-order arithmetic

We study the reverse-mathematical strength of frame definability in modal logic. The central principle is the Valuation Extension Lemma (VEL), which asserts that every assignment of propositional variables on a frame extends to a full valuation. We show that, over $\mathrm{RCA}_0$, VEL is equivalent to $\mathrm{ACA}^{+}_0$, and as are frame-definability principles for Geach axioms and for $\mathbf{GL}$. We also obtain analogous $\mathrm{ACA}^{+}_0$-equivalences for the Barcan and Converse Barcan formulas in modal predicate logic. Finally, we examine variants of VEL for $\mathbf{CTL}$ and $\mathbf{LTL}$ and locate their strengths between familiar subsystems of second-order arithmetic.

math.LO↗

arXiv2026

Bisimulations in second-order arithmetic

This paper investigates the logical strength of two theorems in modal propositional logic - the Hennessy-Milner theorem and the van Benthem characterization theorem - within the framework of second-order arithmetic. We demonstrate that the Hennessy-Milner theorem is equivalent to $\mathrm{ACA}_0$ over $\mathrm{RCA}_0$. For the van Benthem characterization theorem, we introduce three variants: the semantic, syntactic, and hybrid forms. We show that the semantic form is provable in $\mathrm{RCA}_0$, the syntactic form is provable in $\mathrm{PRA}$, and the hybrid form is equivalent to the weak completeness theorem for first-order logic over $\mathrm{RCA}_0$.

math.LO↗

arXiv2025

Completeness theorems for modal logic in second-order arithmetic

This paper investigates the logical strength of completeness theorems for modal propositional logic within second-order arithmetic. We demonstrate that the weak completeness theorem for modal propositional logic is provable in $\mathrm{RCA}_0$, and that, over $\mathrm{RCA}_0$, $\mathrm{ACA}_0$ is equivalent to the strong completeness theorem for modal propositional logic using canonical models. We also consider a simpler version of the strong completeness theorem without referring to canonical models and show that it is equivalent to $\mathrm{WKL}_0$ over $\mathrm{RCA}_0$.

math.LO↗

arXiv2021

Fluctuation in background synaptic activity controls synaptic plasticity

Synaptic plasticity is vital for learning and memory in the brain. It consists of long-term potentiation (LTP) and long-term depression (LTD). Spike frequency is one of the major components of synaptic plasticity in the brain, a noisy environment. Recently, we mathematically analysed the frequency-dependent synaptic plasticity (FDP) in vivo and found that LTP is more likely to occur with an increase in the frequency of background synaptic activity. Previous studies suggest fluctuation in the amplitude of background synaptic activity. However, little is understood about the relationship between synaptic plasticity and the fluctuation in the background synaptic activity. To address this issue, we performed numerical simulations of a calcium-based synapse model. Then, we found attenuation of the tendency to become LTD due to an increase in the fluctuation of background synaptic activity, leading to an enhancement of synaptic weight. Our result suggests that the fluctuation affect synaptic plasticity in the brain.

q-bio.NC↗