Related papers: Bilinear spaces over a fixed field are simple unst…
We indicate a way of distinguishing between structures, for which, two structures are said to be separable.Being separable implies being non-isomorphic. We show that for any first order theory $T$ in a countable language, if it has an…
Monadic stability and the more general monadic dependence (or NIP) are tameness conditions for classes of logical structures, studied in the 80's in Shelah's classification program in model theory. They recently emerged in algorithmic and…
We consider the first-order theory of random variables with the probabilistic independence relation, which concerns statements consisting of random variables, the probabilistic independence symbol, logical operators, and existential and…
This paper presents preliminary work on a general system for integrating dependent types into substructural type systems such as linear logic and linear type theory. Prior work on this front has generally managed to deliver type systems…
This work concerns scalar field theories with topologically nontrivial vacuum manifold in rotationally symmetric backgrounds of arbitrary dimension. Lagrangians with canonical and generalized kinetic terms are considered, and a Bogomol'nyi…
A conjecture in algorithmic model theory predicts that the model-checking problem for first-order logic is fixed-parameter tractable on a hereditary graph class if and only if the class is monadically dependent. Originating in model theory,…
In this paper, we prove that the world of near-vector spaces allows us to work with non-linear problems and yet, gives access to most of the tools linear algebra has to offer. We establish some fundamental results for near-vector spaces…
We discuss the solvability of an infinite system of first order ordinary differential equations on the half line, subject to nonlocal initial conditions. The main result states that if the nonlinearities possess a suitable "sub-linear"…
This paper provides two extensions of first order logic by `$\omega$-rules'. In each case we characterize the countable structures whose theory in the logic is categorical (has a unique model). In the one-sorted inferential $\omega$-logic,…
Possible transcendental nature of Euler's constant $\gamma$ has been the focus of study for sometime now. One possible approach is to consider $\gamma$ not in isolation, but as an element of the infinite family of generalised Euler-Briggs…
The theory of optimal choice sets offers a well-established solution framework in social choice and game theory. In social choice theory, decision-making is typically modeled as a maximization problem. However, when preferences are cyclic…
A first-order theory has the Schroder-Bernstein property if any two of its models that are elementarily bi-embeddable are isomorphic. We prove that if a countable theory T has the Schroder-Bernstein property then it is classifiable (it is…
Field theory is an area in physics with a deceptively compact notation. Although general purpose computer algebra systems, built around generic list-based data structures, can be used to represent and manipulate field-theory expressions,…
We develop foundational aspects of stability theory in affine logic. On the one hand, we prove appropriate affine versions of many classical results, including definability of types, existence of non-forking extensions, and other…
The gauge theories underlying gauged supergravity and exceptional field theory are based on tensor hierarchies: generalizations of Yang-Mills theory utilizing algebraic structures that generalize Lie algebras and, as a consequence, require…
A slip on a paper concerning near-vector spaces is fixed. New characterization of near-vector spaces determined by finite fields is provided and the number (up to the isomorphism) of these spaces is exhibited.
We study a classical bilocal field theory perturbatively up to second order. The chosen theory is the simplest which incorporates action-at-a-distance, while keeping non-local effects short-ranged. We show that the new degrees of freedom…
We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…
We introduce the notions of triviality and order-triviality for global invariant types in an arbitrary first-order theory and show that they are well behaved in the NIP context. We show that these two notions agree for invariant global…
In this work, we investigate the properties of string effective theories with scalar field(s) and a scalar potential. We first claim that in most examples known, such theories are multifield, with at least 2 non-compact field directions;…