On the existence of a saturated solution of the differential equation x′ = f (t, x)

1977 ◽  
Vol 78 (1-2) ◽  
pp. 97-99
Author(s):  
Johann Walter
Keyword(s):  
Differential Equation ◽  
Set Theory ◽  
Saturated Solution ◽  
Open Domain ◽  
Recursive Definition ◽  
Power Set ◽  
Image Position

SynopsisLet (1) x′ = f(t, x) be any differential equation and S0 the set of solutions of (1) with open domain. It is known that for every g ∊ S0 a non-continuable (= saturated) ∊ S0 exists which is an extension of g. Usually is represented in the form is a sequence in S0 defined by some sort of a variant of what is called ‘recursive definition’ in set theory. It will be shown that a functionexists (P(S0) is the power set of S0) such that the above-mentioned variant can be given the form: There exists a sequence in S0 such that

Frege's theorem in a constructive setting

1999 ◽  
Vol 64 (2) ◽  
pp. 486-488 ◽  
Author(s):  
John L. Bell
Keyword(s):  
Set Theory ◽  
Natural Numbers ◽  
The Family ◽  
Power Set ◽  
Law Of Excluded Middle ◽  
The Law ◽  
Image Position ◽  
Excluded Middle ◽  
Intuitionistic Set Theory

By Frege's Theorem is meant the result, implicit in Frege's Grundlagen, that, for any set E, if there exists a map υ from the power set of E to E satisfying the conditionthen E has a subset which is the domain of a model of Peano's axioms for the natural numbers. (This result is proved explicitly, using classical reasoning, in Section 3 of [1].) My purpose in this note is to strengthen this result in two directions: first, the premise will be weakened so as to require only that the map υ be defined on the family of (Kuratowski) finite subsets of the set E, and secondly, the argument will be constructive, i.e., will involve no use of the law of excluded middle. To be precise, we will prove, in constructive (or intuitionistic) set theory, the followingTheorem. Let υ be a map with domain a family of subsets of a set E to E satisfying the following conditions:(i) ø ϵdom(υ)(ii)∀U ϵdom(υ)∀x ϵ E − UU ∪ x ϵdom(υ)(iii)∀UV ϵdom(5) υ(U) = υ(V) ⇔ U ≈ V.Then we can define a subset N of E which is the domain of a model of Peano's axioms.

The Empty Set, The Singleton, and the Ordered Pair

2003 ◽  
Vol 9 (3) ◽  
pp. 273-298 ◽  
Author(s):  
Akihiro Kanamori
Keyword(s):  
Mathematical Logic ◽  
19Th Century ◽  
Set Theory ◽  
Formal Semantics ◽  
Recursive Definition ◽  
Iterative Conception ◽  
Power Set ◽  
Definition Of ◽  
Ernst Zermelo ◽  
Considerable Concern

For the modern set theorist the empty set Ø, the singleton {a}, and the ordered pair 〈x, y〉 are at the beginning of the systematic, axiomatic development of set theory, both as a field of mathematics and as a unifying framework for ongoing mathematics. These notions are the simplest building locks in the abstract, generative conception of sets advanced by the initial axiomatization of Ernst Zermelo [1908a] and are quickly assimilated long before the complexities of Power Set, Replacement, and Choice are broached in the formal elaboration of the ‘set of’f {} operation. So it is surprising that, while these notions are unproblematic today, they were once sources of considerable concern and confusion among leading pioneers of mathematical logic like Frege, Russell, Dedekind, and Peano. In the development of modern mathematical logic out of the turbulence of 19th century logic, the emergence of the empty set, the singleton, and the ordered pair as clear and elementary set-theoretic concepts serves as amotif that reflects and illuminates larger and more significant developments in mathematical logic: the shift from the intensional to the extensional viewpoint, the development of type distinctions, the logical vs. the iterative conception of set, and the emergence of various concepts and principles as distinctively set-theoretic rather than purely logical. Here there is a loose analogy with Tarski's recursive definition of truth for formal languages: The mathematical interest lies mainly in the procedure of recursion and the attendant formal semantics in model theory, whereas the philosophical interest lies mainly in the basis of the recursion, truth and meaning at the level of basic predication. Circling back to the beginning, we shall see how central the empty set, the singleton, and the ordered pair were, after all.

The consistency of classical set theory relative to a set theory with intu1tionistic logic

