English
Related papers

Related papers: The interpolant existence problem for weak K4 and …

200 papers

Let L be a linear difference operator with polynomial coefficients. We consider singularities of L that correspond to roots of the trailing (resp. leading) coefficient of L. We prove that one can effectively construct a left multiple with…

Classical Analysis and ODEs · Mathematics 2007-05-23 S. A. Abramov , M. A. Barkatou , M. van Hoeij

We show an existence of a weak solution of a degenerate and/or singular semilinear elliptic boundary value (nonhomogeneous) problem lying between a given weak subsolution and a given weak supersolution. It has been applied for an existence…

Analysis of PDEs · Mathematics 2021-12-14 Raj Narayan Dhara

It has been argued in arXiv:1112.6432 that the planar four-point integrand in N=4 super Yang-Mills theory is uniquely determined by dual conformal invariance together with the absence of a double pole in the integrand of the logarithm in…

High Energy Physics - Theory · Physics 2015-06-04 John Golden , Marcus Spradlin

A modular proof-theoretic framework was recently developed to prove Craig interpolation for normal modal logics based on generalizations of sequent calculi (e.g., nested sequents, hypersequents, and labelled sequents). In this paper, we…

Logic in Computer Science · Computer Science 2021-10-12 Iris van der Giessen , Raheleh Jalali , Roman Kuznets

We consider a higher-order evolution equation with an inhomogeneous term depending on time and space. We first derive a general criterion for the nonexistence of weak solutions. Next, we study the particular case when the inhomogeneity…

Analysis of PDEs · Mathematics 2019-10-07 Mohamed Jleli , Ning-An Lai , Bessem Samet

All versions of this paper contain errors. Therefore, the existence of an oracle relative to which (i) there exist complete disjoint coNP-pairs and (ii) there exist no complete total polynomial search problems must be considered as an open…

Computational Complexity · Computer Science 2019-11-21 Titus Dose

A regular realizability (RR) problem is testing nonemptiness of intersection of some fixed language (filter) with given regular language. We study here complexity of RR problems. It appears that for any language L there exists RR problem…

Computational Complexity · Computer Science 2013-01-01 Mikhail N. Vyalyi

Defeasible logic is a rule-based nonmonotonic logic, with both strict and defeasible rules, and a priority relation on rules. We show that inference in the propositional form of the logic can be performed in linear time. This contrasts…

Artificial Intelligence · Computer Science 2009-09-29 Michael J. Maher

We introduce BPDL, a combination of propositional dynamic logic PDL with the basic four-valued modal logic BK studied by Odintsov and Wansing (`Modal logics with Belnapian truth values', J. Appl. Non-Class. Log. 20, 279--301 (2010)). We…

Logic in Computer Science · Computer Science 2016-08-23 Igor Sedlár

For an arbitrary undirected simple graph G with m edges, we give an algorithm with running time O(m^4 |L|^2) to generate the set L of all minimal edge dominating sets of G. For bipartite graphs we obtain a better result; we show that their…

Data Structures and Algorithms · Computer Science 2012-10-24 Petr A. Golovach , Pinar Heggernes , Dieter Kratsch , Yngve Villanger

The present article investigates the existence, multiplicity and regularity of weak solutions of problems involving a combination of critical Hartree type nonlinearity along with singular and discontinuous nonlinearity. By applying…

Analysis of PDEs · Mathematics 2023-09-15 Gurdev C. Anthal , Jacques Giacomoni , Konijeti Sreenadh

We analyze the complexity of decision problems for Boolean Nonassociative Lambek Calculus admitting empty antecedent of sequents ($\mathsf{BFNL^*}$), and the consequence relation of Distributive Full Nonassociative Lambek Calculus…

Logic in Computer Science · Computer Science 2014-03-14 Zhe Lin , Minghui Ma

In this chapter we give a basic overview of known results regarding Craig interpolation for first-order logic as well as for fragments of first-order logic. Our aim is to provide an entry point into the literature on interpolation theorems…

Logic in Computer Science · Computer Science 2025-10-07 Balder ten Cate , Jesse Comer

By using a selective filtration argument, we prove that the satisfiability problem of the unimodal logic of density is in $EXPTIME$. By using a tableau-like approach, we prove that the satisfiability problem of the bimodal logic of weak…

Logic in Computer Science · Computer Science 2025-07-16 Philippe Balbiani , Olivier Gasquet

The non-classical, nonmonotonic inference relation associated with the answer set semantics for logic programs gives rise to a relationship of 'strong equivalence' between logical programs that can be verified in 3-valued Goedel logic, G3,…

Logic in Computer Science · Computer Science 2007-05-23 Dick de Jongh , Lex Hendriks

In this paper we study existence and spectral properties for weak solutions of Neumann and Dirichlet problems associated to second order linear degenerate elliptic partial differential operators $X$, with rough coefficients of the form…

Analysis of PDEs · Mathematics 2014-01-17 Dario D. Monticelli , Scott Rodney

Existence and non-existence results are established for quasilinear elliptic problems with nonlinear boundary conditions and lack of compactness. The proofs combine variational methods with the geometrical feature, due to the competition…

Analysis of PDEs · Mathematics 2007-06-19 Roberta Filippucci , Patrizia Pucci , Vicentiu Radulescu

This article is devoted to questions concerning the existence of solutions for partial differential equation problems modeling granular flows. The models studied take into account the complex threshold rheology of these flows, as well as…

Analysis of PDEs · Mathematics 2025-05-26 Laurent Chupin , Thierry Dubois

Conditions for the existence and uniqueness of weak solutions for a class of nonlinear nonlocal degenerate parabolic equations are established. The asymptotic behaviour of the solutions as time tends to infinity are also studied. In…

Analysis of PDEs · Mathematics 2014-07-28 Rui M. P. Almeida , Stanislav N. Antontsev , José C. M. Duque

We show that linear analytic cocycles where all Lyapunov exponents are negative infinite are nilpotent. For such one-frequency cocycles we show that they can be analytically conjugated to an upper triangular cocycle or a Jordan normal form.…

Dynamical Systems · Mathematics 2018-03-14 Christian Sadel , Disheng Xu