English
Related papers

Related papers: Effective Disjunction and Effective Interpolation …

200 papers

A fast consistency prover is a consistent poly-time axiomatized theory that has short proofs of the finite consistency statements of any other poly-time axiomatized theory. Kraj\'\i\v{c}ek and Pudl\'ak proved that the existence of an…

Logic · Mathematics 2020-04-14 Joost J. Joosten

This paper develops and analyzes a fully discrete finite element method for a class of semilinear stochastic partial differential equations (SPDEs) with multiplicative noise. The nonlinearity in the diffusion term of the SPDEs is assumed to…

Numerical Analysis · Mathematics 2018-11-22 Xiaobing Feng , Yukun Li , Yi Zhang

It is shown that a separated sequence of points in the unit disc of the complex plane is in fact uniformly separated, if there exists a certain intermediate sequence whose separated subsequences are uniformly separated. This property is…

Classical Analysis and ODEs · Mathematics 2018-10-01 Janne Gröhn , Artur Nicolau

The energy stable flux reconstruction (ESFR) method provides an efficient and flexible framework to devise high-order linearly stable numerical schemes which can achieve high levels of accuracy on unstructured grids. While superconvergent…

Numerical Analysis · Mathematics 2025-10-29 Mathias Dufresne-Piché , Siva Nadarajah

We establish the existence theory of several commonly used finite element (FE) nonlinear fully discrete solutions, and the convergence theory of a linearized iteration. First, it is shown for standard FE, SUPG and edge-averaged method…

Numerical Analysis · Mathematics 2023-12-04 Yang Liu , Shi Shu , Ying Yang

We study interpolant extraction from local first-order refutations. We present a new theoretical perspective on interpolation based on clearly separating the condition on logical strength of the formula from the requirement on the com- mon…

Logic in Computer Science · Computer Science 2017-11-08 Bernhard Gleiss , Laura Kovacs , Martin Suda

Proof-theoretic methods are developed for subsystems of Johansson's logic obtained by extending the positive fragment of intuitionistic logic with weak negations. These methods are exploited to establish properties of the logical systems.…

Logic · Mathematics 2019-07-12 Marta Bílková , Almudena Colacito

We prove the uniform Lyndon interpolation property (ULIP) of some extensions of the pure logic of necessitation $\mathbf{N}$. For any $m, n \in \mathbb{N}$, $\mathbf{N}^+\mathbf{A}_{m,n}$ is the logic obtained from $\mathbf{N}$ by adding a…

Logic · Mathematics 2025-08-19 Yuta Sato

We try to bring to light some combinatorial structure underlying formal proofs in logic. We do this through the study of the Craig Interpolation Theorem which is properly a statement about the structure of formal derivations. We show that…

Logic · Mathematics 2016-09-06 Alessandra Carbone

We study the effective front associated with first-order front propagations in two dimensions ($n=2$) in the periodic setting with continuous coefficients. Our main result says that that the boundary of the effective front is differentiable…

Analysis of PDEs · Mathematics 2022-06-09 Hung V. Tran , Yifeng Yu

We reconsider the ordinary impurity effect on the transition temperature $T_{c}$ of superconductors using the Eliashberg formalism. It is shown that the correspondence principle, which relates strong-coupling and weak-coupling theories,…

Superconductivity · Physics 2007-05-23 Yong-Jihn Kim

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…

Computational Complexity · Computer Science 2015-09-14 Fu Li , Iddo Tzameret , Zhengyu Wang

The use of interpolants in verification is gaining more and more importance. Since theories used in applications are usually obtained as (disjoint) combinations of simpler theories, it is important to modularly re-use interpolation…

Logic in Computer Science · Computer Science 2012-04-25 Roberto Bruttomesso , Silvio Ghilardi , Silvio Ranise

We prove that any Iterated Function System of circle homeomorphisms with at least one of them having dense orbit, is asymptotically stable. The corresponding Perron-Frobenius operator is shown to satisfy the e-property, that is, for any…

Probability · Mathematics 2017-02-20 Tomasz Szarek , Anna Zdunik

Two sets of nonnegative integers $A=\{a_1<a_2<\cdots\}$ and $B=\{b_1<b_2<\cdots\}$ are defined as \emph{disjoint}, if $\{A-A\}\bigcap\{B-B\}=\{0\}$, namely, the equation $a_i+b_t=a_j+b_k$ has only trivial solution. In 1984, Erd\H os and…

Number Theory · Mathematics 2022-08-25 Jin-Hui Fang , Csaba Sándor

Joint extraction of entities and relations aims to detect entity pairs along with their relations using a single model. Prior work typically solves this task in the extract-then-classify or unified labeling manner. However, these methods…

Computation and Language · Computer Science 2020-02-20 Bowen Yu , Zhenyu Zhang , Xiaobo Shu , Yubin Wang , Tingwen Liu , Bin Wang , Sujian Li

In [18] Fournier and Printems establish a methodology which allows to prove the absolute continuity of the law of the solution of some stochastic equations with H\"{o}lder continuous coefficients. This is of course out of reach by using…

Probability · Mathematics 2017-04-03 V. Bally , L. Caramellino

The screened Coulomb interaction between uniformly charged flat plates is considered at very small plate separations for which the Debye layers are strongly overlapped, in the limit of small electrical potentials. If the plates are of…

Soft Condensed Matter · Physics 2017-02-06 Sandip Ghosal , John D. Sherwood

The exponentially repulsive EXP pair potential defines a system of particles in terms of which simple liquids' quasiuniversality may be explained [A. K. Bacher et al., Nat. Commun. 5, 5424 (2014); J. C. Dyre, J. Phys. Condens. Matter 28,…

Soft Condensed Matter · Physics 2018-09-20 Andreas Kvist Bacher , Thomas B. Schrøder , Jeppe C. Dyre

Inspired by the classic problem of Boolean function monotonicity testing, we investigate the testability of other well-studied properties of combinatorial finite set systems, specifically \emph{intersecting} families and \emph{union-closed}…

Computational Complexity · Computer Science 2023-11-21 Xi Chen , Anindya De , Yuhao Li , Shivam Nadimpalli , Rocco A. Servedio