1973 ◽  
Vol 38 (2) ◽  
pp. 315-319 ◽  
Author(s):  
Harvey Friedman
Keyword(s):  
Set Theory ◽  
Classical Theory ◽  
Intuitionistic Logic ◽  
Classical Logic ◽  
Predicate Calculus ◽  
Basic Tool ◽  
Axiom Scheme ◽  
Power Set ◽  
Image Position

Let ZF be the usual Zermelo-Fraenkel set theory formulated without identity, and with the collection axiom scheme. Let ZF−-extensionality be obtained from ZF by using intuitionistic logic instead of classical logic, and dropping the axiom of extensionality. We give a syntactic transformation of ZF into ZF−-extensionality.Let CPC, HPC respectively be classical, intuitionistic predicate calculus without identity, whose only homological symbol is ∈. We use the ~ ~-translation, a basic tool in the metatheory of intuitionistic systems, which is defined byThe two fundamental lemmas about this ~ ~ -translation we will use areFor proofs, see Kleene [3, Lemma 43a, Theorem 60d].This - would provide the desired syntactic transformation at least for ZF into ZF− with extensionality, if A− were provable in ZF− for each axiom A of ZF. Unfortunately, the ~ ~-translations of extensionality and power set appear not to be provable in ZF−. We therefore form an auxiliary classical theory S which has no extensionality and has a weakened power set axiom, and show in §2 that the ~ ~-translation of each axiom of Sis provable in ZF−-extensionality. §1 is devoted to the translation of ZF in S.

Inner Models and Large Cardinals

1995 ◽  
Vol 1 (4) ◽  
pp. 393-407 ◽  
Author(s):  
Ronald Jensen
Keyword(s):  
Set Theory ◽  
Cardinal Number ◽  
Ordinal Number ◽  
Infinite Cardinal ◽  
Recursive Definition ◽  
Von Neumann ◽  
Ordinal Numbers ◽  
Kurt Gödel ◽  
Uncountable Cardinal ◽  
Image Position

In this paper, we sketch the development of two important themes of modern set theory, both of which can be regarded as growing out of work of Kurt Gödel. We begin with a review of some basic concepts and conventions of set theory. §0. The ordinal numbers were Georg Cantor's deepest contribution to mathematics. After the natural numbers 0, 1, …, n, … comes the first infinite ordinal number ω, followed by ω + 1, ω + 2, …, ω + ω, … and so forth. ω is the first limit ordinal as it is neither 0 nor a successor ordinal. We follow the von Neumann convention, according to which each ordinal number α is identified with the set {ν ∣ ν α} of its predecessors. The ∈ relation on ordinals thus coincides with <. We have 0 = ∅ and α + 1 = α ∪ {α}. According to the usual set-theoretic conventions, ω is identified with the first infinite cardinal ℵ0, similarly for the first uncountable ordinal number ω1 and the first uncountable cardinal number ℵ1, etc. We thus arrive at the following picture: The von Neumann hierarchy divides the class V of all sets into a hierarchy of sets Vα indexed by the ordinal numbers. The recursive definition reads: (where } is the power set of x); Vλ = ∪v<λVv for limit ordinals λ. We can represent this hierarchy by the following picture.

On a singular eigenvalue problem

1968 ◽  
Vol 64 (2) ◽  
pp. 439-446 ◽  
Author(s):  
D. Naylor ◽  
S. C. R. Dennis
Keyword(s):  
Differential Equation ◽  
Eigenvalue Problem ◽  
Bessel Functions ◽  
Asymptotic Condition ◽  
Real Constant ◽  
Limit Circle ◽  
Expansion In Eigenfunctions ◽  
Image Position

Sears and Titchmarsh (1) have formulated an expansion in eigenfunctions which requires a knowledge of the s-zeros of the equationHere ka > 0 is supposed given and β is a real constant such that 0 ≤ β < π. The above equation is encountered when one seeks the eigenfunctions of the differential equationon the interval 0 < α ≤ r < ∞ subject to the condition of vanishing at r = α. Solutions of (2) are the Bessel functions J±is(kr) and every solution w of (2) is such that r−½w(r) belongs to L2 (α, ∞). Since the problem is of the limit circle type at infinity it is necessary to prescribe a suitable asymptotic condition there to make the eigenfunctions determinate. In the present instance this condition is

A property of the asymptotic series for a class of Titchmarsh–Weyl m-functions

1986 ◽  
Vol 102 (3-4) ◽  
pp. 253-257 ◽  
Author(s):  
B. J. Harris
Keyword(s):  
Differential Equation ◽  
Asymptotic Expansion ◽  
Linear Differential Equation ◽  
Asymptotic Series ◽  
Second Order ◽  
Order Linear Differential Equation ◽  
Order Linear ◽  
The Real ◽  
Linear Differential ◽  
Image Position

