A bounded ultrasheaf is a nonstandard universe constructed from a superstructure in a Boolean valued model of set theory. We consider the bounded elementary embeddings between bounded ultrasheaves. Then the standardization principle is true if and only if the ultrafilters are comparable by the Rudin-Frolik order. The base concept is that the bounded elementary embeddings correspond to the complete Boolean homomorphisms. We represent this by the Rudin-Keisler order of ultrafilters of Boolean algebras.

A definition of nonstandard universe which gets over the limitation to the finite levels of the cumulative hierarchy is proposed. Though necessarily nonwellfounded, nonstandard universes are arranged in strata in the likeness of superstructures and allow a rank function taking linearly ordered values. Nonstandard universes are also constructed which model the whole ZFC theory without regularity and satisfy the $\kappa$-saturation property.

In continuation of our study of HST, Hrbaek set theory (a nonstandard set theory which includes, in particular, the ZFC Replacement and Separation schemata in the st--language, and Saturation for well-orderable families of internal sets), we consider the problem of existence of elementary extensions of inner "external" subclasses of the HST universe.We show that, given a standard cardinal , any set R * generates an "internal" class S(R) of all sets standard relatively to elements of R, and an (...) "external" class L[S(R)] of all sets constructible (in a sense close to the Gödel constructibility) from sets in S(R). We prove that under some mild saturation-like requirements for R the class L[S(R)] models a certain -version of HST including the principle of +-saturation; moreover, in this case L[S(R)] is an elementary extension of L[S(R)] in the st--language whenever sets R R satisfy the requirements. (shrink)

A nonstandard universe is constructed from a superstructure in a Boolean-valued model of set theory. This provides a new framework of nonstandard analysis with which methods of forcing are incorporated naturally. Various new principles in this framework are provided together with the following applications: An example of an 1-saturated Boolean ultrapower of the real number field which is not Scott complete is constructed. Infinitesimal analysis based on the generic extension of the hyperreal numbers is provided, and the (...) hull completeness theorem and the Loeb measure construction are extended to objects in the generic extension of the internal universe. The reduction theory of the Boolean-valued complex numbers are developed as a prototype of the applications to the topological reduction theory of Boolean sheaves or operator algebras. (shrink)

This article establishes the existence of a definable , countably saturated nonstandard enlargement of the superstructure over the reals. This nonstandard universe is obtained as the union of an inductive chain of bounded ultrapowers . The underlying ultrafilter is the one constructed by Kanovei and Shelah [10].

It is known (see [1, 3.1.5]) that the order type of the nonstandard natural number system * N has the form ω + (ω * + ω) θ, where θ is a dense order type without first or last element and ω is the order type of N. Concerning this, Zakon [2] examined * N more closely and investigated the nonstandard real number system * R, as an ordered set, as an additive group and as a uniform space. (...) He raised five questions which remained unsolved. These questions are concerned with the cofinality and coinitiality of θ (which depend on the underlying nonstandard universe * U). In this paper, we shall treat nonstandard models where the cofinality and coinitiality of θ coincide with some appropriated cardinals. Using these nonstandard models, we shall give answers to three of these questions and partial answers to the other to questions in [2]. (shrink)

This lecture, given at Beijing University in 1984, presents a remarkable (previously unpublished) proof of the Gödel Incompleteness Theorem due to Kripke. Today we know purely algebraic techniques that can be used to give direct proofs of the existence of nonstandard models in a style with which ordinary mathematicians feel perfectly comfortable--techniques that do not even require knowledge of the Completeness Theorem or even require that logic itself be axiomatized. Kripke used these techniques to establish incompleteness by means that (...) could, in principle, have been understood by nineteenth-century mathematicians. The proof exhibits a statement of number theory--one which is not at all "self referring"--and constructs two models, in one of which it is true and in the other of which it is false, thereby establishing "undecidability" (independence). (shrink)

Łoś's theorem for bounded D -ultrapowers, D being the ultrafilter introduced by Kanovei and Shelah [4], is established.

We study models of HST . This theory admits an adequate formulation of the isomorphism propertyIP, which postulates that any two elementarily equivalent internally presented structures of a well-orderable language are isomorphic. We prove that IP is independent of HST and consistent with HST.

