Axiomatic set theory is the concern of this book. More particularly, the authors prove results about the coding of models M, of Zermelo-Fraenkel set theory together with the Generalized Continuum Hypothesis by using a class 'forcing' construction. By this method they extend M to another model L[a] with the same properties. L[a] is Gödels universe of 'constructible' sets L, together with a set of integers a which code all the cardinality and cofinality structure of M. Some applications are also considered. Graduate students and research workers in set theory and logic will be especially interested by this account.
Abstract. This paper continues the study of the Ramsey-like large cardinals introduced in [Git09] and [WS08]. Ramsey-like cardinals are defined by generalizing the "existence of elementary embeddings" characterization of Ramsey cardinals. A cardinal κ is Ramsey if and only if every subset of κ can be put into a κ-size transitive model of ZFC for which there exists a weakly amenable countably complete ultrafilter. Such ultrafilters are fully iterable and so it is natural to ask about large cardinal notions asserting the existence of ultrafilters allowing only α-many iterations for some countable ordinal α. Here we study such α-iterable cardinals. We show that the α-iterable cardinals form a strict hierarchy for α ≤ ω 1 and they are downward absolute to L for α < ω L
We show that the halting times of infinite time Turing machines (considered as ordinals coded by sets of integers) are themselves all capable of being halting outputs of such machines. This gives a clarification of the nature of ‘supertasks’ or infinite time computations. The proof further yields that the class of sets coded by outputs of halting computations coincides with a level of Gödel's constructible hierarchy: namely that of Lλ where λ is the supremum of halting times. A number of other open questions are thereby answered. 1991 Mathematics Subject Classification 03D10, 03D60, 03E45.
Abstract. If is conceived as an operator, i.e., an expression that gives applied to a formula another formula, the expressive power of the language is severely restricted when compared to a language where is conceived as a predicate, i.e., an expression that yields a formula if it is applied to a term. This consideration favours the predicate approach. The predicate view, however, is threatened mainly by two problems: Some obvious predicate systems are inconsistent, and possible-worlds semantics for predicates of sentences has not been developed very far. By introducing possible-worlds semantics for the language of arithmetic plus the unary predicate , we tackle both problems. Given a frame W, R consisting of a set W of worlds and a binary relation R on W, we investigate whether we can interpret at every world in such a way that A holds at a world w ∈ W if and only if A holds at every world v ∈ W such that wRv. The arithmetical vocabulary is interpreted by the standard model at every world. Several 'paradoxes' (like Montague's Theorem, Gödel's Second Incompleteness Theorem, McGee's Theorem on the ω-inconsistency of certain truth theories etc.) show that many frames, e.g., reflexive frames, do not allow for such an interpretation. We present sufficient and necessary conditions for the existence of a suitable interpretation of at any world. Sound and complete semi-formal systems, corresponding to the modal systems K and K4, for the class of all possible-worlds models for predicates and all transitive possible-worlds models are presented. We apply our account also to nonstandard models of arithmetic and other languages than the language of arithmetic.
The authors present empirical distributions for the halting time (measured by the number of iterations to reach a given accuracy) of optimization algorithms applied to two random systems: spin glasses and deep learning. Given an algorithm, which we take to be both the optimization routine and the form of the random landscape, the fluctuations of the halting time follow a distribution that, after centering and scaling, remains unchanged even when the distribution on the landscape is changed. We observe two qualitative classes: A Gumbel-like distribution that appears in Google searches, human decision times, the QR eigenvalue algorithm and spin glasses, and a Gaussian-like distribution that appears in conjugate gradient method, deep network with MNIST input data and deep network with random input data. This empirical evidence suggests presence of a class of distributions for which the halting time is independent of the underlying distribution under some conditions.
We characterise explicitly the decidable predicates on integers of Infinite Time Turing machines, in terms of admissibility theory and the constructible hierarchy. We do this by pinning down ζ, the least ordinal not the length of any eventual output of an Infinite Time Turing machine (halting or otherwise); using this the Infinite Time Turing Degrees are considered, and it is shown how the jump operator coincides with the production of mastercodes for the constructible hierarchy; further that the natural ordinals associated with the jump operator satisfy a Spector criterion, and correspond to the Lζ-stables. It also implies that the machines devised are “Σ2 Complete” amongst all such other possible machines. It is shown that least upper bounds of an “eventual jump” hierarchy exist on an initial segment.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.