English
Related papers

Related papers: Separation of bounded arithmetic using a consisten…

200 papers

The problem of $\Pi_1-$separating the hierarchy of bounded arithmetic has been studied in the paper. It is shown that the notion of Herbrand Consistency, in its full generality, cannot $\Pi_1-$separate the theory ${\rm…

Logic · Mathematics 2019-07-02 Saeed Salehi

We study well-posedness of boundary value problems of Dirichlet and Neumann type for elliptic systems on the upper half-space with coefficients independent of the transversal variable, and with boundary data in fractional…

Analysis of PDEs · Mathematics 2017-07-26 Alex Amenta , Pascal Auscher

Answering a question left open in \cite{MZ2}, we show for general symmetric hyperbolic boundary problems with constant coefficients, including in particular systems with characteristics of variable multiplicity, that the uniform Lopatinski…

Analysis of PDEs · Mathematics 2007-05-23 Olivier Gues , Guy Metivier , Mark Williams , Kevin Zumbrun

In this Part I, we shall prove the consistency of arithmetic without complete induction from a point of view of strong negation, using its embedding to the tableau system $\bf SN$ of constructive arithmetic with strong negation without…

Logic · Mathematics 2021-08-16 Takao Inoué

We study `definable' subsets of Baire space $\mathcal{N}$. The logic of our arguments is intuitionistic and we use L.E.J.~Brouwer's Thesis on bars in $\mathcal{N}$ and his continuity axioms. We avoid the operation of taking the complement…

Logic · Mathematics 2022-04-22 Wim Veldman

We prove a structure theorem for multiplicative functions which states that an arbitrary bounded multiplicative function can be decomposed into two terms, one that is approximately periodic and another that has small Gowers uniformity norm…

Number Theory · Mathematics 2016-01-27 Nikos Frantzikinakis , Bernard Host

We identify fragments of the arithmetic $S_1$ that enjoy nice closure properties and have exact characterization of their definable multifunctions. To do this, in the language of $S_1$, $L_1$, starting from the formula classes,…

Logic in Computer Science · Computer Science 2025-08-20 Chris Pollett

Pach showed that every $d+1$ sets of points $Q_1,\dotsc,Q_{d+1} \subset \mathbb{R}^d$ contain linearly-sized subsets $P_i\subset Q_i$ such that all the transversal simplices that they span intersect. We show, by means of an example, that a…

Combinatorics · Mathematics 2019-11-20 Boris Bukh , Alfredo Hubard

We prove explicit bounds on the radius of a ball centered at the origin which is guaranteed to contain all bounded connected components of a semi-algebraic set $S \subset \mathbbm{R}^k$ defined by a quantifier-free formula involving $s$…

Symbolic Computation · Computer Science 2011-02-02 Saugata Basu , Marie-Francoise Roy

The path to the solution of Feder-Vardi dichotomy conjecture by Bulatov and Zhuk led through showing that more and more general algebraic conditions imply polynomial-time algorithms for the finite-domain Constraint Satisfaction Problems…

Computational Complexity · Computer Science 2025-02-05 Tomáš Nagy , Michael Pinsker , Michał Wrona

In much discussed work Artemov has recently shown that, for $\mathrm{PA}$, the consistency schema admits a form of uniform verification via selector proofs, despite the unprovability of the corresponding uniform consistency sentence…

Logic · Mathematics 2026-05-06 Harald Grobner

We show that the first order structure whose underlying universe is $\mathbb C$ and whose basic relations are all algebraic subset of $\mathbb C^2$ does not have quantifier elimination. Since an algebraic subset of $\mathbb C ^2$ needs…

Logic · Mathematics 2011-09-20 Serge Randriambololona , Sergei Starchenko

We show that there is a constant $k$ such that Buss's intuitionistic theory $\mathsf{IS}^1_2$ does not prove that SAT requires co-nondeterministic circuits of size at least $n^k$. To our knowledge, this is the first unconditional…

Logic in Computer Science · Computer Science 2025-09-17 Lijie Chen , Jiatu Li , Igor C. Oliveira

We investigate the complexity consequences of adding pointer arithmetic to separation logic. Specifically, we study extensions of the points-to fragment of symbolic-heap separation logic with various forms of Presburger arithmetic…

Logic in Computer Science · Computer Science 2018-03-09 James Brotherston , Max Kanovich

Proving that there are problems in $\mathsf{P}^\mathsf{NP}$ that require boolean circuits of super-linear size is a major frontier in complexity theory. While such lower bounds are known for larger complexity classes, existing results only…

Computational Complexity · Computer Science 2023-06-22 Jan Bydzovsky , Jan Krajicek , Igor C. Oliveira

This paper builds model-theoretic tools to detect changes in complexity among the simple theories. We develop a generalization of dividing, called shearing, which depends on a so-called context c. This leads to defining c-superstability, a…

Logic · Mathematics 2021-07-06 M. Malliaris , S. Shelah

Building on previous results of Xing, we give new lower bounds on the rate of intersecting codes over large alphabets. The proof is constructive, and uses algebraic geometry, although nothing beyond the basic theory of linear systems on…

Combinatorics · Mathematics 2012-01-11 Hugues Randriambololona

We prove a common generalization to several mass partition results using hyperplane arrangements to split $\mathbb{R}^d$ into two sets. Our main result implies the ham-sandwich theorem, the necklace splitting theorem for two thieves, a…

Combinatorics · Mathematics 2024-04-30 Alfredo Hubard , Pablo Soberón

We extend the investigation of BPS saturated t'Hooft-Polyakov monopoles in $\mathcal{M}^{2}\times S^{2}$ to the general case of $SU(N)$ gauge symmetry. This geometry causes the resulting $N-1$ coupled non-linear ordinary differential…

High Energy Physics - Theory · Physics 2015-04-29 Fabrizio Canfora , Gianni Tallarita

Let $A$ be an isotropic, sub-gaussian $m \times n$ matrix. We prove that the process $Z_x := \|Ax\|_2 - \sqrt m \|x\|_2$ has sub-gaussian increments. Using this, we show that for any bounded set $T \subseteq \mathbb{R}^n$, the deviation of…

Probability · Mathematics 2016-06-08 Christopher Liaw , Abbas Mehrabian , Yaniv Plan , Roman Vershynin