Currently the two popular ways to practice Robinson’s nonstandard analysis are the model-theoretic approach and the axiomatic/syntactic approach. It is sometimes claimed that the internal axiomatic approach is unable to handle constructions relying on external sets. We show that internal frameworks provide successful accounts of nonstandard hulls and Loeb measures. The basic fact this work relies on is that the ultrapower of the standard universe by a standard ultrafilter is naturally isomorphic to a subuniverse of the internal (...) universe. (shrink)

Mathematicians justify axioms of set theory “intrinsically”, by reference to the universe of sets of their intuition, and “extrinsically”, for example, by considerations of simplicity or usefullness for mathematical practice. Here we apply the same kind of justifications to Nonstandard Analysis and argue for acceptance of BNST+ . BNST+ has nontrivial consequences for standard set theory; for example, it implies existence of inner models with measurable cardinals. We also consider how to practice Nonstandard Analysis in BNST+, and (...) compare it with other existing nonstandard set theories. (shrink)

We prove that Standardization fails in every nontrivial universe definable in the nonstandard set theory BST, and that a natural characterization of the standard universe is both consistent with and independent of BST. As a consequence we obtain a formulation of nonstandard class theory in the ∈-language.

In this article we show how the universe of BST, bounded set theory can be enlarged by definable subclasses of sets so that Separation and Replacement are true in the enlargement for all formulas, including those in which the standardness predicate may occur. Thus BST is strong enough to incorporate external sets in the internal universe in a way sufficient to develop topics in nonstandard analysis inaccessible in the framework of a purely internal approach, such as Loeb (...) measures. (shrink)

The main theorem of this article is that every countable model of set theory 〈M, ∈M〉, including every well-founded model, is isomorphic to a submodel of its own constructible universe 〈LM, ∈M〉 by means of an embedding j : M → LM. It follows from the proof that the countable models of set theory are linearly pre-ordered by embeddability: if 〈M, ∈M〉 and 〈N, ∈N〉 are countable models of set theory, then either M is isomorphic to a submodel of (...) N or conversely. Indeed, these models are pre-well-ordered by embeddability in order-type exactly ω1+ 1. Specifically, the countable well-founded models are ordered under embeddability exactly in accordance with the heights of their ordinals; every shorter model embeds into every taller model; every model of set theory M is universal for all countable well-founded binary relations of rank at most OrdM; and every ill-founded model of set theory is universal for all countable acyclic binary relations. Finally, strengthening a classical theorem of Ressayre, the proof method shows that if M is any nonstandard model of PA, then every countable model of set theory — in particular, every model of ZFC plus large cardinals — is isomorphic to a submodel of the hereditarily finite sets 〈 HFM, ∈M〉 of M. Indeed, 〈 HFM, ∈M〉 is universal for all countable acyclic binary relations. (shrink)

Journal of Mathematical Logic, Ahead of Print. In this paper, we investigate abstract model-theoretic properties which hold for models in which a truth or satisfaction predicate for a sublanguage of the signature is definable. We analyze in which cases those properties in fact ensure the definability of the respective truth predicate. In some cases, we formulate different axiomatic theories which are indispensable for such properties to hold and we analyze the mutual definability relations between those theories.

In this paper, we investigate abstract model-theoretic properties which hold for models in which a truth or satisfaction predicate for a sublanguage of the signature is definable. We analyze in which cases those properties in fact ensure the definability of the respective truth predicate. In some cases, we formulate different axiomatic theories which are indispensable for such properties to hold and we analyze the mutual definability relations between those theories.

In an ω1-saturated nonstandard universe a cut is an initial segment of the hyperintegers which is closed under addition. Keisler and Leth in [KL] introduced, for each given cut U, a corresponding U-topology on the hyperintegers by letting O be U-open if for any x ∈ O there is a y greater than all the elements in U such that the interval $\lbrack x - y, x + y\rbrack \subseteq O$ . Let U be a cut in a (...) hyperfinite time line H, which is a hyperfinite initial segment of the hyperintegers. U is called a good cut if there exists a U-meager subset of H of Loeb measure one. Otherwise U is bad. In this paper we discuss the questions of Keisler and Leth about the existence of bad cuts and related cuts. We show that assuming $\mathbf{b} > \omega_1$, every hyperfinite time line has a cut with both cofinality and coinitiality uncountable. We construct bad cuts in a nonstandard universe under ZFC. We also give two results about the existence of other kinds of cuts. (shrink)

