Related papers: Bounded Symbiosis and Upwards Reflection

We study a class of evolutionary partial differential systems with two components related to second order (in time) non-evolutionary equations of odd order in spatial variable. We develop the formal diagonalisation method in symbolic…

A diagonal version of the strong reflection principle is introduced, along with fragments of this principle associated to arbitrary forcing classes. The relationships between the resulting principles and related principles, such as the…

We try to build, provably in ZFC, for a first order T a model in which any isomorphism between two Boolean algebras is definable. The problem, compared to [Sh:384], is with pseudo-finite Boolean algebras. A side benefit is that we do not…

The evolution of a large class of biological, physical and engineering systems can be studied through both dynamical systems theory and Hamiltonian mechanics. The former theory, in particular its specialization to study systems with…

Higher-order interactions play a key role for the stability and function of a complex system. However, how to identify them is still an open problem. Here, we propose a method to fully reconstruct the structural connectivity of a system of…

This paper investigates the independence polynomials arising from iterated strong products of cycle graphs, examining their algebraic symmetries and combinatorial structures. Leveraging modular arithmetic and Galois theory, we establish…

We study the celestial description of the $O(N)$ sigma model in the large $N$ limit as introduced by Coleman, Jackiw and Politzer. Focusing on three dimensions, we analyze the implications of a UV complete, all-loop order 4-point amplitude…

In experimental applications of bounded-reasoning models, behavior is often summarized by distributions of "levels". We argue that such summaries conflate two conceptually distinct dimensions: a player's type, capturing beliefs about what…

This article consists in applications of [arXiv:2511.14232] in the case of homemomorphisms of higher genus surfaces whose homological rotation set is big enough -- a class of dynamics that is open. We first prove a structure theorem for the…

In the setting of constructive reverse mathematics, we analyse the downward L\"owenheim-Skolem (DLS) theorem of first-order logic, stating that every infinite model has a countable elementary submodel. Refining the well-known equivalence of…

Slicing a module into semisimple ones is useful to study modules. Loewy structures provide a means of doing so. To establish the Loewy structures of projective modules over a finite dimensional symmetric algebra over a field $F$, the…

This work deals with the Landau equation in a bounded domain with the Maxwell reflection condition on the boundary for any (possibly smoothly position dependent) accommodation coefficient and for the full range of interaction potentials,…

In recent work, comonads and associated structures have been used to analyse a range of important notions in finite model theory, descriptive complexity and combinatorics. We extend this analysis to Hybrid logic, a widely-studied extension…

The biharmonic equation arises in areas of continuum mechanics including linear elasticity theory and the Stokes flows, as well as in a radar imaging problem. We discuss the reflection formulas for the biharmonic functions…

Large Language Models (LLMs) have benefited enormously from scaling, yet these gains are bounded by five fundamental limitations: (1) hallucination, (2) context compression, (3) reasoning degradation, (4) retrieval fragility, and (5)…

We define a fragment of monadic infinitary second-order logic corresponding to an abstract separation property. We use this to define the concept of a separation subclass. We use model theoretic techniques and games to show that separation…

We develop a rewriting theory suitable for diagrammatic algebras and lay down the foundations of a systematic study of their higher structures. In this paper, we focus on the question of finding bases. As an application, we give the first…

We extend our approach to abstract syntax (with binding constructions) through modules and linearity. First we give a new general definition of arity, yielding the companion notion of signature. Then we obtain a modularity result as…

A co-valuation is, essentially, a minimal finite cover. We introduce a logic based on co-valuations, which play the role of valuations of free variables in classical first-order logic, and show that the fundamental tools of model theory --…

We introduce several highness notions on degrees related to the problem of computing isomorphisms between structures, provided that isomorphisms exist. We consider variants along axes of uniformity, inclusion of negative information, and…