Related papers: Note on $\mathsf{TD} + \mathsf{DC}_\mathbb{R}$ imp…
P. Das, A. Ghosh and T. Aziz has given in \cite[Theorem 3.15]{ADG} a result on statistically characterized subgroups of the circle group $\mathbb{R}/\mathbb{Z}$, which answers, together with \cite[Corollary 2.4]{DG24}, questions of…
We investigate in more detail the holographic model of a superconductor recently found by Hartnoll, Herzog, and Horowitz [Phys. Rev. Lett. 101, 031601], which is constructed from a condensate of a charged scalar field in AdS_4-Schwarzschild…
In this work we consider an extension MFcind of the Minimalist Foundation MF for predicative constructive mathematics with the addition of inductive and coinductive definitions sufficient to generate Sambin's Positive topologies, namely…
We introduce the Delta-framework, LF-Delta, a dependent type theory based on the Edinburgh Logical Framework LF, extended with the strong proof-functional connectives, i.e. strong intersection, minimal relevant implication and strong union.…
Logic-based approaches to AI have the advantage that their behavior can in principle be explained with the help of proofs of the computed consequences. For ontologies based on Description Logic (DL), we have put this advantage into practice…
We present the results of T-even TMDs in a light front quark-diquark model of nucleons with the wave functions constructed from the soft-wall AdS/QCD prediction. The relations amongst TMDs are discussed. The $p_\perp$ dependence of the TMDs…
A linear code is linear complementary dual (LCD) if it meets its dual trivially. LCD codes have been a hot topic recently due to Boolean masking application in the security of embarked electronics (Carlet and Guilley, 2014). Additive codes…
Assuming $\mathrm{ZF}$, we prove that Turing determinacy ($\mathrm{TD}$) implies countable choice axiom for sets of reals ($\mathrm{CCR}$).
Recent work on test-time scaling for large language model (LLM) reasoning typically assumes that allocating more inference-time computation uniformly improves correctness. However, prior studies show that reasoning uncertainty is highly…
The displacement calculus $\mathbf{D}$ is a conservative extension of the Lambek calculus $\mathbf{L1}$ (with empty antecedents allowed in sequents). $\mathbf{L1}$ can be said to be the logic of concatenation, while $\mathbf{D}$ can be said…
The Minimum Description Length (MDL) principle selects the model that has the shortest code for data plus model. We show that for a countable class of models, MDL predictions are close to the true distribution in a strong sense. The result…
This unpublished note is an alternate, shorter (and hopefully more readable) proof of the decidability of all minimal models. The decidability follows from a proof of the existence of a cellular term in each observational equivalence class…
Low-luminosity active galactic nuclei (LLAGNs) represent the bulk of the AGN population in the present-day universe and they trace low-level accreting supermassive black holes. The observational properties of LLAGNs suggest that their…
The algorithmic independence of conditionals, which postulates that the causal mechanism is algorithmically independent of the cause, has recently inspired many highly successful approaches to distinguish cause from effect given only…
Near-degenerate electronic structures remain a major challenge for conventional single-reference density functional theory (DFT). To address this problem, we propose time-dependent $\Delta$SCF (TD$\Delta$SCF), a novel linear-response scheme…
It is known for quite some time that approximate density functional (ADF) theories fail disastrously when describing the dis-sociative symmetric radical cations R2+. Considering this dissociation limit, previous work has shown that…
In functional programming, datatypes a la carte provide a convenient modular representation of recursive datatypes, based on their initial algebra semantics. Unfortunately it is highly challenging to implement this technique in proof…
Let $C$ be a $(n,q^{2k},n-k+1)_{q^2}$ additive MDS code which is linear over ${\mathbb F}_q$. We prove that if $n \geqslant q+k$ and $k+1$ of the projections of $C$ are linear over ${\mathbb F}_{q^2}$ then $C$ is linear over ${\mathbb…
This note serves two purposes. Firstly, we construct a counterexample to show that the statement on the convergence of the alternating direction method of multipliers (ADMM) for solving linearly constrained convex optimization problems in a…
In the field of quality assurance of hybrid systems (that combine continuous physical dynamics and discrete digital control), Platzer's differential dynamic logic (dL) is widely recognized as a deductive verification method with solid…