In this article ‡ we show how the universe of HST, Hrbaček set theory admits a system of subuniverses which keep the Replacement, model Power set and Choice, and also keep as much of Saturation as it is necessary. This gives sufficient tools to develop the most complicated topics in nonstandard analysis, such as Loeb measures.

In an ω1-saturated nonstandard universe a cut is an initial segment of the hyperintegers which is closed under addition. Keisler and Leth in [KL] introduced, for each given cut U, a corresponding U-topology on the hyperintegers by letting O be U-open if for any x ∈ O there is a y greater than all the elements in U such that the interval $\lbrack x - y, x + y\rbrack \subseteq O$ . Let U be a cut in a (...) hyperfinite time line H, which is a hyperfinite initial segment of the hyperintegers. The U-monad topology of H is the quotient topology of the U-topological space H modulo U. In this paper we answer a question of Keisler and Leth about the U-monad topologies by showing that when H is κ-saturated and has cardinality κ, (1) if the coinitiality of U1 is uncountable, then the U1-monad topology and the U2-monad topology are homeomorphic iff both U1 and U2 have the same coinitiality; and (2) H can produce exactly three different U-monad topologies (up to homeomorphism) for those U's with countable coinitiality. As a corollary H can produce exactly four different U-monad topologies if the cardinality of H is ω1. (shrink)

In a nonstandard universe, the $\kappa$-saturation property states that any family of fewer than $\kappa$ internal sets with the finite intersection property has a nonempty intersection. An ordered field $F$ is said to have the $\lambda$-Bolzano-Weierstrass property iff $F$ has cofinality $\lambda$ and every bounded $\lambda$-sequence in $F$ has a convergent $\lambda$-subsequence. We show that if $\kappa < \lambda$ are uncountable regular cardinals and $\beta^\alpha < \lambda$ whenever $\alpha < \kappa$ and $\beta < \lambda$, then there is a (...) $\kappa$-saturated nonstandard universe in which the hyperreal numbers have the $\lambda$-Bolzano-Weierstrass property. The result also applies to certain fragments of set theory and second order arithmetic. (shrink)

In nonstandard mathematics, the predicate ‘x is standard’ is fundamental. Recently, ‘relative’ or ‘stratified’ nonstandard theories have been developed in which this predicate is replaced with ‘x is y -standard’. Thus, objects are not standard in an absolute sense, but standard relative to other objects and there is a whole stratified universe of ‘levels’ or ‘degrees’ of standardness. Here, we study stratified nonstandard arithmetic and the related transfer principle. Using the latter, we obtain the ‘reduction theorem’ (...) which states that arithmetical formulas can be reduced to equivalent bounded formulas. Surprisingly, the reduction theorem is also equivalent to the transfer principle. As applications, we obtain a truth definition for arithmetical sentences and we formalize Nelson's notion of impredicativity. (shrink)

In an ω1-saturated nonstandard universe a cut is an initial segment of the hyperintegers which is closed under addition. Keisler and Leth in [KL] introduced, for each given cut U, a corresponding U-topology on the hyperintegers by letting O be U-open if for any x ∈ O there is a y greater than all the elements in U such that the interval $\lbrack x - y, x + y\rbrack \subseteq O$ . Let U be a cut in a (...) hyperfinite time line H, which is a hyperfinite initial segment of the hyperintegers. A subset B of H is called a U-Lusin set in H if B is uncountable and for any Loeb-Borel U-meager subset X of H, B ∩ X is countable. Here a Loeb-Borel set is an element of the σ-algebra generated by all internal subsets of H. In this paper we answer some questions of Keisler and Leth about the existence of U-Lusin sets by proving the following facts. (1) If $U = x/\mathbb{N} = \{y \in \mathscr{H}: \forall n \in \mathbb{N}(y < x/n)\}$ for some x ∈ H, then there exists a U-Lusin set of power κ if and only if there exists a Lusin set of the reals of power κ. (2) If U ≠ x/N but the coinitiality of U is ω, then there are no U-Lusin sets if CH fails. (3) Under ZFC there exists a nonstandard universe in which U-Lusin sets exist for every cut U with uncountable cofinality and coinitiality. (4) In any ω2-saturated nonstandard universe there are no U-Lusin sets for all cuts U except U = x/N. (shrink)

