Generalized interpolation theorems

1972 ◽  
Vol 37 (2) ◽  
pp. 343-351
Author(s):  
Stephen J. Garland
Keyword(s):  
Interpolation Theorem ◽  
Second Order ◽  
Cut Elimination ◽  
Real Numbers ◽  
Craig Interpolation ◽  
First Order ◽  
Order Variable ◽  
Analytic Sets ◽  
Image Position ◽  
Special Case

Chang [1], [2] has proved the following generalization of the Craig interpolation theorem [3]: For any first-order formulas φ and ψ with free first- and second-order variables among ν1, …, νn, R and ν1, …, νn, S respectively, and for any sequence Q1, …, Qn of quantifiers such that Q1 is universal whenever ν1 is a second-order variable, ifthen there is a first-order formula θ with free variables among ν1, …, νn such that(Note that the Craig interpolation theorem is the special case of Chang's theorem in which Q1, …, Qn are all universal quantifiers.) Chang also raised the question [2, Remark (k)] as to whether the Lopez-Escobar interpolation theorem [6] for the infinitary language Lω1ω possesses a similar generalization. In this paper, we show that the answer to Chang's question is affirmative and, moreover, that several interpolation theorems for applied second-order languages for number theory also possess such generalizations.Maehara and Takeuti [7] have established independently proof-theoretic interpolation theorems for first-order logic and Lω1ω which have as corollaries both Chang's theorem and its analog for Lω1ω. Our proofs are quite different from theirs and rely on model-theoretic techniques stemming from the analogy between the theory of definability in Lω1ω and the theory of Borel and analytic sets of real numbers, rather than the technique of cut-elimination.

Two interpolation theorems for a predicate calculus

1971 ◽  
Vol 36 (2) ◽  
pp. 262-270
Author(s):  
Shoji Maehara ◽  
Gaisi Takeuti
Keyword(s):  
Normal Form ◽  
Completeness Theorem ◽  
Interpolation Theorem ◽  
Second Order ◽  
Predicate Calculus ◽  
Cut Elimination ◽  
First Order ◽  
Image Position ◽  
Order Predicate Calculus

A second order formula is called Π1 if, in its prenex normal form, all second order quantifiers are universal. A sequent F1, … Fm → G1 …, Gn is called Π1 if a formulais Π1If we consider only Π1 sequents, then we can easily generalize the completeness theorem for the cut-free first order predicate calculus to a cut-free Π1 predicate calculus.In this paper, we shall prove two interpolation theorems on the Π1 sequent, and show that Chang's theorem in [2] is a corollary of our theorem. This further supports our belief that any form of the interpolation theorem is a corollary of a cut-elimination theorem. We shall also show how to generalize our results for an infinitary language. Our method is proof-theoretic and an extension of a method introduced in Maehara [5]. The latter has been used frequently to prove the several forms of the 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.

Uniqueness, definability and interpolation

1988 ◽  
Vol 53 (2) ◽  
pp. 554-570 ◽  
Author(s):  
Kosta Došen ◽  
Peter Schroeder-Heister
Keyword(s):  
Proof Theory ◽  
Interpolation Theorem ◽  
Order Logic ◽  
First Order Logic ◽  
General Notion ◽  
Structural Part ◽  
First Order ◽  
First Case ◽  
Additional Constant ◽  
Special Case

This paper is meant to be a comment on Beth's definability theorem. In it we shall make the following points.Implicit definability as mentioned in Beth's theorem for first-order logic is a special case of a more general notion of uniqueness. If α is a nonlogical constant, Tα a set of sentences, α* an additional constant of the same syntactical category as α and Tα, a copy of Tα with α* instead of α, then for implicit definability of α in Tα one has, in the case of predicate constants, to derive α(x1,…,xn) ↔ α*(x1,…,xn) from Tα ∪ Tα*, and similarly for constants of other syntactical categories. For uniqueness one considers sets of schemata Sα and derivability from instances of Sα ∪ Sα* in the language with both α and α*, thus allowing mixing of α and α* not only in logical axioms and rules, but also in nonlogical assumptions. In the first case, but not necessarily in the second one, explicit definability follows. It is crucial for Beth's theorem that mixing of α and α* is allowed only inside logic, not outside. This topic will be treated in §1.Let the structural part of logic be understood roughly in the sense of Gentzen-style proof theory, i.e. as comprising only those rules which do not specifically involve logical constants. If we restrict mixing of α and α* to the structural part of logic which we shall specify precisely, we obtain a different notion of implicit definability for which we can demonstrate a general definability theorem, where a is not confined to the syntactical categories of nonlogical expressions of first-order logic. This definability theorem is a consequence of an equally general interpolation theorem. This topic will be treated in §§2, 3, and 4.

On Hausdorff's proof of the extended Riesz-Fischer theorem

1925 ◽  
Vol 22 (5) ◽  
pp. 777-778
Author(s):  
S. Pollard
Keyword(s):  
Integral Equations ◽  
Orthogonal System ◽  
Real Numbers ◽  
Existence Of A Solution ◽  
System Of Integral Equations ◽  
System States ◽  
Image Position ◽  
Special Case

1. The extended Riesz-Fischer theorem, in the special case of the trigonometrical orthogonal system, states that, if a and β are real numbers such thatthenimplies, whenever α ≤ 2, the existence of a solution of the system of integral equations,such thatand furtherWhen a = 2, this reduces to the original Riesz-Fischer theorem.

Oscillations of Second Order Neutral Equations

1988 ◽  
Vol 40 (6) ◽  
pp. 1301-1314 ◽  
Author(s):  
G. Ladas ◽  
E. C. Partheniadis ◽  
Y. G. Sficas
Keyword(s):  
Second Order ◽  
List Type ◽  
Necessary And Sufficient Condition ◽  
Real Numbers ◽  
Neutral Equations ◽  
Deviating Arguments ◽  
Real Roots ◽  
All Solutions ◽  
Image Position ◽  
Necessary And Sufficient

Consider the second order neutral differential equation1where the coefficients p and q and the deviating arguments τ and σ are real numbers. The characteristic equation of Eq. (1) is2The main result in this paper is the following necessary and sufficient condition for all solutions of Eq. (1) to oscillate.THEOREM. The following statements are equivalent:(a) Every solution of Eq. (1) oscillates.(b) Equation (2) has no real roots.

scholarly journals Oscillation of differential equations with non-monotone retarded arguments

2016 ◽  
Vol 19 (1) ◽  
pp. 98-104 ◽  
Author(s):  
George E. Chatzarakis ◽  
Özkan Öcalan
Keyword(s):  
Differential Equation ◽  
Differential Equations ◽  
Oscillation Criterion ◽  
Retarded Argument ◽  
Real Numbers ◽  
Positive Real ◽  
First Order ◽  
Retarded Differential Equation ◽  
Oscillation Condition ◽  
Image Position

Consider the first-order retarded differential equation $$\begin{eqnarray}x^{\prime }(t)+p(t)x({\it\tau}(t))=0,\quad t\geqslant t_{0},\end{eqnarray}$$ where $p(t)\geqslant 0$ and ${\it\tau}(t)$ is a function of positive real numbers such that ${\it\tau}(t)\leqslant t$ for $t\geqslant t_{0}$, and $\lim _{t\rightarrow \infty }{\it\tau}(t)=\infty$. Under the assumption that the retarded argument is non-monotone, a new oscillation criterion, involving $\liminf$, is established when the well-known oscillation condition $$\begin{eqnarray}\liminf _{t\rightarrow \infty }\int _{{\it\tau}(t)}^{t}p(s)\,ds>\frac{1}{e}\end{eqnarray}$$ is not satisfied. An example illustrating the result is also given.

A theorem on deducibility for second-order functions

1939 ◽  
Vol 4 (2) ◽  
pp. 77-79 ◽  
Author(s):  
C. H. Langford
Keyword(s):  
Second Order ◽  
Order Function ◽  
Usual Definition ◽  
First Order ◽  
Free Variables ◽  
Usual Convention ◽  
Definition Of ◽  
Image Position

It is known that the usual definition of a dense series without extreme elements is complete with respect to first-order functions, in the sense that any first-order function on the base of a set of postulates defining such a series either is implied by the postulates or is inconsistent with them. It is here understood, in accordance with the usual convention, that when we speak of a function on the base , the function shall be such as to place restrictions only upon elements belonging to the class determined by f; or, more exactly, every variable with a universal prefix shall occur under the hypothesis that its values satisfy f, while every variable with an existential prefix shall have this condition categorically imposed upon it.Consider a set of postulates defining a dense series without extreme elements, and add to this set the condition of Dedekind section, to be formulated as follows. Let the conjunction of the three functions,be written H(ϕ), where the free variables f and g, being parameters throughout, are suppressed. This is the hypothesis of Dedekind's condition, and the conclusion iswhich may be written C(ϕ).

scholarly journals On the metric theory of the optimal continued fraction expansion

1997 ◽  
Vol 56 (1) ◽  
pp. 69-79
Author(s):  
R. Nair
Keyword(s):  
Lebesgue Measure ◽  
Continued Fraction ◽  
Natural Numbers ◽  
Real Numbers ◽  
Continued Fraction Expansion ◽  
Image Position ◽  
Special Case

Suppose kn denotes either φ(n) or φ(rn) (n = 1, 2, …) where the polynomial φ maps the natural numbers to themselves and rk denotes the kth rational prime. Let denote the sequence of convergents to a real numbers x for the optimal continued fraction expansion. Define the sequence of approximation constants byIn this paper we study the behaviour of the sequence for all most all x with respect to Lebesgue measure. In the special case where kn = n (n = 1, 2, …) these results are due to Bosma and Kraaikamp.

On Schrödinger's factorization method for Sturm-Liouville operators

1978 ◽  
Vol 80 (1-2) ◽  
pp. 67-84 ◽  
Author(s):  
U.-W. Schmincke
Keyword(s):  
Discrete Spectrum ◽  
Liouville Operator ◽  
Differential Operators ◽  
Factorization Method ◽  
Friedrichs Extension ◽  
First Order ◽  
Sturm Liouville ◽  
Image Position ◽  
Special Case ◽  
Liouville Operators

SynopsisWe consider the Friedrichs extension A of a minimal Sturm-Liouville operator L0 and show that A admits a Schrödinger factorization, i.e. that one can find first order differential operators Bk with where the μk are suitable numbers which optimally chosen are just the lower eigenvalues of A (if any exist). With the help of this theorem we derive for the special case L0u = −u″ + q(x)u with q(x) → 0 (|x| → ∞) the inequalityσd(A) being the discrete spectrum of A. This inequality is seen to be sharp to some extent.

A probabilistic interpolation theorem

1985 ◽  
Vol 50 (3) ◽  
pp. 708-713 ◽  
Author(s):  
Douglas N. Hoover
Keyword(s):  
Interpolation Theorem ◽  
Order Logic ◽  
First Order Logic ◽  
Probability Logic ◽  
Admissible Set ◽  
First Order ◽  
Probability Spaces ◽  
Image Position ◽  
Dedekind Cuts ◽  
Exact Definition

The probability logic is a logic with a natural interpretation on probability spaces (thus, a logic whose model theory is part of probability theory rather than a system for putting probabilities on formulas of first order logic). Its exact definition and basic development are contained in the paper [3] of H. J. Keisler and the papers [1] and [2] of the author. Building on work in [2], we prove in this paper the following probabilistic interpolation theorem for .Let L be a countable relational language, and let A be a countable admissible set with ω ∈ A (in this paper some probabilistic notation will be used, but ω will always mean the least infinite ordinal). is the admissible fragment of corresponding to A. We will assume that L is a countable set in A, as is usual in practice, though all that is in fact needed for our proof is that L be a set in A which is wellordered in A.Theorem. Let ϕ(x) and ψ(x) be formulas of LAP such thatwhere ε ∈ [0, 1) is a real in A (reals may be defined in the usual way as Dedekind cuts in the rationals). Then for any real d > ε¼, there is a formula θ(x) of (L(ϕ) ∩ L(ψ))AP such thatand

Sign in / Sign up

Export Citation Format

Share Document