Related papers: Expansions of pseudofinite structures and circuit …
We propose some new method of constructing configurations, which consists in consecutive inscribing copies of one underlying configuration. A uniform characterization of the obtained class and the one introduced in our paper untitled…
We use fast-growing finite and infinite sequences of natural numbers and more complicated constructs to define models of hypercomputation and interpret non-arithmetic predicates, with the strongest extensions reaching full second order…
A wide range of problems can be modelled as constraint satisfaction problems (CSPs), that is, a set of constraints that must be satisfied simultaneously. Constraints can either be represented extensionally, by explicitly listing allowed…
In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…
This paper addresses an issue essential to the study of hidden supersymmetries (meaning here ones that do not close on the Hamiltonian) for one-dimensional non-linear supersymmetric sigma models. The issue relates to ambiguities, due to…
We study the problem of assessing the robustness of counterfactual explanations for deep learning models. We focus on $\textit{plausible model shifts}$ altering model parameters and propose a novel framework to reason about the robustness…
We apply the recently developed technology of cofinality spectrum problems to prove a range of theorems in model theory. First, we prove that any model of Peano arithmetic is $\lambda$-saturated iff it has cofinality $\geq \lambda$ and the…
The many-body problem can in general not be solved exactly, and one of the most prominent approximations is to build perturbation expansions. A huge variety of expansions is possible, which differ by the quantity to be expanded, the…
Pin sequences play an important role in the structural study of permutation classes. In this paper, we study the permutation classes that comprise all the finite subpermutations contained in an infinite pin sequence. We prove that these…
We study the complexity of symmetric assembly puzzles: given a collection of simple polygons, can we translate, rotate, and possibly flip them so that their interior-disjoint union is line symmetric? On the negative side, we show that the…
We present a class of Poisson structures on trivial extension algebras which generalize some known structures induced by Poisson modules. We show that there exists a one-to-one correspondence between such a class of Poisson structures and…
We present the finite first-order theory (FFOT) machine, which provides an atemporal description of computation. We then develop a concept of complexity for the FFOT machine, and prove that the class of problems decidable by a FFOT machine…
Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree $\textbf{d}$ is the degree of categoricity of a computable structure $\mathcal{M}$ and is not the strong degree of categoricity of any computable…
We present a counter-example to the recent claim that supermultiplets of N-extended supersymmetry with no central charge and in 1-dimension are specified unambiguously by providing the numbers of component fields in all available…
We deal with models of Peano arithmetic (specifically with a question of Ali Enayat). The methods are from creature forcing. We find an expansion of N such that its theory has models with no (elementary) end extensions. In fact there is a…
A subset of a model of ${\sf PA}$ is called neutral if it does not change the $\mathrm{dcl}$ relation. A model with undefinable neutral classes is called neutrally expandable. We study the existence and non-existence of neutral sets in…
This work addresses the existence of transitive extensions of certain infinite permutation groups which arise as the automorphism groups of model-theoretic structures which are generic in the Fra\"iss\'e sense. The study of transitive…
This article describes a formal strategy of geometric complexity theory (GCT) to resolve the {\em self referential paradox} in the $P$ vs. $NP$ and related problems. The strategy, called the {\em flip}, is to go for {\em explicit proofs} of…
We introduce the notion of non commutative truncated polynomial extension of an algebra A. We study two families of these extensions. For the first one we obtain a complete classification and for the second one, which we call upper…
We consider the problem of constructing a weakly-continuous mapping extending continuous mapping defined on a dense set of a topological space to the entire space. Theorem on necessary and sufficient conditions for the existence of such an…