Cauchy’s contribution to the foundations of analysis is often viewed through the lens of developments that occurred some decades later, namely the formalisation of analysis on the basis of the epsilon-delta doctrine in the context of an Archimedean continuum. What does one see if one refrains from viewing Cauchy as if he had read Weierstrass already? One sees, with Felix Klein, a parallel thread for the development of analysis, in the context of an infinitesimal-enriched continuum. One sees, with Emile Borel, (...) the seeds of the theory of rates of growth of functions as developed by Paul du Bois-Reymond. One sees, with E. G. Björling, an infinitesimal definition of the criterion of uniform convergence. Cauchy’s foundational stance is hereby reconsidered. (shrink)

We prove that the property characterizes Σ‐algebraically compact modules if is not ω‐measurable. Moreover, under a large cardinal assumption, we show that over any ring R where is not ω‐measurable, any free module M of ω‐measurable rank satisfies, hence the assumption on cannot be dropped in general (e.g., over small non‐right perfect rings). In this way, we extend results from a recent paper by Simion Breaz.

Philosophical issues often turn into logic. That is certainly true of Moore’s Paradox, which tends to appear and reappear in many philosophical contexts. There is no doubt that its study belongs to pragmatics rather than semantics or syntax. But it is also true that issues in pragmatics can often be studied fruitfully by attending to their projection, so to speak, onto the levels of semantics or syntax — just in the way that problems in spherical geometry are often illuminated by (...) the study of projections onto a plane. To begin I will describe a potentially vast landscape of logics of a certain form, with some illustrations of how they appear naturally in response to some problems in philosophical logic. Then I will turn Moore’s Paradox into logic, within that landscape, and show how far it can be illuminated therein. (shrink)

Among the problems raised by admitting statements which are neither true nor false is the problem of how we are to cope with vague concepts. One method of dealing with such concepts has been suggested by Rosser/Turquette (1952), i.e. the employment of a many valued set theory. It is our intention in this paper to discuss the use of many valued logics, especially the set theoretical proposals of Zadeh and Brown, in dealing with this problem. Towards this end, we shall (...) pay close attention to the development of the concepts of fuzzy sets and fuzzy systems. In this regard, it will be argued that Zadeh had in mind a many valued logic where the connectives are interpreted according to Lukasiewicz and Tarski, whereas Brown's version may be based upon a Boolean-valued logic. Furthermore, we shall have occasion to distinguish between two sources of imprecision in specifying the membership of classes, i.e. conceptual vagueness and imprecision due to inexact measurement. Due to Suppes' work in this field, the latter sort of imprecision may be exemplified by providing a theory of the inexact measurement of subjective probability. Finally, we shall discuss some ways in which these two types of imprecision are intertwined. (shrink)

There exist two known types of ultrafilter extensions of first-order models, both in a certain sense canonical. One of them comes from modal logic and universal algebra, and in fact goes back to Jónsson and Tarski :891–939, 1951; 74:127–162, 1952). Another one The infinity project proceeding, Barcelona, 2012) comes from model theory and algebra of ultrafilters, with ultrafilter extensions of semigroups as its main precursor. By a classical fact of general topology, the space of ultrafilters over a discrete space is (...) its largest compactification. The main result of Saveliev The infinity project proceeding, Barcelona, 2012), which confirms a canonicity of this extension, generalizes this fact to discrete spaces endowed with an arbitrary first-order structure. An analogous result for the former type of ultrafilter extensions was obtained in Saveliev. Results of such kind are referred to as extension theorems. After a brief introduction, we offer a uniform approach to both types of extensions based on the idea to extend the extension procedure itself. We propose a generalization of the standard concept of first-order interpretations in which functional and relational symbols are interpreted rather by ultrafilters over sets of functions and relations than by functions and relations themselves, and define ultrafilter models with an appropriate semantics for them. We provide two specific operations which turn ultrafilter models into ordinary models, establish necessary and sufficient conditions under which the latter are the two canonical ultrafilter extensions of some ordinary models, and obtain a topological characterization of ultrafilter models. We generalize a restricted version of the extension theorem to ultrafilter models. To formulate the full version, we propose a wider concept of ultrafilter models with their semantics based on limits of ultrafilters, and show that the former concept can be identified, in a certain way, with a particular case of the latter; moreover, the new concept absorbs the ordinary concept of models. We provide two more specific operations which turn ultrafilter models in the narrow sense into ones in the wide sense, and establish necessary and sufficient conditions under which ultrafilter models in the wide sense are the images of ones in the narrow sense under these operations, and also are two canonical ultrafilter extensions of some ordinary models. Finally, we establish three full versions of the extension theorem for ultrafilter models in the wide sense. The results of the first three sections of this paper were partially announced in Poliakov and Saveliev On two concepts of ultrafilter extensions of first-order models and their generalizations, Springer, Berlin, 2017). (shrink)

In this paper, we provide a new characterization of Keisler’s order in terms of saturation of Boolean ultrapowers. To do so, we apply and expand the framework of ‘separation of variables’ recently developed by Malliaris and Shelah. We also show that good ultrafilters on Boolean algebras are precisely the ones which capture the maximum class in Keisler’s order, answering a question posed by Benda in 1974.

The classical Feferman–Vaught Theorem for First Order Logic explains how to compute the truth value of a first order sentence in a generalized product of first order structures by reducing this computation to the computation of truth values of other first order sentences in the factors and evaluation of a monadic second order sentence in the index structure. This technique was later extended by Läuchli, Shelah and Gurevich to monadic second order logic. The technique has wide applications in decidability and (...) definability theory. Here we give a unified presentation, including some new results, of how to use the Feferman–Vaught Theorem, and some new variations thereof, algorithmically in the case of Monadic Second Order Logic MSOL . We then extend the technique to graph polynomials where the range of the summation of the monomials is definable in MSOL . Here the Feferman–Vaught Theorem for these polynomials generalizes well known splitting theorems for graph polynomials. Again, these can be used algorithmically. Finally, we discuss extensions of MSOL for which the Feferman–Vaught Theorem holds as well. (shrink)

For an infinite cardinal K a stronger version of K-distributivity for Boolean algebras, called k-partition completeness, is defined and investigated . It is shown that every k-partition complete Boolean algebra is K-weakly representable, and for strongly inaccessible K these concepts coincide. For regular K ≥ u, it is proved that an atomless K-partition complete Boolean algebra is an updirected union of basic K-tree algebras. Using K-partition completeness, the concept of γ-almost compactness is introduced for γ ≥ K. For strongly inaccessible (...) K we show that K is K-almost compact iff K is weakly compact, and if K is 2K-almost compact, then K is measurable. Further K is strongly compact iff it is γ-almost compact for all γ ≥ K. (shrink)