Related papers: Sharpening independence results for Huntington's a…
By Lindstr\"{o}m's theorems, the expressive power of first order logic (and similarly continuous logic) is not strengthened without losing some interesting property. Weakening it, is however less harmless and has been payed attention by…
We introduce a notion of a weak Poisson structure on a manifold $M$ modeled on a locally convex space. This is done by specifying a Poisson bracket on a subalgebra $\cA \subeq C^\infty(M)$ which has to satisfy a non-degeneracy condition…
Finite-order invariants of knots in arbitrary 3-manifolds (including non-orientable ones) are constructed and studied by methods of the topology of discriminant sets. Obstructions to the integrability of admissible weight systems to…
In this paper we prove that no consistent finitely axiomatized theory one-dimensionally interprets its own extension with predicative comprehension. This constitutes a result with the flavor of the Second Incompleteness Theorem whose…
Generalised indiscernibles highlight a strong link between model theory and structural Ramsey theory. In this paper, we use generalised indiscernibles as tools to prove results in both these areas. More precisely, we first show that a…
Hardness magnification reduces major complexity separations (such as $\mathsf{\mathsf{EXP}} \nsubseteq \mathsf{NC}^1$) to proving lower bounds for some natural problem $Q$ against weak circuit models. Several recent works [OS18, MMW19,…
Pick a formal system. Any formal system. Whatever your favourite formal system is, as long as it's capable of reasoning about elementary arithmetic. The First Spectral Gap Incompleteness Theorem of [CPGW15] proved that there exist…
We approach the analysis of dynamical and geometrical properties of nonholonomic mechanical systems from the discussion of a more general class of auxiliary constrained Hamiltonian systems. The latter is constructed in a manner that it…
The second author previously discussed how classical complexity separation conjectures, we call them "axioms", have implications in three manifold topology: polynomial length stings of operations which preserve certain Jones polynomial…
We give another proof of a theorem of Fife - understood broadly as providing a finite automaton that gives a complete description of all infinite binary overlap-free words. Our proof is significantly simpler than those in the literature. As…
This letter aims at resolving the issues raised in the recent short communication [1] and answered by [2] by proposing a systematic approximation scheme based on non-mapped shape functions, which both allows to fully exploit the unique…
In these lectures I propose to push Einstein's principle of coordinate independence to the extreme in order to restrict the possible form of fundamental equations of motion in physics. I start from nearly tautological system theoretic…
In this note, we describe how the study of backgrounds for general quantum systems can be formulated in terms of the representation theory of abstract $C^*$ algebras. We illustrate our general framework through two example systems:…
With this contribution, we give a complete and comprehensive framework for modeling the dynamics of complex mechanical structures as port-Hamiltonian systems. This is motivated by research on the potential of lightweight construction using…
Abstract argumentation provides us with methods such as gradual and Dung semantics with which to evaluate arguments after potential attacks by other arguments. Some of these methods can take intrinsic strengths of arguments as input, with…
We formulate a property strengthening the Disjoint Amalgamation Property and prove that every Fraisse structure in a finite relational language with relation symbols of arity at most two having this property has finite big Ramsey degrees…
We formulate and prove the generalizations of Friedman's free set and thin set theorems and of the rainbow Ramsey theorem to colorings of barriers. We analyze the strength of these theorems from the point of view of computability theory…
We present several philosophical ideas emerging from the studies of complex systems. We make a brief introduction to the basic concepts of complex systems, for then defining "abstraction levels". These are useful for representing…
Much like admissibility is the key concept underlying preferred semantics, strong admissibility is the key concept underlying grounded semantics, as membership of a strongly admissible set is sufficient to show membership of the grounded…
We consider free-fermion chains in the ground state and the entanglement Hamiltonian for a subsystem consisting of two separated intervals. In this case, one has a peculiar long-range hopping between the intervals in addition to the…