Related papers: Implicit Resolution
We show that when certain statements are provable in subsystems of constructive analysis using intuitionistic predicate calculus, related sequential statements are provable in weak classical subsystems. In particular, if a $\Pi^1_2$…
During the last two decades, great efforts have been devoted to the calculation of the local theta correspondence for reductive dual pairs. However, uniform formulas remain elusive for real dual pairs of type I. The purpose of this paper is…
We present IBR, an Iterative Backward Reasoning model to solve the proof generation tasks on rule-based Question Answering (QA), where models are required to reason over a series of textual rules and facts to find out the related proof path…
In arXiv:1710.08163 a generalization of Boolean circuits to arbitrary finite algebras had been introduced and applied to sketch P versus NP-complete borderline for circuits satisfiability over algebras from congruence modular varieties.…
An inductive proof can be represented as a proof schema, i.e. as a parameterized sequence of proofs defined in a primitive recursive way. A corresponding cut-elimination method, called schematic CERES, can be used to analyze these proofs,…
We consider the Dirichlet problem for the nonhomogeneous equation $-\Delta_p u -\Delta_q u = \alpha |u|^{p-2}u + \beta |u|^{q-2}u + f(x)$ in a bounded domain, where $p \neq q$, and $\alpha, \beta \in \mathbb{R}$ are parameters. We explore…
First-order fully implicit as well as implicit--explicit schemes for coupled elliptic-parabolic systems are discussed in [Ern and Meunier, ESAIM: M2AN, 2009] and [Altmann et al., Math.\ Comp., 2021], respectively. The extension of the…
For every finitary set functor F we demonstrate that free algebras carry a canonical partial order. In case F is bicontinuous, we prove that the cpo obtained as the conservative completion of the free algebra is the free completely…
Let $X$ be a non-singular irreducible complex projective curve of genus $g\geq 2$. We use $(t,\ell)$-stability to prove the existence of coherent systems over $X$ that are $\alpha$-stable for all allowed $\alpha >0$.
We prove an algebraic extension theorem for the computably enumerable sets, $\mathcal{E}$. Using this extension theorem and other work we then show if $A$ and $\hat{A}$ are automorphic via $\Psi$ then they are automorphic via $\Lambda$…
Does every Boolean tautology have a short propositional-calculus proof? Here, a propositional calculus (i.e. Frege) proof is a proof starting from a set of axioms and deriving new Boolean formulas using a set of fixed sound derivation…
The beta transformation is the iterated map $\beta x\,\mod1$; it generates the base-$\beta$ expansion of a real number x. Every iterated piece-wise monotonic map is topologically conjugate to the beta transformation. For all but a countable…
We investigate the problem $$-\Delta u = \lambda b(x)|u|^{q-2}u +a(x)|u|^{p-2}u \mbox{ in } \Omega, \quad \frac{\partial u}{\partial \mathbf{n}} = 0 \mbox{ on } \partial \Omega, \leqno{(P_\lambda)} $$ where $\Omega$ is a bounded smooth…
We consider extensions of the language of Peano arithmetic by transfinitely iterated truth definitions satisfying uniform Tarskian biconditionals. Without further axioms, such theories are known to be conservative extensions of the original…
The Weighted Path Order of Yamada is a powerful technique for proving termination. It is also supported by CeTA, a certifier for checking untrusted termination proofs. To be more precise, CeTA contains a verified function that computes for…
Given a sound first-order p-time theory $T$ capable of formalizing syntax of first-order logic we define a p-time function $g_T$ that stretches all inputs by one bit and we use its properties to show that $T$ must be incomplete. We leave it…
We prove that there are infinitely many integers, which can represent as sum of a square-free integer and a prime $p$ with $||\alpha p+\beta||<p^{-1/10}$, where $\alpha$ is irrational.
A sharp explicit estimate is proved for the difference $e^\beta-\alpha$ when $\alpha$ and $\beta$ are nonzero algebraic numbers.
This paper presents a type theory with a form of equality reflection: provable equalities can be used to coerce the type of a term. Coercions and other annotations, including implicit arguments, are dropped during reduction of terms. We…
In this paper, we consider the elliptic system \begin{equation*} \left\{\begin{array}{ll} -\Delta u=g(x,v)\,\, \textnormal{in}\Omega, & \hbox{} -\Delta v=f(x,u)\,\,\textnormal{in}\Omega, & \hbox{} u=v=0\textnormal{on}\partial\Omega, &…