A new interpolation theorem

1982 ◽  
pp. 189-198 ◽  
Author(s):  
Y. Sagher
Keyword(s):  
Interpolation Theorem

Interpolation in Conditional Equational Logic1

1991 ◽  
Vol 15 (1) ◽  
pp. 80-85
Author(s):  
P.H. Rodenburg
Keyword(s):  
Interpolation Theorem ◽  
Equational Logic ◽  
Craig’S Interpolation Theorem ◽  
Natural Formulation

In a natural formulation, Craig’s interpolation theorem is shown to hold for conditional equational logic.

scholarly journals INFINITARY PROPOSITIONAL RELEVANT LANGUAGES WITH ABSURDITY

2017 ◽  
Vol 10 (4) ◽  
pp. 663-681
Author(s):  
GUILLERMO BADIA
Keyword(s):  
Expressive Power ◽  
Interpolation Theorem ◽  
Boolean Logic ◽  
Isomorphism Theorem ◽  
Strong Completeness ◽  
Lack Of Compactness ◽  
Relevant Logics ◽  
Beth Definability ◽  
Beth Definability Property

AbstractAnalogues of Scott’s isomorphism theorem, Karp’s theorem as well as results on lack of compactness and strong completeness are established for infinitary propositional relevant logics. An “interpolation theorem” (of a particular sort introduced by Barwise and van Benthem) for the infinitary quantificational boolean logic L∞ω holds. This yields a preservation result characterizing the expressive power of infinitary relevant languages with absurdity using the model-theoretic relation of relevant directed bisimulation as well as a Beth definability property.

A normal form theorem for Lω1p, with applications

1982 ◽  
Vol 47 (3) ◽  
pp. 605-624 ◽  
Author(s):  
Douglas N. Hoover
Keyword(s):  
Normal Form ◽  
Probability Model ◽  
Random Variables ◽  
Interpolation Theorem ◽  
Complete Theory ◽  
De Finetti’S Theorem ◽  
Form Theorem ◽  
Normal Form Theorem ◽  
De Finetti's Theorem

AbstractWe show that every formula of Lω1P is equivalent to one which is a propositional combination of formulas with only one quantifier. It follows that the complete theory of a probability model is determined by the distribution of a family of random variables induced by the model. We characterize the class of distribution which can arise in such a way. We use these results together with a form of de Finetti’s theorem to prove an almost sure interpolation theorem for Lω1P.

scholarly journals Randomized feasible interpolation and monotone circuits with a local oracle

2018 ◽  
Vol 18 (02) ◽  
pp. 1850012 ◽  
Author(s):  
Jan Krajíček
Keyword(s):  
Lower Bounds ◽  
Cutting Planes ◽  
Communication Complexity ◽  
Interpolation Theorem ◽  
Proof System ◽  
Symbolic Logic ◽  
Approximate Counting ◽  
Small Width ◽  
Randomized Protocols ◽  
Monotone Circuits