SynopsisIn an earlier paper [6] we showed that if q ϵ CN[0, ε) for some ε > 0, then the Titchmarsh–Weyl m(λ) function associated with the second order linear differential equationhas the asymptotic expansionas |A| →∞ in a sector of the form 0 < δ < arg λ < π – δ.We show that if the real valued function q admits the expansionin a neighbourhood of 0, then

scholarly journals On Runge-Kutta processes of high order

1964 ◽  
Vol 4 (2) ◽  
pp. 179-194 ◽  
Author(s):  
J. C. Butcher
Keyword(s):  
Differential Equation ◽  
High Order ◽  
Runge Kutta ◽  
Image Position

An (explicit) Runge-Kutta process is a means of numerically solving the differential equation , at the point x = x0+h, where y, f may be vectors.

Fast diffusion with loss at infinity

1995 ◽  
Vol 36 (4) ◽  
pp. 438-459 ◽  
Author(s):  
J. R. Philip
Keyword(s):  
Differential Equation ◽  
Ordinary Differential Equation ◽  
Fast Diffusion ◽  
Solution Properties ◽  
Positive Power ◽  
Negative Power ◽  
Exponential Decrease ◽  
Class 1 ◽  
Image Position ◽  
Instantaneous Source

AbstractWe study the equationHere s is not necessarily integral; m is initially unrestricted. Material-conserving instantaneous source solutions of A are reviewed as an entrée to material-losing solutions. Simple physical arguments show that solutions for a finite slug losing material at infinity at a finite nonzero rate can exist only for the following m-ranges: 0 < s < 2, −2s−1 < m ≤ −1; s > 2, −1 < m < −2s−1. The result for s = 1 was known previously. The case s = 2, m = −1, needs further investigation. Three different similarity schemes all lead to the same ordinary differential equation. For 0 < s < 2, parameter γ (0 < γ < ∞) in that equation discriminates between the three classes of solution: class 1 gives the concentration scale decreasing as a negative power of (1 + t/T); 2 gives exponential decrease; and 3 gives decrease as a positive power of (1 − t/T), the solution vanishing at t = T < ∞. Solutions for s = 1, are presented graphically. The variation of concentration and flux profiles with increasing γ is physically explicable in terms of increasing flux at infinity. An indefinitely large number of exact solutions are found for s = 1,γ = 1. These demonstrate the systematic variation of solution properties as m decreases from −1 toward −2 at fixed γ.

Transcendence of cardinals

1965 ◽  
Vol 30 (1) ◽  
pp. 1-7 ◽  
Author(s):  
Gaisi Takeuti
Keyword(s):  
Set Theory ◽  
Natural Numbers ◽  
Recursive Functions ◽  
Power Set ◽  
Recursive Predicate

In this paper, by a function of ordinals we understand a function which is defined for all ordinals and each of whose value is an ordinal. In [7] (also cf. [8] or [9]) we defined recursive functions and predicates of ordinals, following Kleene's definition on natural numbers. A predicate will be called arithmetical, if it is obtained from a recursive predicate by prefixing a sequence of alternating quantifiers. A function will be called arithmetical, if its representing predicate is arithmetical.The cardinals are identified with those ordinals a which have larger power than all smaller ordinals than a. For any given ordinal a, we denote by the cardinal of a and by 2a the cardinal which is of the same power as the power set of a. Let χ be the function such that χ(a) is the least cardinal which is greater than a.Now there are functions of ordinals such that they are easily defined in set theory, but it seems impossible to define them as arithmetical ones; χ is such a function. If we define χ in making use of only the language on ordinals, it seems necessary to use the notion of all the functions from ordinals, e.g., as in [6].

scholarly journals On the integration processes of A. Huťa

1963 ◽  
Vol 3 (2) ◽  
pp. 202-206 ◽  
Author(s):  
J. C. Butcher
Keyword(s):  
Differential Equation ◽  
Order Differential Equation ◽  
Sixth Order ◽  
Order Accuracy ◽  
First Order ◽  
Runge Kutta ◽  
Image Position

Huta [1], [2] has given two processes for solving a first order differential equation to sixth order accuracy. His methods are each eight stage Runge-Kutta processes and differ mainly in that the later process has simpler coefficients occurring in it.

Sign in / Sign up

Export Citation Format

Share Document