The rejection of an infinitesimal solution to the zero-fit problem by A. Elga ([2004]) does not seem to appreciate the opportunities provided by the use of internal finitely-additive probability measures. Indeed, internal laws of probability can be used to find a satisfactory infinitesimal answer to many zero-fit problems, not only to the one suggested by Elga, but also to the Markov chain (that is, discrete and memory-less) models of reality. Moreover, the generalization of likelihoods that Elga has in mind is (...) not as hopeless as it appears to be in his article. In fact, for many practically important examples, through the use of likelihoods one can succeed in circumventing the zero-fit problem. 1 The Zero-fit Problem on Infinite State Spaces 2 Elga's Critique of the Infinitesimal Approach to the Zero-fit Problem 3 Two Examples for Infinitesimal Solutions to the Zero-fit Problem 4 Mathematical Modelling in Nonstandard Universes? 5 Are Nonstandard Models Unnatural? 6 Likelihoods and Densities A Internal Probability Measures and the Loeb Measure Construction B The (Countable) Coin Tossing Sequence Revisited C Solution to the Zero-fit Problem for a Finite-state Model without Memory D An Additional Note on ‘Integrating over Densities’ E Well-defined Continuous Versions of Density Functions. (shrink)

Let X be an infinite internal set in an ω1-saturated nonstandard universe. Then for any coloring of [X] k , such that the equivalence E of having the same color is countably determined and there is no infinite internal subset of [X] k with all its elements of different colors (i.e., E is condensating on X), there exists an infinite internal set Z⊆X such that all the sets in [Z] k have the same color. This Ramsey-type result is (...) obtained as a consequence of a more general one, asserting the existence of infinite internal Q-homogeneous sets for certain Q ⊆ [[X] k ] m , with arbitrary standard k≥ 1, m≥ 2. In the course of the proof certain minimal condensating countably determined sets will be described. (shrink)

McCawley supplements his earlier book—which covers such topics as presuppositional logic, the logic of mass terms and nonstandard quantifiers, and fuzzy logic—with new material on the logic of conditional sentences, linguistic applications of type theory, Anil Gupta's work on principles of identity, and the generalized quantifier approach to the logical properties of determiners.

We study classes of ultrafilters on ω defined by a natural property of the Loeb measure in the Nonstandard Universe corresponding to the ultrafilter. This class, the Property M ultrafilters, is shown to contain all ultrafilters built up by taking iterated products over collections of pairwise nonisomorphic selective ultrafilters. Results on Property M ultrafilters are applied to the construction of extensions of probability measures, and to the study of measurable reductions between ultrafilters.

In § 1 of this paper, we characterize the isomorphism property of nonstandard universes in terms of the realization of some second-order types in model theory. In § 2, several applications are given. One of the applications answers a question of D. Ross in [this Journal, vol. 55 (1990), pp. 1233-1242] about infinite Loeb measure spaces.

In this paper we show that the compactness of a Loeb space depends on its cardinality, the nonstandard universe it belongs to and the underlying model of set theory we live in. In $\S1$ we prove that Loeb spaces are compact under various assumptions, and in $\S2$ we prove that Loeb spaces are not compact under various other assumptions. The results in $\S1$ and $\S2$ give a quite complete answer to a question of D. Ross in [9], [11] (...) and [12]. (shrink)

Type two cuts, bad cuts and very bad cuts are introduced in [10] for studying the relationship between Loeb measure and U-topology of a hyperfinite time line in an ω 1 -saturated nonstandard universe. The questions concerning the existence of those cuts are asked there. In this paper we answer, fully or partially, some of those questions by showing that: (1) type two cuts exist, (2) the ℵ 1 -isomorphism property implies that bad cuts exist, but no bad (...) cuts are very bad. (shrink)

An L-structure is called internally presented in a nonstandard universe if its base set and interpretation of every symbol in L are internal. A nonstandard universe is said to satisfy the κ-isomorphism property if for any two internally presented L-structures U and B, where L has less than κ many symbols, U is elementarily equivalent to B implies that U is isomorphic to B. In this paper we prove that the ℵ1-isomorphism property is equivalent to the (...) ℵ0-isomorphism property plus ℵ1-saturation. (shrink)

