A new process logic is defined, called computation paths logic (CPL). which treats lbnn~~la~ and programs essentially alike. CPL is a pathwlse extension of PDL. following the basic pt-ocess logic of… Expand

This work deals with set-theoretic independence results (independence from the usual set-theoretic ZFC axioms), in particular for problems on the continuum. Consequently, the theory of iterated… Expand

We deal with the monadic (second-order) theory of order. We prove all known results in a unified way, show a general way of reduction, prove more results and show the limitation on extending them. We… Expand

It is shown that with the addition of the 'until' operator -U the temporal language becomes expressively complete and two deductive systems DX and DUX are proved to be complete for the languages without and with the new operator respectively.Expand

We prove, assuming the existence of a huge cardinal, the consistency of fully non-regular ultrafilters on the successor of any regular cardinal. We also construct ultrafilters with ultraproducts of… Expand

For random graph theorists (see, e.g., Bollobas [1] for general reference) p "any constant" is not the only, not even the most interesting case. Rather, they consider p = p(n), a function approaching… Expand

a = 1, a+ = 2U(n,c '), i > O. Then U(n + ?, c) = ac . In order to get some idea of the rate of growth of U(n, c) (and of the functions which will be introduced later in this paper), we shall define… Expand

This paper discusses types and Saturated Models, the number of Non-Isomorphic Models in Pseudo-Elementary Classes, and Categoricity and the Number of Models in Elementary Classes.Expand