… In Part I we prove a generalization of the CK theorem for one equation. For the sake of …
prove a theorem which generalizes the CK theorem for general (nonlinear) systems. We note that …

… In this note ~e improve on the main result of [l], which generalizes H. FRIEDMAN'S theorem
that every countable non-standard model of PEANO'S axioms is isomorphic to a proper initial …

… estimates and of the existence theorems used in this paper. We remark Theorem 1 can also
be … In Part III we extend Theorems 1 and 3 to non-cylindrical domains w cross section at t = τ …

… The theory based on these four principles is known as Zermelo set theory together with the
axiom of choice, and is written Z in this paper. Then Z adequately formalizes mathematical …

… These problems are distributed in four subdivisions of logic: model theory, proof theory and
intuitionism, recursion theory, and set theory. They are written in the form of statements which …

… operators (Theorem 2). A further discussion of the assumptions made in Theorem 2 is given
… the coordinate t is non-decreasing from Q to P\In the following theorem we consider the case …

… theorem for … to Theorem 3 hold for the relation TB F s # t? Below, we give a negative answer.
We introduce a many-sorted predicate calculus (with equality), £ , appropriate for the theory …

… representation theorem … theorem for the corresponding class of additive functionals defined
on C(S) where S is an arbitrary compact metric space. It is easily seen that the Riesz theorem …

… we prove general regularity theorems for the syste include, as a special case, the theorem on
the … Theorem 1 is a general regularity theorem for the system (3) makes use of a method of …

… We prove related theorems for other models of random graphs, including models with d odd…
Note: in Theorems 3.13 and 4.2 we give a proof of a generalization of this theorem requiring …