In this paper we ask the question: to what extent do basic set theoretic properties of Loeb measure depend on the nonstandard universe and on properties of the model of set theory in which it lies? We show that, assuming Martin's axiom and κ-saturation, the smallest cover by Loeb measure zero sets must have cardinality less than κ. In contrast to this we show that the additivity of Loeb measure cannot be greater than ω 1 . Define $\operatorname{cof}(H)$ (...) as the smallest cardinality of a family of Loeb measure zero sets which cover every other Loeb measure zero set. We show that $\operatorname{card}(\lfloor\log_2(H)\rfloor) \leq \operatorname{cof}(H) \leq \operatorname{card}(2^H)$ , where card is the external cardinality. We answer a question of Paris and Mills concerning cuts in nonstandard models of number theory. We also present a pair of nonstandard universes $M \preccurlyeq N$ and hyperfinite integer H ∈ M such that H is not enlarged by N, 2 H contains new elements, but every new subset of H has Loeb measure zero. We show that it is consistent that there exists a Sierpiński set in the reals but no Loeb-Sierpiński set in any nonstandard universe. We also show that it is consistent with the failure of the continuum hypothesis that Loeb-Sierpiński sets can exist in some nonstandard universes and even in an ultrapower of a standard universe. (shrink)

We prove that there exists a function f which reduces a given Π1 1 subset P of an internal set X of an ω1-saturated nonstandard universe to the set WF of well-founded trees possessing properties similar to those possessed by the standard part map. We use f to define the Lusin-Sierpinski index of points in X, and prove the basic properties of that index using the classical properties of the Lusin-Sierpinski index. An example of a Π1 1 but (...) not Σ1 1 set is given. (shrink)

Some highly saturated models of Peano Arithmetic are constructed in this paper, which consists of two independent sections. In § 1 we answer a question raised in [10] by constructing some highly saturated, rather classless models of PA. A question raised in [7], [3], ]4] is answered in §2, where highly saturated, nonstandard universes having no bad cuts are constructed.Highly saturated, rather classless models of Peano Arithmetic were constructed in [10]. The main result proved there is the following theorem. (...) If λ is a regular cardinal andis aλ-saturated model of PA such that ∣M∣ >λ, thenhas an elementary extensionof the same cardinality which is alsoλ-saturated and which, in addition, is rather classless. The construction in [10] produced a modelfor which cf() =λ+. We asked in Question 5.1 of [10] what other cofinalities could such a modelhave. This question is answered here in Theorem 1.1 of §1 by showing that any cofinality not immediately excluded is possible. Its proof does not depend on the theorem from [10]; in fact, the proof presented here gives a proof of that theorem which is much simpler and shorter than the one in [10].Recursively saturated, rather classless κ-like models of PA were constructed in [9]. In the case of singular κ such models were constructed whenever cf(κ) > ℵ0; no additional set-theoretic hypothesis was needed. (shrink)

Elementary Recursive Nonstandard Analysis, in short ERNA, is a constructive system of nonstandard analysis with a PRA consistency proof, proposed around 1995 by Patrick Suppes and Richard Sommer. Recently, the author showed the consistency of ERNA with several transfer principles and proved results of nonstandard analysis in the resulting theories (see [12] and [13]). Here, we show that Weak König's lemma (WKL) and many of its equivalent formulations over RCA₀ from Reverse Mathematics (see [21] and [22]) can (...) be 'pushed down' into the weak theory ERNA, while preserving the equivalences, but at the price of replacing equality with equality 'up to infinitesimals'. It turns out that ERNA plays the role of RCA₀ and that transfer for universal formulas corresponds to WKL. (shrink)

Following François Laruelle's nonstandard philosophy and the work of Judith Butler, Drucilla Cornell, Luce Irigaray, and Rosi Braidotti, Katerina Kolozova reclaims the relevance of categories traditionally rendered "unthinkable" by postmodern feminist philosophies, such as "the real," "the one," "the limit," and "finality," thus critically repositioning poststructuralist feminist philosophy and gender/queer studies. Poststructuralist (feminist) theory sees the subject as a purely linguistic category, as _always alread_y multiple, as _always already_ nonfixed and fluctuating, as limitless discursivity, and as constitutively detached from (...) the instance of the real. This reconceptualization is based on the exclusion of and dichotomous opposition to notions of the real, the one (unity and continuity), and the stable. The non-philosophical reading of postructuralist philosophy engenders new forms of universalisms for global debate and action, expressed in a language the world can understand. It also liberates theory from ideological paralysis, recasting the real as an immediately experienced human condition determined by gender, race, and social and economic circumstance. (shrink)