The feasible interpolation theorem for semantic derivations from [J. Krajíček, Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic, J. Symbolic Logic 62(2) (1997) 457–486] allows to derive from some short semantic derivations (e.g. in resolution) of the disjointness of two [Formula: see text] sets [Formula: see text] and [Formula: see text] a small communication protocol (a general dag-like protocol in the sense of Krajíček (1997) computing the Karchmer–Wigderson multi-function [Formula: see text] associated with the sets, and such a protocol further yields a small circuit separating [Formula: see text] from [Formula: see text]. When [Formula: see text] is closed upwards, the protocol computes the monotone Karchmer–Wigderson multi-function [Formula: see text] and the resulting circuit is monotone. Krajíček [Interpolation by a game, Math. Logic Quart. 44(4) (1998) 450–458] extended the feasible interpolation theorem to a larger class of semantic derivations using the notion of a real communication complexity (e.g. to the cutting planes proof system CP). In this paper, we generalize the method to a still larger class of semantic derivations by allowing randomized protocols. We also introduce an extension of the monotone circuit model, monotone circuits with a local oracle (CLOs), that does correspond to communication protocols for [Formula: see text] making errors. The new randomized feasible interpolation thus shows that a short semantic derivation (from a certain class of derivations larger than in the original method) of the disjointness of [Formula: see text], [Formula: see text] closed upwards, yields a small randomized protocol for [Formula: see text] and hence a small monotone CLO separating the two sets. This research is motivated by the open problem to establish a lower bound for proof system [Formula: see text] operating with clauses formed by linear Boolean functions over [Formula: see text]. The new randomized feasible interpolation applies to this proof system and also to (the semantic versions of) cutting planes CP, to small width resolution over CP of Krajíček [Discretely ordered modules as a first-order extension of the cutting planes proof system, J. Symbolic Logic 63(4) (1998) 1582–1596] (system R(CP)) and to random resolution RR of Buss, Kolodziejczyk and Thapen [Fragments of approximate counting, J. Symbolic Logic 79(2) (2014) 496–525]. The method does not yield yet lengths-of-proofs lower bounds; for this it is necessary to establish lower bounds for randomized protocols or for monotone CLOs.

scholarly journals AN INTERPOLATION THEOREM RELATED TO THE HARDY SPACE WITH NON-DOUBLING MEASURE

2009 ◽  
Vol 13 (5) ◽  
pp. 1609-1622 ◽  
Author(s):  
Guoen Hu ◽  
Jiali Lian ◽  
Huoxiong Wu
Keyword(s):  
Hardy Space ◽  
Interpolation Theorem ◽  
Doubling Measure

scholarly journals An elementary interpolation theorem

1965 ◽  
Vol 16 (3) ◽  
pp. 523-523 ◽  
Author(s):  
David G. Cantor ◽  
R. R. Phelps
Keyword(s):  
Interpolation Theorem

scholarly journals On an interpretation of second order quantification in first order intuitionistic propositional logic

1992 ◽  
Vol 57 (1) ◽  
pp. 33-52 ◽  
Author(s):  
Andrew M. Pitts
Keyword(s):  
Propositional Logic ◽  
Heyting Algebra ◽  
Propositional Calculus ◽  
Interpolation Theorem ◽  
Second Order ◽  
Heyting Algebras ◽  
Intuitionistic Propositional Logic ◽  
First Order ◽  
Intuitionistic Propositional Calculus ◽  
Algebraic Counterpart

AbstractWe prove the following surprising property of Heyting's intuitionistic propositional calculus, IpC. Consider the collection of formulas, ϕ, built up from propositional variables (p, q, r, …) and falsity (⊥) using conjunction (∧), disjunction (∨) and implication (→). Write ⊢ϕ to indicate that such a formula is intuitionistically valid. We show that for each variable p and formula ϕ there exists a formula Apϕ (effectively computable from ϕ), containing only variables not equal to p which occur in ϕ, and such that for all formulas ψ not involving p, ⊢ψ → Apϕ if and only if ⊢ψ → ϕ. Consequently quantification over propositional variables can be modelled in IpC, and there is an interpretation of the second order propositional calculus, IpC2, in IpC which restricts to the identity on first order propositions.An immediate corollary is the strengthening of the usual interpolation theorem for IpC to the statement that there are least and greatest interpolant formulas for any given pair of formulas. The result also has a number of interesting consequences for the algebraic counterpart of IpC, the theory of Heyting algebras. In particular we show that a model of IpC2 can be constructed whose algebra of truth-values is equal to any given Heyting algebra.

KORÁNYI’S LEMMA FOR HOMOGENEOUS SIEGEL DOMAINS OF TYPE II. APPLICATIONS AND EXTENDED RESULTS

2014 ◽  
Vol 90 (1) ◽  
pp. 77-89 ◽  
Author(s):  
DAVID BÉKOLLÉ ◽  
HIDEYUKI ISHI ◽  
CYRILLE NANA
Keyword(s):  
Functional Analysis ◽  
Bergman Kernel ◽  
Atomic Decomposition ◽  
Bergman Spaces ◽  
Decomposition Theorem ◽  
Interpolation Theorem ◽  
Type Ii ◽  
Siegel Domain ◽  
Homogeneous Case ◽  
Siegel Domains

AbstractWe show that the modulus of the Bergman kernel $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}B(z, \zeta )$ of a general homogeneous Siegel domain of type II is ‘almost constant’ uniformly with respect to $z$ when $\zeta $ varies inside a Bergman ball. The control is expressed in terms of the Bergman distance. This result was proved by A. Korányi for symmetric Siegel domains of type II. Subsequently, R. R. Coifman and R. Rochberg used it to establish an atomic decomposition theorem and an interpolation theorem by functions in Bergman spaces $A^p$ on these domains. The atomic decomposition theorem and the interpolation theorem are extended here to the general homogeneous case using the same tools. We further extend the range of exponents $p$ via functional analysis using recent estimates.

Sign in / Sign up

Export Citation Format

Share Document