Registered users receive a variety of benefits including the ability to customize email alerts, create favorite journals list, and save searches.
Please note that a Project Euclid web account does not automatically grant access to full-text content. An institutional or society member subscription is required to view non-Open Access content.
Contact firstname.lastname@example.org with any questions.
Using the lottery preparation, we prove that any strongly unfoldable cardinal can be made indestructible by all <-closed -preserving forcing. This degree of indestructibility, we prove, is the best possible from this hypothesis within the class of <-closed forcing. From a stronger hypothesis, however, we prove that the strong unfoldability of can be made indestructible by all <-closed forcing. Such indestructibility, we prove, does not follow from indestructibility merely by <-directed closed forcing. Finally, we obtain global and universal forms of indestructibility for strong unfoldability, finding the exact consistency strength of universal indestructibility for strong unfoldability.
In his "From classical to constructive probability," Weatherson offers a generalization of Kolmogorov's axioms of classical probability that is neutral regarding the logic for the object-language. Weatherson's generalized notion of probability can hardly be regarded as adequate, as the example of supervaluationist logic shows. At least, if we model credences as betting rates, the Dutch-Book argument strategy does not support Weatherson's notion of supervaluationist probability, but various alternatives. Depending on whether supervaluationist bets are specified as (a) conditional bets (Cantwell), (b) unconditional bets with graded payoffs (Milne), or (c) unconditional bets with ungraded payoffs(Dietz), supervaluationist probability amounts to (a) conditional probability of truth given a truth-value, (b) the expected truth-value, or (c) the probability of truth, respectively. It is suggested that for supervaluationist logic, the third option is the most attractive one, for (unlike the other options) it preserves respect for single-premise entailment.
Van Lambalgen's Theorem plays an important role in algorithmic randomness, especially when studying relative randomness. In this paper we extend van Lambalgen's Theorem by considering the join of infinitely many reals which are random relative to each other. In addition, we study computability of the reals in the range of Omega operators. It is known that is high. We extend this result to that is . We also prove that there exists A such that, for each n, the real is for some universal Turing machine M by using the extended van Lambalgen's Theorem.
Pure second-order logic is second-order logic without functional or first-order variables. In "Pure Second-Order Logic," Denyer shows that pure second-order logic is compact and that its notion of logical truth is decidable. However, his argument does not extend to pure second-order logic with second-order identity. We give a more general argument, based on elimination of quantifiers, which shows that any formula of pure second-order logic with second-order identity is equivalent to a member of a circumscribed class of formulas. As a corollary, pure second-order logic with second-order identity is compact, its notion of logical truth is decidable, and it satisfies a pure second-order analogue of model completeness. We end by mentioning an extension to nth-order pure logics.
In this paper we study abstract elementary classes with Löwenheim-Skolem number , where is cofinal with , which have finite character. We generalize results obtained by Kueker for . In particular, we show that is closed under -elementary equivalence and obtain sufficient conditions for to be -axiomatizable. In addition, we provide an example to illustrate that if is uncountable regular then is not closed under -elementary equivalence.
The question of the origin of polyadic expressivity is explored and the results are brought to bear on Bertrand Russell's 1903 theory of denoting concepts, which is the main object of criticism in his 1905 "On Denoting." It is shown that, appearances to the contrary notwithstanding, the background ontology of the earlier theory of denoting enables the full-blown expressive power of first-order polyadic quantification theory without any syntactic accommodation of scopal differences among denoting phrases such as 'all φ', 'every φ', and 'any φ' on the one hand, and 'some φ' and 'a φ' on the other. The case provides an especially vivid illustration of the general point that structural (or ideological) austerity can be paid for in the coin of ontological extravagance.
Whitehead, in two basic books, considers two different approaches to point-free geometry: the inclusion-based approach, whose primitive notions are regions and inclusion relation between regions, and the connection-based approach, where the connection relation is considered instead of the inclusion. We show that the latter cannot be reduced to the first one, although this can be done in the framework of multivalued logics.