Carnap's philosophy is examined from new viewpoints, including three important distinctions: (i) language as calculus vs language as universal medium; (ii) different senses of completeness: (iii) standard vs nonstandard interpretations of (higher-order) logic. (i) Carnap favored in 1930-34 the "formal mode of speech," a corollary to the universality assumption. He later gave it up partially but retained some of its ingredients, e.g., the one-domain assumption. (ii) Carnap's project of creating a universal self-referential language is encouraged by (ii) and by (...) the author's recent work. (iii) Carnap was aware of (iii) and occasionally used the standard interpretation, but was not entirely clear of the nature of the contrast. (shrink)

A milestone in Wittgenstein scholarship, this collection of essays ranges over a wide area of the philosopher's thought, presenting divergent interpretations of his fundamental ideas. Different chapters raise many of the central controversies that surround current understanding of the Tractatus, providing an interplay that will be particularly useful to students. Taken together, the essays present a broader and more comprehensive view of Wittgenstein's intellectual interests and his impact on philosophy than may be found elsewhere.The thirteen chapters treat topics from both (...) periods of Wittgenstein's work: More than half are devoted to his early thought, the Tractatus Logico-Philosophicus of 1921, reflecting a growing interest today among philosophers in reexamining this seminal book, while three chapters treat the Philosophical Investigations, published posthumously in 1953. The remaining chapters discuss such "nonstandard" topics as philosophy of religion, aesthetics, and anthropology.Contents: The Early Wittgenstein and the Middle Russell, Kenneth Blackwell; Frege and Wittgenstein, Michael Dummett; Wittgenstein and the Theory of Types, Hide Ishiguro; The So-called Realism of Wittgenstein's Tractatus, Brian McGuinness; The Logical Independence of Elementary Propositions, David Pears; The Rise and Fall of the Picture Theory, Peter Hacker; The Picture Theory and Wittgenstein's Later Attitude to It, Erik Stenius; Wittgenstein's Early Philosophy of Mind, Anthony Kenny; A Theory of Language?, G. E. M. Anscombe; Im Anfang war die Tat, Peter Winch; Wittgenstein's Full Stop, D. Z. Phillips; Quote: Judgments from Our Brain, Paul Ziff; Wittgenstein and the Fire Festivals, Frank Cioffi, Index.Irving Block is Associate Professor in the Philosophy Department at The University of Western Ontario. (shrink)

It is and has been widely assumed, e.g., in Hintikka and Hintikka, that the logical theory available from Wittgenstein’s Tractatus Logico-Philosophicus affords a foundation for the conventional logic represented in standard formulations of classical propositional, first-order predicate, and perhaps higher-order formal systems. The present article is a detailed attempt at a mathematical demonstration, or as much demonstration as the sources will allow, that this assumption is false by contemporary lights and according to a preferred account of argument validity. When Wittgenstein’s (...) description of the forms of propositions or Sätze in the 5-numbered remarks and Remark 6 is given a close reconstruction, one sees that no Tractarian proposition is logically equivalent to a simple universally or existentially quantified formula of first-order predicate logic. Therefore, although Wittgenstein employs the sign ∀—or, in his notation—occasionally in explanations and illustrations, e.g., 4.0411 and 5.1311, when it comes to logic, the sign ∀ should receive in Tractatus a semantical treatment that is nonstandard. En route to that result, we show that the hierarchy of variables–and, hence, of propositions–defined at 5.501 incorporates the expressive power of finitary classical propositional logic. Also, when constructed over a first-order language for arithmetic, formulae corresponding to the specification of 5.501 pick out all and only arithmetic sets of numbers. Consequently, Wittgenstein’s hierarchy of iterated N-propositions–as described in vide Remark 6–does not collapse: at any level k, one finds propositions at k + 1 or above that are not logically equivalent to any proposition formed at k or below. (shrink)

When Aristotle introduces the perfect moods, he refers back to the dictum de omni et nullo, a semantic condition for universal affirmations and negations. There recently has been renewed interest in the question whether the dictum validates the assertoric syllogistic. I rehearse evidence that Aristotle provides a mereological semantics for universal affirmations and negations, and note that this semantics entails a nonstandard reading of the dictum, under which the dictum, in the presence of a minimal logical apparatus, indeed validates (...) the assertoric syllogistic. I argue that this mereological validation offers advantages over recent discussions in Morison, Malink, Ebert and Vlasits. (shrink)

