Related papers: Absolute model companionship, forcibility, and the…
This work introduces a formulation of model predictive control (MPC) which adaptively reasons about the complexity of the model based on the task while maintaining feasibility and stability guarantees. Existing MPC implementations often…
We show a possible way to construct a consistent formalism where the effective electric charge can change with space and time without destroying the invariance. In the previous work [1][2] we took the gauge coupling to be of the form…
The modal logic of forcing arises when one considers a model of set theory in the context of all its forcing extensions, interpreting necessity as "in all forcing extensions" and possibility as "in some forcing extension". In this modal…
The Periodic Anderson Model (PAM) is widely studied to understand strong correlation physics and especially the competition of antiferromagnetism and singlet formation. Quantum Monte Carlo (QMC) studies have focused both on issues such as…
We define an easily verifiable notion of an atomic formula having uniformly bounded arrays in a structure $M$. We prove that if $T$ is a complete $L$-theory, then $T$ is mutually algebraic if and only if there is some model $M$ of $T$ for…
The principle of `absoluteness of cause' (AC) assumes the cause-effect relation to be observer independent and is a distinct assertion than prohibiting occurrence of any causal loop. Here, we study implication of this novel principle to…
A $\mu$-algebra is a model of a first order theory that is an extension of the theory of bounded lattices, that comes with pairs of terms $(f,\mu_{x}.f)$ where $\mu_{x}.f$ is axiomatized as the least prefixed point of $f$, whose axioms are…
Nonsmooth functions have been used to model discrete-continuous phenomena such as contact mechanics, and are also prevalent in neural network formulations via activation functions such as ReLU. At previous AD conferences, Griewank et al.…
We show that the holographic Complexity = Volume proposal satisfies a very general notion of Momentum/Complexity correspondence (PC), based on the Momentum Constraint of General Relativity. It relates the rate of complexity variation with…
We develop a new forcing notion for adjoining self-coding cofinitary permutations and use it to show that consistently, the minimal cardinality $\mathfrak a_{\text{g}}$ of a maximal cofinitary group (MCG) is strictly between $\aleph_1$ and…
The foundational work by Bell led to an interest in understanding non-local correlations that arise from entangled states shared between distinct, spacelike-separated parties, which formed a foundation for the theory of quantum information…
The disjoint amalgamation property (DAP), which asserts that all spans of a class of models can be amalgamated with minimal intersection, is an important property in the context of abstract elementary classes, with connections to both…
Classical atomistic simulations based on interatomic potentials resolve lattice instabilities, defect nucleation, and microstructure evolution with high fidelity, but their accessible system sizes remain far below those required for…
Given a cardinal $\lambda$, category forcing axioms for $\lambda$-suitable classes $\Gamma$ are strong forcing axioms which completely decide the theory of the Chang model $\mathcal C_\lambda$, modulo generic extensions via forcing notions…
Model predictive control (MPC) is a popular control engineering practice, but requires a sound knowledge of the model. Model-free predictive control (MFPC), a burning issue today, also related to reinforcement learning (RL) in AI, is…
We introduce the notion of pseudo-algebraicity to study atomic models of first order theories (equivalently models of a complete sentence of $L_{\omega_1,\omega}$. Theorem: Let $T$ be any complete first-order theory in a countable language…
Conceptual models as representations of real-world systems are based on diverse techniques in various disciplines but lack a framework that provides multidisciplinary ontological understanding of real-world phenomena. Concurrently, systems…
$\aleph_1$-free groups, abelian groups for which every countable subgroup is free, exhibit a number of interesting algebraic and set-theoretic properties. In this paper, we give a complete proof that the property of being $\aleph_1$-free is…
Automated Theorem Proving (ATP) represents a core research direction in artificial intelligence for achieving formal reasoning and verification, playing a significant role in advancing machine intelligence. However, current large language…
We examine what happens if we replace ZFC with a localistic/relativistic system, LZFC, whose central new axiom, denoted by $Loc({\rm ZFC})$, says that every set belongs to a transitive model of ZFC. LZFC consists of $Loc({\rm ZFC})$ plus…