Related papers: Existentially Closed Exponential Fields
We present a new fragment of axiomatic set theory for pure sets and for the iteration of power sets within given transitive sets. It turns out that this formal system admits an interesting hierarchy of models with true membership relation…
We continue investigating the structure of externally definable sets in NIP theories and preservation of NIP after expanding by new predicates. Most importantly: types over finite sets are uniformly definable; over a model, a family of…
A system of fermions with short-range interactions at finite density is studied using the framework of effective field theory. The effective action formalism for fermions with auxiliary fields leads to a loop expansion in which…
We introduce a semantics for epistemic logic exploiting a belief base abstraction. Differently from existing Kripke-style semantics for epistemic logic in which the notions of possible world and epistemic alternative are primitive, in the…
NTP2 is a large class of first-order theories defined by Shelah and generalizing simple and NIP theories. Algebraic examples of NTP2 structures are given by ultra-products of p-adics and certain valued difference fields (such as a…
We show that descriptive complexity's result extends in High Order Logic to capture the expressivity of Turing Machine which have a finite number of alternation and whose time or space is bounded by a finite tower of exponential. Hence we…
We investigate the existence of "generic derivations" in exponential fields. We show that exponential fields without additional compatibility conditions between derivation and exponentiation cannot support a generic derivation.
In a previous work we introduced a non-associative non-commutative logic extended by multimodalities, called subexponentials, licensing local application of structural rules. Here, we further explore this system, considering a classical…
Class field theory furnishes an intrinsic description of the abelian extensions of a number field that is in many cases not of an immediate algorithmic nature. We outline the algorithms available for the explicit computation of such…
In this note we study sets of NIP formulas in some theories of fields and valued fields, with a special focus on the sets of quantifier-free and existential formulas. First, we give a new proof of the fact that Separably Closed Valued…
This paper is a sequel to "Logical systems I: Lambda calculi through discreteness". It provides a general 2-categorical setting for extensional calculi and shows how intensional and extensional calculi can be related in logical systems. We…
We consider an N-level non-Hermitian Hamiltonian with an exceptional point of order N. We define adiabatic equivalence in such systems and explore topological phase. We show that the topological exceptional states appear at the interface of…
We discuss the Renyi entanglement entropies of descendant states in critical one-dimensional systems with boundaries, that map to boundary conformal field theories in the scaling limit. We unify the previous conformal-field-theory…
The exponential modalities of linear logic have been used by various authors to model infinite-dimensional quantum systems. This paper explains how these modalities can also give rise to the complementarity principle of quantum mechanics.…
Assuming Schanuel's conjecture, we prove that the complete theory $T_{\exp}$ of the real exponential field is axiomatized by the axioms of definably complete exponential fields satisfying $\exp' = \exp$. This implies the result of Macintyre…
As the prototypical category, $\mathbf{Set}$ has many properties which make it special amongst categories. From the point of view of mathematical logic, one such property is that $\mathbf{Set}$ has enough structure to "properly" formalise…
We prove that for no nontrivial ordered abelian group G, the ordered power series field R((G)) admits an exponential, i.e. an isomorphism between its ordered additive group and its ordered multiplicative group of positive elements, but that…
Logical relations are one of the most powerful techniques in the theory of programming languages, and have been used extensively for proving properties of a variety of higher-order calculi. However, there are properties that cannot be…
This paper combines two studies: a topological semantics for epistemic notions and abstract argumentation theory. In our combined setting, we use a topological semantics to represent the structure of an agent's collection of evidence, and…
In this paper, we survey and refine several results -- some previously established in the literature -- that facilitate the construction of exponential bases on planar domains with explicit control over the associated frame bounds. We apply…