By a classical theorem of Harvey Friedman, every countable nonstandard model $\mathcal {M}$ of a sufficiently strong fragment of ZF has a proper rank-initial self-embedding j, i.e., j is a self-embedding of $\mathcal {M}$ such that $j[\mathcal {M}]\subsetneq \mathcal {M}$, and the ordinal rank of each member of $j[\mathcal {M}]$ is less than the ordinal rank of each element of $\mathcal {M}\setminus j[\mathcal {M}]$. Here, we investigate the larger family of proper initial-embeddings j of models $\mathcal {M}$ of fragments (...) of set theory, where the image of j is a transitive submodel of $\mathcal {M}$. Our results include the following three theorems. In what follows, $\mathrm {ZF}^-$ is $\mathrm {ZF}$ without the power set axiom; $\mathrm {WO}$ is the axiom stating that every set can be well-ordered; $\mathrm {WF}$ is the well-founded part of $\mathcal {M}$ ; and $\Pi ^1_\infty \text{-}\mathrm {DC}_\alpha $ is the full scheme of dependent choice of length $\alpha $.Theorem A.There is an $\omega $ -standard countable nonstandard model $\mathcal {M}$ of $\mathrm {ZF}^-+\mathrm {WO}$ that carries no initial self-embedding $j:\mathcal {M} \longrightarrow \mathcal {M}$ other than the identity embedding.Theorem B.Every countable $\omega $ -nonstandard model $\mathcal {M}$ of $\ \mathrm {ZF}$ is isomorphic to a transitive submodel of the hereditarily countable sets of its own constructible universe $L^{\mathcal {M}}$.Theorem C.The following three conditions are equivalent for a countable nonstandard model $\mathcal {M}$ of $\mathrm {ZF}^{-}+\mathrm {WO}+\forall \alpha \ \Pi ^1_\infty \text{-}\mathrm {DC}_\alpha $. There is a cardinal in $\mathcal {M}$ that is a strict upper bound for the cardinality of each member of $\mathrm {WF}$. $\mathrm {WF}$ satisfies the powerset axiom.For all $n \in \omega $ and for all $b \in M$, there exists a proper initial self-embedding $j: \mathcal {M} \longrightarrow \mathcal {M}$ such that $b \in \mathrm {rng}$ and $j[\mathcal {M}] \prec _n \mathcal {M}$. (shrink)

The program of Reverse Mathematics (Simpson 2009) has provided us with the insight that most theorems of ordinary mathematics are either equivalent to one of a select few logical principles, or provable in a weak base theory. In this paper, we study the properties of the Dirac delta function (Dirac 1927; Schwartz 1951) in two settings of Reverse Mathematics. In particular, we consider the Dirac Delta Theorem, which formalizes the well-known property \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} (...) \begin{document}$${\int_\mathbb{R}f(x)\delta(x)\,dx=f(0)}$$\end{document} of the Dirac delta function. We show that the Dirac Delta Theorem is equivalent to weak König’s Lemma (see Yu and Simpson in Arch Math Log 30(3):171–180, 1990) in classical Reverse Mathematics. This further validates the status of WWKL0 as one of the ‘Big’ systems of Reverse Mathematics. In the context of ERNA’s Reverse Mathematics (Sanders in J Symb Log 76(2):637–664, 2011), we show that the Dirac Delta Theorem is equivalent to the Universal Transfer Principle. Since the Universal Transfer Principle corresponds to WKL, it seems that, in ERNA’s Reverse Mathematics, the principles corresponding to WKL and WWKL coincide. Hence, ERNA’s Reverse Mathematics is actually coarser than classical Reverse Mathematics, although the base theory has lower first-order strength. (shrink)

The ArugmentThis essay answers a single question: what was Robert Hooke, the Royal Society's curator of experiments, doing in his well-known 1665 work,Micrographia?Hooke was articulating a “universal cure of the mind” capable of bringing about a “reformation in Philosophy,” a change in philosophy's interpretive practices and organization. The work explicated the interpretive and political foundations for a community of optical instrument users coextensive with the struggling Royal Society. Standard observational practices would overcome the problem of using nonstandard instruments, while (...) inherent inrepresentation– the interpretive practice championed in the text – were important theological and political meanings. Hooke's kind of experimental philosophy undermined the claims made by “atheists” and “enthusiasts” – the enemies of the restored church and state – while also producing useful knowledge. Equally important, Hooke modeled the community described inMicrographiaupon the classicalres publica, but his community made important concessions to Restoration political realities, especially the growing role of commercial or transactional relationships. (shrink)

