English
Related papers

Related papers: More on SOP_1 and SOP_2

200 papers

We study links between first-order formulas and arbitrary properties for families of theories, classes of structures and their isomorphism types. Possibilities for ranks and degrees for formulas and theories with respect to given properties…

Logic · Mathematics 2021-04-02 Sergey V. Sudoplatov

We characterize stable T for which the model completion of T_{aut} is stable (i.e., every completion is). Then we prove that ``some completion is stable'' is different and we characterize it. Finally we show that if T is stable, T_{aut} has…

Logic · Mathematics 2007-05-23 Saharon Shelah

Lin and Zhaos theorem on loop formulas states that in the propositional case the stable model semantics of a logic program can be completely characterized by propositional loop formulas, but this result does not fully carry over to the…

Logic in Computer Science · Computer Science 2014-01-17 Joohyung Lee , Yunsong Meng

The article establishes a long list of rigidity properties of lattices in G = SO(n,1) with n>=3 and G = SU(n,1) with n>=2 that are analogous to superrigidity of lattices in higher-rank Lie groups. The arguments are set in the context of…

Representation Theory · Mathematics 2016-09-07 Yehuda Shalom

The first-order relativistic fluid theories of dissipation proposed by Eckart and Landau-Lifshitz have been proved to be unstable. They admit solutions which start in proximity of equilibrium and depart exponentially from it. We show that…

General Relativity and Quantum Cosmology · Physics 2020-09-02 Lorenzo Gavassino , Marco Antonelli , Brynmor Haskell

For processes involving structure functions and/or fragmentation functions, arguments that, over a range of a proper kinematic variable, there is a part that dominates the next-to-leading order (NLO) corrections are briefly reviewed. The…

High Energy Physics - Phenomenology · Physics 2009-11-07 A. P. Contogouris , Z. Merebashvili

We analyze worst-case convergence guarantees of first-order optimization methods over a function class extending that of smooth and convex functions. This class contains convex functions that admit a simple quadratic upper bound. Its study…

Optimization and Control · Mathematics 2022-05-31 Baptiste Goujaud , Adrien Taylor , Aymeric Dieuleveut

We streamline treatments of the interpretability orders $\trianglelefteq^*_\kappa$ of Shelah, the key new notion being that of pseudosaturation. Extending work of Malliaris and Shelah, we classify the interpretability orders on the stable…

Logic · Mathematics 2018-11-14 Douglas Ulrich

We consider the following property of a first order theory T with a distinguished unary predicate P: every model of the theory of P occurs as the P-part of some model of T. We call this property the Gaifman property. Gaifman conjectured…

Logic · Mathematics 2025-07-18 Saharon Shelah , Alexander Usvyatsov

We find a logic really stronger than first order for the random graph with edge probability $\frac 12$ but satisfies the 0-1 law. This means that on the one hand it satisfies the 0-1 law, e.g. for the random graph ${\mathcal G}_{n,1/2}$ and…

Logic · Mathematics 2021-07-16 Saharon Shelah

We provide a novel computer-assisted technique for systematically analyzing first-order methods for optimization. In contrast with previous works, the approach is particularly suited for handling sublinear convergence rates and stochastic…

Optimization and Control · Mathematics 2021-12-22 Adrien Taylor , Francis Bach

We introduce a class of first-order methods for smooth constrained optimization that are based on an analogy to non-smooth dynamical systems. Two distinctive features of our approach are that (i) projections or optimizations over the entire…

Optimization and Control · Mathematics 2025-04-15 Michael Muehlebach , Michael I. Jordan

The Non-Linear Sigma Model (NLSM) is an example of a field theory on a target space exhibiting intricate geometry. One remarkable characteristic of the NLSM is asymptotic freedom, which triggers interest in perturbative calculations. In the…

High Energy Physics - Lattice · Physics 2024-12-04 Paolo Baglioni , Francesco Di Renzo

Monadic second order logic is the expansion of first order logic by quantifiers ranging over unary relations. We study the shared monadic second order theory of finite linear orders, i.e. the pseudofinite monadic second order theory of…

Logic · Mathematics 2021-05-27 Deacon Linkhorn

In this paper we initiate a study of first-order rich groups, i.e., groups where the first-order logic has the same power as the weak second order logic. Surprisingly, there are quite a lot of finitely generated rich groups, they are…

Logic · Mathematics 2022-10-18 Olga Kharlampovich , Alexei Myasnikov , Mahmood Sohrabi

For an indeterminate moment problem we denote the orthonormal polynomials by P_n. We study the relation between the growth of the function P(z)=(\sum_{n=0}^\infty|P_n(z)|^2)^{1/2} and summability properties of the sequence (P_n(z)). Under…

Classical Analysis and ODEs · Mathematics 2017-01-30 Christian Berg , Ryszard Szwarc

We study Two-Variable First-Order Logic, FO2, under semantic constraints that model hierarchically structured data. Our first logic extends FO2 with a linear order < and a chain of increasingly coarser equivalence relations E_1, E_2, ... .…

Logic in Computer Science · Computer Science 2025-12-11 Oskar Fiuk , Emanuel Kieronski , Vincent Michielini

In this paper it is shown that higher order quasiconvex functions suitable in the variational treatment of problems involving second derivatives may be extended to the space of all matrices as classical quasiconvex functions. Precisely, it…

Analysis of PDEs · Mathematics 2009-11-10 Gianni Dal Maso , Irene Fonseca , Giovanni Leoni , Massimiliano Morini

Consider finite sequences $X_{[1,n]}=X_1\dots X_n$ and $Y_{[1,n]}=Y_1\dots Y_n$ of length $n$, consisting of i.i.d.\ samples of random letters from a finite alphabet, and let $S$ and $T$ be chosen i.i.d.\ randomly from the unit ball in the…

Probability · Mathematics 2014-09-30 Raphael Hauser , Heinrich Matzinger , Ionel Popescu

For which sets A does there exist a mapping, computed by a total or partial recursive function, such that the mapping, when its domain is restricted to A, is a 1-to-1, onto mapping to $\Sigma^*$? And for which sets A does there exist such a…

Logic in Computer Science · Computer Science 2017-12-05 Lane A. Hemaspaandra , Daniel Rubery
‹ Prev 1 3 4 5 6 7 10 Next ›