English
Related papers

Related papers: Bilinear spaces over a fixed field are simple unst…

200 papers

Let $M$ be a manifold, $V$ be a vector field on $M$, and $B$ be a Banach space. For any fixed function $f:M\rightarrow B$ and any fixed complex number $\lambda$, we study Hyers-Ulam stability of the global differential equation $Vy=\lambda…

Analysis of PDEs · Mathematics 2017-05-26 Maysam Maysami Sadr

We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…

Logic in Computer Science · Computer Science 2015-03-20 Hubie Chen

A dependent theory is a (first order complete theory) T which does not have the independence property. A main result here is: if we expand a model of T by the traces on it of sets definable in a bigger model then we preserve its being…

Logic · Mathematics 2013-02-20 Saharon Shelah

In recent years the idea that not only the configuration space of particles, i.e. spacetime, but also the corresponding momentum space may have nontrivial geometry has attracted significant attention, especially in the context of quantum…

High Energy Physics - Theory · Physics 2016-06-28 Jakub Mielczarek , Tomasz Trzesniewski

We consider the existence and stability of static configurations of a scalar field in a five dimensional spacetime in which the extra spatial dimension is compactified on an $S^1/Z_2$ orbifold. For a wide class of potentials with multiple…

High Energy Physics - Phenomenology · Physics 2008-11-26 Manuel Toharia , Mark Trodden

We study the finite satisfiability problem for the two-variable fragment of first-order logic extended with counting quantifiers (C2) and interpreted over linearly ordered structures. We show that the problem is undecidable in the case of…

Logic in Computer Science · Computer Science 2019-03-14 Witold Charatonik , Piotr Witkowski

We show that the first-order logical theory of the binary overlap-free words (and, more generally, the ${\alpha}$-free words for rational ${\alpha}$, $2 < {\alpha} \leq 7/3$), is decidable. As a consequence, many results previously obtained…

Formal Languages and Automata Theory · Computer Science 2022-09-08 L. Schaeffer , J. Shallit

A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…

Logic in Computer Science · Computer Science 2026-05-07 Matthijs Vákár

We study positive bilinear forms on a Hilbert space which are neither not necessarily bounded nor induced by some positive operator. We show when different families of bilinear forms can be described as a generalized effect algebra. In…

Mathematical Physics · Physics 2015-06-15 A. Dvurečenskij , J. Janda

We characterise the existentially closed models of the theory of exponential fields. They do not form an elementary class, but can be studied using positive logic. We find the amalgamation bases and characterise the types over them. We…

Logic · Mathematics 2021-01-19 Levon Haykazyan , Jonathan Kirby

We give necessary and sufficient geometric conditions for a theory definable in an o-minimal structure to interpret a real closed field. The proof goes through an analysis of thorn-minimal types in super-rosy dependent theories of finite…

Logic · Mathematics 2007-11-02 Assaf Hasson , Alf Onshuus

We develop the theory of frames and Parseval frames for finite-dimensional vector spaces over the binary numbers. This includes characterizations which are similar to frames and Parseval frames for real or complex Hilbert spaces, and the…

Functional Analysis · Mathematics 2009-06-19 Bernhard G. Bodmann , My Le , Letty Reza , Matthew Tobin , Mark Tomforde

This paper presents a type theory in which it is possible to directly manipulate $n$-dimensional cubes (points, lines, squares, cubes, etc.) based on an interpretation of dependent type theory in a cubical set model. This enables new ways…

Logic in Computer Science · Computer Science 2016-11-14 Cyril Cohen , Thierry Coquand , Simon Huber , Anders Mörtberg

The matrix models are non-perturbative formulations of string theory, from which many believe that spacetime arises. The matrix fluctuations around the spacetime thus created should represent both matter and gravitational fields. In this…

High Energy Physics - Theory · Physics 2025-09-24 Pei-Ming Ho , Hikaru Kawai , Harold C. Steinacker

We discuss several examples of three-dimensional critical phenomena that can be described by Landau-Ginzburg-Wilson $\phi^4$ theories. We present an overview of field-theoretical results obtained from the analysis of high-order perturbative…

High Energy Physics - Theory · Physics 2009-11-07 Pasquale Calabrese , Andrea Pelissetto , Paolo Rossi , Ettore Vicari

A structure is called weakly oligomorphic if it realizes only finitely many n-ary positive existential types for every n. The goal of this paper is to show that the notions of homomorphism-homogeneity, and weak oligomorphy are not only…

Logic · Mathematics 2017-04-04 Christian Pech , Maja Pech

An unstable field theory is what we obtain when we linearise the equations of an interacting field theory near an unstable state. Theories of this kind are adopted to model the onset of spontaneous symmetry breakings, when the fields are…

High Energy Physics - Theory · Physics 2023-01-05 L. Gavassino

Modern logics of dependence and independence are based on team semantics, which means that formulae are evaluated not on a single assignment of values to variables, but on a set of such assignments, called a team. This leads to high…

Logic in Computer Science · Computer Science 2021-02-23 Erich Grädel , Phil Pützstück

Intuitively speaking, a classical field theory is background-independent if the structure required to make sense of its equations is itself subject to dynamical evolution, rather than being imposed ab initio. The aim of this paper is to…

General Relativity and Quantum Cosmology · Physics 2015-05-28 Gordon Belot

We study fragments of first-order logic and of least fixed point logic that allow only unary negation: negation of formulas with at most one free variable. These logics generalize many interesting known formalisms, including modal logic and…

Logic in Computer Science · Computer Science 2015-07-01 Luc Segoufin , Balder ten Cate