Related papers: On Guaspari's problem about partially conservative…
Induction is typically formalized as a rule or axiom extension of the LK-calculus. While this extension of the sequent calculus is simple and elegant, proof transformation and analysis can be quite difficult. Theories with an induction…
Though state-of-the-art sentence representation models can perform tasks requiring significant knowledge of grammar, it is an open question how best to evaluate their grammatical knowledge. We explore five experimental methods inspired by…
The aim of this work is to extend and prove the Onsager conjecture for a class of conservation laws that possess generalized entropy. One of the main findings of this work is the "universality" of the Onsager exponent, $\alpha > 1/3$,…
In a recent paper, Enayat and Le lyk [2024] show that second order arithmetic and countable set theory are not definitionally equivalent. It is well known that these theories are biinterpretable. Thus, we have a pair of natural theories…
In \cite{BNT}, a framework to prove almost sure central limit theorems for sequences $(G_n)$ belonging to the Wiener space was developed, with a particular emphasis of the case where $G_n$ takes the form of a multiple Wiener-It\^o integral…
We study whether a logic based on team semantics can be enriched with a conditional satisfying minimal requirements--namely, preservation of the closure property of the logic, Modus Ponens, and the Deduction Theorem. We show that such…
The Legendre conjecture has resisted analysis over a century, even under assumption of the Riemann Hypothesis. We present, a significant improvement on previous results by greatly reducing the assumption to a more modest statement called…
This draft introduces the technical machinery of a semantic framework for potentialist truthmaking based on our innovation of intentic states, which are structured partial models accounting for our distinction between non-hypothetical and…
For a class $\Gamma$ of formulas, $\Gamma$ local reflection principle $\mathrm{Rfn}_{\Gamma}(T)$ for a theory $T$ of arithmetic is a scheme formalizing the $\Gamma$-soundness of $T$. Beklemishev proved that for every $\Gamma \in \{\Sigma_n,…
We study two modifications of the Post Correspondence Problem (PCP), namely 1) the bi-infinite version, where it is asked whether there exists a bi-infinite word such that two given morphisms agree on it, and 2) the conjugate version, where…
We show in Bishop's constructive mathematics---in particular, using countable choice---that weak K\"{o}nig's lemma implies the uniform continuity theorem.
We prove compactness of solutions of a fully nonlinear Yamabe problem satisfying a lower Ricci curvature bound, when the manifold is not conformally diffeomorphic to the standard sphere. This allows us to prove the existence of solutions…
We show that weak solutions of general conservation laws in bounded domains conserve their generalized entropy, and other respective companion laws, if they possess a certain fractional differentiability of order 1/3 in the interior of the…
We introduce the notion of limiting theories, giving examples and providing a sufficient condition under which the first order theory of a structure is the limit of the first order theories of a collection of substructures. We also give a…
The following refinement of the Higman embedding theorem is proved: A finitely generated group $R$ is recursively presented if and only if there exists a quasi-isometric malnormal embedding of $R$ into a finitely presented group $H$ such…
This paper deals with various cases of resonance, which is a fundamental concept of science and engineering. Specifically, we study the connections between periodic and unbounded solutions for several classes of equations and systems. In…
In 2007 it was conjectured that the Constraint Satisfaction Problem (CSP) over a constraint language $\Gamma$ is tractable if and only if $\Gamma$ is preserved by a weak near-unanimity (WNU) operation. After many efforts and partial…
There is an unproven duality theory hypothesizing that random discrete trees and their poissonized embeddings in continuous time share fundamental properties. We give additional evidence in favor of this theory by showing that several…
We study word structures of the form $(D,<,P)$ where $D$ is either $\mathbb{N}$ or $\mathbb{Z}$, $<$ is the natural linear ordering on $D$ and $P\subseteq D$ is a predicate on $D$. In particular we show: (a) The set of recursive…
For a sequence $S$ of terms from an abelian group $G$ of length $|S|$, let $\Sigma_n(S)$ denote the set of all elements that can be represented as the sum of terms in some $n$-term subsequence of $S$. When the subsum set is very small,…