English
Related papers

Related papers: Existentially Closed Exponential Fields

200 papers

Logics closed under classes of substitutions broader than class of uniform substitutions are known as hyperformal logics. This paper extends known results about hyperformal logics in two ways. First: we examine a very powerful form of…

Logic · Mathematics 2026-04-28 Shay Allen Logan , Blane Worley

Starting from a very general trace-form entropy, we introduce a pair of algebraic structures endowed by a generalized sum and a generalized product. These algebras form, respectively, two Abelian fields in the realm of the complex numbers…

Mathematical Physics · Physics 2013-02-22 A. M. Scarfone

An important dividing line in the class of unstable theories is being NSOP$_1$, which is more general than being simple. In NSOP$_1$ theories forking independence may not be as well-behaved as in stable or simple theories, so it is replaced…

Logic · Mathematics 2023-03-29 Jan Dobrowolski , Mark Kamsma

We describe a mathematical structure that can give extensional denotational semantics to higher-order probabilistic programs. It is not limited to discrete probabilities, and it is compatible with integration in a way the models that have…

Logic in Computer Science · Computer Science 2021-04-14 Guillaume Geoffroy

We study probabilistic team semantics which is a semantical framework allowing the study of logical and probabilistic dependencies simultaneously. We examine and classify the expressive power of logical formalisms arising by different…

Logic in Computer Science · Computer Science 2019-02-26 Miika Hannula , Åsa Hirvonen , Juha Kontinen , Vadim Kulikov , Jonni Virtema

We consider the Standard Model extended by a heavy scalar singlet in different regions of parameter space and construct the appropriate low-energy effective field theories up to first nontrivial order. This top-down exercise in effective…

High Energy Physics - Phenomenology · Physics 2017-04-05 G. Buchalla , O. Cata , A. Celis , C. Krause

In this paper we present an alternative approach to formalize the theory of logic programming. In this formalization we allow existential quantified variables and equations in queries. In opposite to standard approaches the role of answer…

Logic in Computer Science · Computer Science 2022-07-20 Ján Komara

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

Logic · Mathematics 2007-05-23 Wesley Calvert

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, exhibiting a classical…

Logic in Computer Science · Computer Science 2023-08-11 Eben Blaisdell , Max Kanovich , Stepan L. Kuznetsov , Elaine Pimentel , Andre Scedrov

We characterize the expressive power of extensions of Dependence Logic and Independence Logic by monotone generalized quantifiers in terms of quantifier extensions of existential second-order logic.

Logic · Mathematics 2012-02-24 Fredrik Engström , Juha Kontinen

We give a syntactic characterization of abstract elementary classes (AECs) closed under intersections using a new logic with a quantifier for isomorphism types that we call structural logic: we prove that AECs with intersections correspond…

Logic · Mathematics 2019-05-10 Will Boney , Sebastien Vasey

New classes of classically integrable models in the cosmological theories with a scalar field are obtained by using freedoms of defining time and fields. In particular, some models with the sum of exponential potentials in the flat spatial…

General Relativity and Quantum Cosmology · Physics 2009-10-28 H. Suzuki , E. Takasugi , Y. Takayama

Using ideas from geometric stability theory we construct differentially closed fields with no non-trivial automorphisms.

Logic · Mathematics 2023-11-08 David Marker

In this paper we define intensional models for the classical theory of types, thus arriving at an intensional type logic ITL. Intensional models generalize Henkin's general models and have a natural definition. As a class they do not…

Logic · Mathematics 2007-05-23 Reinhard Muskens

In this paper, we study the differential power operation on ideals. We begin with a focus on monomial ideals in characteristic 0 and find a class of ideals whose differential powers are eventually principal. We also study the containment…

Commutative Algebra · Mathematics 2026-03-18 Jennifer Kenkel , Lillian McPherson , Janet Page , Daniel Smolkin , Monroe Stephenson , Fuxiang Yang

We classify the simple modules of the exceptional algebraic supergroups over an algebraically closed field of prime characteristic.

Representation Theory · Mathematics 2020-07-07 Shun-Jen Cheng , Bin Shu , Weiqiang Wang

We resolve the strong Elementary Equivalence versus Isomorphism Problem for finitely generated fields. That is, we show that for every field in this class there is a first-order sentence which characterizes this field within the class up to…

Logic · Mathematics 2023-11-02 Philip Dittmann , Florian Pop

We study positively closed and strongly positively closed topos-valued models of coherent theories. Positively closed is a global notion (it is defined in terms of all possible outgoing homomorphisms), while strongly positively closed is a…

Category Theory · Mathematics 2026-02-02 Kristóf Kanalas

Emergent patterns in complex systems are related to many intriguing phenomena in modern science and philosophy. Several conceptions such as weak, strong and robust emergence have been proposed to emphasize different epistemological and…

Physics and Society · Physics 2016-10-11 Alberto Pascual-García

We study logic for reasoning with if-then formulas describing dependencies between attributes of objects which are observed in consecutive points in time. We introduce semantic entailment of the formulas, show its fixed-point…

Logic in Computer Science · Computer Science 2021-06-17 Jan Triska , Vilem Vychodil