Related papers: On Interpolation and Symbol Elimination in Theory …
Uniform interpolation is a strengthening of interpolation that holds for certain propositional logics. The starting point of this chapter is a theorem of A. Pitts, which shows that uniform interpolation holds for intuitionistic…
We use our extension of the symbolic method in enumerative combinatorics (we extend finite sums defining coefficients in generating functions to infinite series) to generalize P\'olya's theorem. This theorem determines limits of…
We provide a complete axiomatization of modal inclusion logic - team-based modal logic extended with inclusion atoms. We review and refine an expressive completeness and normal form theorem for the logic, define a natural deduction proof…
Many decision procedures for SMT problems rely more or less implicitly on an instantiation of the axioms of the theories under consideration, and differ by making use of the additional properties of each theory, in order to increase…
We extend the shell and kernel reductions for hyperexponential functions over the field of rational functions to a monomial extension. Both of the reductions are incorporated into one algorithm. As an application, we present an additive…
Classical approximation and learning methods are typically optimized for interpolation over a sampled domain {\Omega}, with no guarantees on their behavior in an extrapolation region {\Xi}, where small in-domain errors may amplify. We…
The terms 'semantics' and 'ontology' are increasingly appearing together with 'explanation', not only in the scientific literature, but also in organizational communication. However, all of these terms are also being significantly…
In this work, the one-dimensional Cellular Automaton is extended to one that involves two sets of symbols and two global rules. As a main result, the Extended Curtis-Hedlund-Lyndon Theorem is demonstrated. Such constructions can be useful…
The Empirical Interpolation Method (EIM) is a greedy procedure that constructs approximate representations of two-variable functions in separated form. In its classical presentation, the two variables play a non-symmetric role. In this…
Description logics (DLs) are standard knowledge representation languages for modelling ontologies, i.e. knowledge about concepts and the relations between them. Unfortunately, DL ontologies are difficult to learn from data and…
In this paper we show that subsumption problems in lightweight description logics (such as $\mathcal{EL}$ and $\mathcal{EL}^+$) can be expressed as uniform word problems in classes of semilattices with monotone operators. We use…
We derive and discuss a technique for manipulating power series which is complementary to standard procedures. We begin with the translation operator, but we express the operator as an infinite product instead of expanding it as a series…
When faced with the question of how to represent properties in a formal proof system any user has to make design decisions. We have proved three of the theorems from Maskin's 2004 survey article on Auction Theory using the Isabelle/HOL…
Our starting point is a lemma due to Varopoulos. We give a different proof of a generalized form this lemma, that yields an equivalent description of the $K$-functional for the interpolation couple $(X_0,X_1)$ where…
This paper develops a general methodology to connect propositional and first-order interpolation. In fact, the existence of suitable skolemizations and of Herbrand expansions together with a propositional interpolant suffice to construct a…
Expansion is an operation on typings (i.e., pairs of typing environments and result types) defined originally in type systems for the lambda-calculus with intersection types in order to obtain principal (i.e., most informative, strongest)…
In this article, we introduce the concepts of excision and idealization for a multiplicative Lie algebra (also for a Lie algebra), which provides two new multiplicative Lie algebras (or Lie algebras) from a given multiplicative Lie algebra…
Let T be an algebraically bounded theory. We consider the $L(\bar\delta)$-expansions of T by a tuple $\bar \delta$ of derivations (which may be commuting or not). We investigate the model completion of either of the above theories, whose…
When approximating a function that depends on a parameter, one encounters many practical examples where linear interpolation or linear approximation with respect to the parameters prove ineffective. This is particularly true for responses…
We prove the version of interpolation theorem for non-commutative vector-valued fully symmetric spaces associated with fully symmetric Banach function spaces and a von Neumann algebra equipped with a faithful semifinite normal trace.