An important open problem in Reverse Mathematics is the reduction of the first-order strength of the base theory from IΣ1IΣ1 to IΔ0+expIΔ0+exp. The system ERNA, a version of Nonstandard Analysis based on the system IΔ0+expIΔ0+exp, provides a partial solution to this problem. Indeed, weak Königʼs lemma and many of its equivalent formulations from Reverse Mathematics can be ‘pushed down’ into ERNA, while preserving the equivalences, but at the price of replacing equality with ‘≈’, i.e. infinitesimal proximity . The logical (...) principle corresponding to weak Königʼs lemma is the universal transfer principle from Nonstandard Analysis. Here, we consider the intermediate and mean value theorem and their uniform generalizations. We show that ERNAʼs Reverse Mathematics mirrors the situation in classical Reverse Mathematics. This further supports our claim from Sanders [19] that the Reverse Mathematics of ERNA plus universal transfer is a copy up to infinitesimals of that of WKL0. We discuss some of the philosophical implications of our results. (shrink)

The naïve idea of “size” for collections seems to obey both Aristotle’s Principle: “the whole is greater than its parts” and Cantor’s Principle: “1-to-1 correspondences preserve size”. Notoriously, Aristotle’s and Cantor’s principles are incompatible for infinite collections. Cantor’s theory of cardinalities weakens the former principle to “the part is not greater than the whole”, but the outcoming cardinal arithmetic is very unusual. It does not allow for inverse operations, and so there is no direct way of introducing infinitesimal numbers. Here (...) we maintain Aristotle’s principle, instead halving Cantor’s principle to “equinumerous collections are in 1–1 correspondence”. In this way we obtain a very nice arithmetic: in fact, our “numerosities” may be taken to be nonstandard integers. These numerosities appear naturally suited to sets of ordinals, but they depend, for generic sets, on a “labelling” of the universe by ordinals. The problem of finding a canonical way of attaching numerosities to all sets seems to be worth further investigation. (shrink)

A complete list of Finsler, Scott and Boffa sets whose transitive closures contain 1, 2 and 3 elements is given. An algorithm for deciding the identity of hereditarily finite Scott sets is presented. Anti-well-founded sets, i. e., non-well-founded sets whose all maximal ∈-paths are circular, are studied. For example they form transitive inner models of ZFC minus foundation and empty set, and they include uncountably many hereditarily finite awf sets. A complete list of Finsler and Boffa awf sets with 2 (...) and 3 elements in their transitive closure is given. Next the existence of infinite descending ∈-sequences in Aczel universes is shown. Finally a theorem of Ballard and Hrbáček concerning nonstandard Boffa universes of sets is considerably extended. (shrink)

A milestone in Wittgenstein scholarship, this collection of essays ranges over a wide area of the philosopher's thought, presenting divergent interpretations of his fundamental ideas. Different chapters raise many of the central controversies that surround current understanding of the Tractatus, providing an interplay that will be particularly useful to students. Taken together, the essays present a broader and more comprehensive view of Wittgenstein's intellectual interests and his impact on philosophy than may be found elsewhere.The thirteen chapters treat topics from both (...) periods of Wittgenstein's work: More than half are devoted to his early thought, the Tractatus Logico-Philosophicus of 1921, reflecting a growing interest today among philosophers in reexamining this seminal book, while three chapters treat the Philosophical Investigations, published posthumously in 1953. The remaining chapters discuss such "nonstandard" topics as philosophy of religion, aesthetics, and anthropology.Contents: The Early Wittgenstein and the Middle Russell, Kenneth Blackwell; Frege and Wittgenstein, Michael Dummett; Wittgenstein and the Theory of Types, Hide Ishiguro; The So-called Realism of Wittgenstein's Tractatus, Brian McGuinness; The Logical Independence of Elementary Propositions, David Pears; The Rise and Fall of the Picture Theory, Peter Hacker; The Picture Theory and Wittgenstein's Later Attitude to It, Erik Stenius; Wittgenstein's Early Philosophy of Mind, Anthony Kenny; A Theory of Language?, G. E. M. Anscombe; Im Anfang war die Tat, Peter Winch; Wittgenstein's Full Stop, D. Z. Phillips; Quote: Judgments from Our Brain, Paul Ziff; Wittgenstein and the Fire Festivals, Frank Cioffi, Index.Irving Block is Associate Professor in the Philosophy Department at The University of Western Ontario. (shrink)