We examine some of Connes’ criticisms of Robinson’s infinitesimals starting in 1995. Connes sought to exploit the Solovay model S as ammunition against non-standard analysis, but the model tends to boomerang, undercutting Connes’ own earlier work in functional analysis. Connes described the hyperreals as both a “virtual theory” and a “chimera”, yet acknowledged that his argument relies on the transfer principle. We analyze Connes’ “dart-throwing” thought experiment, but reach an opposite conclusion. In S , all definable sets of reals are (...) Lebesgue measurable, suggesting that Connes views a theory as being “virtual” if it is not definable in a suitable model of ZFC. If so, Connes’ claim that a theory of the hyperreals is “virtual” is refuted by the existence of a definable model of the hyperreal field due to Kanovei and Shelah. Free ultrafilters aren’t definable, yet Connes exploited such ultrafilters both in his own earlier work on the classification of factors in the 1970s and 80s, and in Noncommutative Geometry, raising the question whether the latter may not be vulnerable to Connes’ criticism of virtuality. We analyze the philosophical underpinnings of Connes’ argument based on Gödel’s incompleteness theorem, and detect an apparent circularity in Connes’ logic. We document the reliance on non-constructive foundational material, and specifically on the Dixmier trace −∫ (featured on the front cover of Connes’ magnum opus) and the Hahn–Banach theorem, in Connes’ own framework. We also note an inaccuracy in Machover’s critique of infinitesimal-based pedagogy. (shrink)

I provide an explicit formulation of empirical adequacy, the central concept of constructive empiricism, and point out a number of problems. Based on one of the inspirations for empirical adequacy, I generalize the notion of a theory to avoid implausible presumptions about the relation of theoretical concepts and observations, and generalize empirical adequacy with the help of approximation sets to allow for lack of knowledge, approximations, and successive gain of knowledge and precision. As a test case, I provide an application (...) of these generalizations to a simple interference phenomenon. (shrink)

This is an introductory survey of the emerging theory of two new classes of (discrete, countable) groups, called hyperlinear and sofic groups. They can be characterized as subgroups of metric ultraproducts of families of, respectively, unitary groups U (n) and symmetric groups $S_{n},\ n\in {\Bbb N}$ . Hyperlinear groups come from theory of operator algebras (Connes' Embedding Problem), while sofic groups, introduced by Gromov, are motivated by a problem of symbolic dynamics (Gottschalk's Surjunctivity Conjecture). Open questions are numerous, in particular (...) it is still unknown if every group is hyperlinear and/or sofic. (shrink)

In this study, several proofs of the compactness theorem for propositional logic with countably many atomic sentences are compared. Thereby some steps are taken towards a systematic philosophical study of the compactness theorem. In addition, some related data and morals for the theory of mathematical explanation are presented.

Syntactic approaches in the philosophy of science, which are based on formalizations in predicate logic, are often considered in principle inferior to semantic approaches, which are based on formalizations with the help of structures. To compare the two kinds of approach, I identify some ambiguities in common semantic accounts and explicate the concept of a structure in a way that avoids hidden references to a specific vocabulary. From there, I argue that contrary to common opinion (i) unintended models do not (...) pose a significant problem for syntactic approaches to scientific theories, (ii) syntactic approaches can be at least as language-independent as semantic ones, and (iii) in syntactic approaches, scientific theories can be as well connected to the world as in semantic ones. Based on these results, I argue that syntactic and semantic approaches fare equally well when it comes to (iv) ease of application, (v) accommodating the use of models in the sciences, and (vi) capturing the theory-observation relation. (shrink)

Comparative constructions form two classes, those that permit direct comparisons (comparisons of measurements as in Seymour is taller than he is wide) and those that only allow indirect comparisons (comparisons of relative positions on separate scales as in Esme is more beautiful than Einstein is intelligent). In contrast with other semantic theories, this paper proposes that the interpretation of the comparative morpheme remains the same whether it appears in sentences that compare individuals directly or indirectly. To develop a unified account, (...) I suggest that all comparisons (whether in terms of height, intelligence or beauty) involve a scale of universal degrees that are isomorphic to the rational (fractional) numbers between 0 and 1. Crucial to a unified treatment, the connection between the individuals being compared and universal degrees involves two steps. First individuals are mapped to a value on a primary scale that ranks individuals with respect to the gradable property (whether it be height, beauty or intelligence). Second, the value on the primary scale is mapped to a universal degree that encodes the value’s relative position on the primary scale. Direct comparison results if measurements such as seven feet participate in the primary scale (as in Seven feet is tall). Otherwise the result is an indirect comparison. (shrink)

In this paper we extend the usual notion of model (asa structure) to the more general notion of CauchySequence of Structures in a similar way as rationalsare extending to real numbers by means of Cauchysequences of rationals. We show that the structurespace St is dense in thecomplete space CSt of Cauchysequences of structures and that CSt is compact in the (topo)logicalsense.

Summary Reporting on the 7th International Congress of Logic, Methodology, and Philosophy of Science, first the main topics and some organisational aspects of the congress are presented; the main part of the report focuses on recent developments in Philosophical Logic (Section 5), in particular the theory of so-called generalized quantifiers as presented at the congress. In addition, some background information on logical language analysis, its possible applications and consequences is provided.

The inverse of the distance between two structures $\mathscr{A} \not\equiv \mathscr{B}$ of finite type τ is naturally measured by the smallest integer q such that a sentence of quantifier rank q - 1 is satisfied by A but not by B. In this way the space $\operatorname{Str}^\tau$ of structures of type τ is equipped with a pseudometric. The induced topology coincides with the elementary topology of $\operatorname{Str}^\tau$ . Using the rudiments of the theory of uniform spaces, in this elementary note (...) we prove the convergence of every Cauchy net of structures, for any type τ. (shrink)

The paper consists of two parts. The first part begins with the problem of whether the original three-valued calculus, invented by J. Łukasiewicz, really conforms to his philosophical and semantic intuitions. I claim that one of the basic semantic assumptions underlying Łukasiewicz's three-valued logic should be that if under any possible circumstances a sentence of the form "X will be the case at time t" is true (resp. false) at time t, then this sentence must be already true (resp. false) (...) at present. However, it is easy to see that this principle is violated in Lukasiewicz's original calculus (as the cases of the law of excluded middle and the law of contradiction show). Nevertheless it is possible to construct (either with the help of the notion of "supervaluation", or purely algebraically) a different three-valued, semi-classical sentential calculus, which would properly incorporate Łukasiewicz's initial intuitions. Algebraically, this calculus has the ordinary Boolean structure, and therefore it retains all classically valid formulas. Yet because possible valuations are no longer represented by ultrafilters, but by filters (not necessarily maximal), the new calculus displays certain non-classical metalogical features (like, for example, nonextensionality and the lack of the metalogical rule enabling one to derive "p is true or q is true" from" 'p ∨ q' is true"). The second part analyses whether the proposed calculus could be useful in formalizing inferences in situations, when for some reason (epistemological or ontological) our knowledge of certain facts is subject to limitation. Special attention should be paid to the possibility of employing this calculus to the case of quantum mechanics. I am going to compare it with standard non-Boolean quantum logic (in the Jauch-Piron approach), and to show that certain shortcomings of the latter can be avoided in the former. For example, I will argue that in order to properly account for quantum features of microphysics, we do not need to drop the law of distributivity. Also the idea of "reading off" the logical structure of propositions from the structure of Hilbert space leads to some conceptual troubles, which I am going to point out. The thesis of the paper is that all we need to speak about quantum reality can be acquired by dropping the principle of bivalence and extensionality, while accepting all classically valid formulas. (shrink)

Classical mereology is a formal theory of the part-whole relation, essentially involving a notion of mereological fusion, or sum. There are various different definitions of fusion in the literature, and various axiomatizations for classical mereology. Though the equivalence of the definitions of fusion is provable from axiom sets, the definitions are not logically equivalent, and, hence, are not inter-changeable when laying down the axioms. We examine the relations between the main definitions of fusion and correct some technical errors in prominent (...) discussions of the axiomatization of mereology. We show the equivalence of four different ways to axiomatize classical mereology, using three different notions of fusion. We also clarify the connection between classical mereology and complete Boolean algebra by giving two "neutral" axiom sets which can be supplemented by one or the other of two simple axioms to yield the full theories; one of these uses a notion of "strong complement" that helps explicate the connections between the theories. (shrink)

Bernard Bolzano (1781–1848) is commonly thought to have attempted to develop a theory of size for infinite collections that follows the so-called part–whole principle, according to which the whole is always greater than any of its proper parts. In this paper, we develop a novel interpretation of Bolzano’s mature theory of the infinite and show that, contrary to mainstream interpretations, it is best understood as a theory of infinite sums. Our formal results show that Bolzano’s infinite sums can be equipped (...) with the rich and original structure of a non-commutative ordered ring, and that Bolzano’s views on the mathematical infinite are, after all, consistent. (shrink)

Toy models are highly idealized and extremely simple models. Although they are omnipresent across scientific disciplines, toy models are a surprisingly under-appreciated subject in the philosophy of science. The main philosophical puzzle regarding toy models concerns what the epistemic goal of toy modelling is. One promising proposal for answering this question is the claim that the epistemic goal of toy models is to provide individual scientists with understanding. The aim of this article is to precisely articulate and to defend this (...) claim. In particular, we will distinguish between autonomous and embedded toy models, and then argue that important examples of autonomous toy models are sometimes best interpreted to provide how-possibly understanding, while embedded toy models yield how-actually understanding, if certain conditions are satisfied. _1_ Introduction _2_ Embedded and Autonomous Toy Models _2.1_ Embedded toy models _2.2_ Autonomous toy models _2.3_ Qualification _3_ A Theory of Understanding for Toy Models _3.1_ Preliminaries and requirements _3.2_ The refined simple view _4_ Two Kinds of Understanding with Toy Models _4.1_ Embedded toy models and how-actually understanding _4.2_ Against a how-actually interpretation of all autonomous toy models _4.3_ The how-possibly interpretation of some autonomous toy models _5_ Conclusion. (shrink)

Many authors have noted that there are types of English modal sentences cannot be formalized in the language of basic first-order modal logic. Some widely discussed examples include “There could have been things other than there actually are” and “Everyone who is actually rich could have been poor.” In response to this lack of expressive power, many authors have discussed extensions of first-order modal logic with two-dimensional operators. But claims about the relative expressive power of these extensions are often justified (...) only by example rather than by rigorous proof. In this paper, we provide proofs of many of these claims and present a more complete picture of the expressive landscape for such languages. (shrink)

The debate between critics of syntactic and semantic approaches to the formalization of scientific theories has been going on for over 50 years. I structure the debate in light of a recent exchange between Hans Halvorson, Clark Glymour, and Bas van Fraassen and argue that the only remaining disagreement concerns the alleged difference in the dependence of syntactic and semantic approaches on languages of predicate logic. This difference turns out to be illusory.

This paper concerns voting with logical consequences, which means that anybody voting for an alternative x should vote for the logical consequences of x as well. Similarly, the social choice set is also supposed to be closed under logical consequences. The central result of the paper is that, given a set of fairly natural conditions, the only social choice functions that satisfy social logical closure are oligarchic (where a subset of the voters are decisive for the social choice). The set (...) of conditions needed for the proof include a version of Independence of Irrelevant Alternatives that also plays a central role in Arrow's impossibility theorem. (Published Online July 11 2006) Footnotes1 Much of this article was written while the author was a fellow at the Swedish Collegium for Advanced Study in the Social Sciences (SCASSS) in Uppsala. I want to thank the Collegium for providing me with excellent working conditions. Wlodek Rabinowicz and other fellows gave me valuable comments at a seminar at SCASSS when an early version of the paper was presented. I also want to thank Luc Bovens, Franz Dietrich, Christian List and an anonymous referee for their excellent comments on a later version. The final version was prepared during a stay at Oxford University for which I am grateful to the British Academy. (shrink)

Toy models are highly idealized and extremely simple models. Although they are omnipresent across scientific disciplines, toy models are a surprisingly under-appreciated subject in the philosophy of science. The main philosophical puzzle regarding toy models is that it is an unsettled question what the epistemic goal of toy modeling is. One promising proposal for answering this question is the claim that the epistemic goal of toy models is to provide individual scientists with understanding. The aim of this paper is to (...) precisely articulate and to defend this claim. In particular, we will distinguish between autonomous and embedded toy models, and, then, argue that important examples of autonomous toy models are sometimes best interpreted to provide how-possibly understanding, while embedded toy models yield how-actually understanding, if certain conditions are satisfied. (shrink)

One of the main problems of the orthoframe approach to quantum logic was that orthomodularity could not be captured by any first-order condition. This paper studies an elementary and natural class of orthomodular frames that can work around this limitation. Set-theoretically, the frames we propose form a natural subclass of the orthoframes, where is an irreflexive and symmetric relation on X. More specifically, they are partially-ordered orthoframes with a designated subset. Our frame class contains the canonical orthomodular frame of the (...) logic and therefore characterises orthomodular quantum logic. To prove soundness, a further restriction is placed on admissible valuations which requires that they be point-generated in addition to the requirement that they return stable sets. (shrink)

This paper examines the question of the extensional correctness of Tarskian definitions of logical truth and logical consequence. I identify a few different informal properties which are necessary for a sentence to be an informal logical truth and look at whether they are necessary properties of Tarskian logical truths. I examine arguments by John Etchemendy and Vann McGee to the effect that some of those properties are not necessary properties of some Tarskian logical truths, and find them unconvincing. I stress (...) the point that since the hypothesis that Tarski's definitions are extensionally correct is deeply entrenched, the burden of proof is still on the shoulders of Tarski's critics, who have not lifted the burden. (shrink)

The centrality of the whole/part relation in mathematics is demonstrated through the presentation and analysis of examples from algebra, geometry, functional analysis,logic, topology and category theory.

A many-valued sentential logic with truth values in an injective MV-algebra is introduced and the axiomatizability of this logic is proved. The paper develops some ideas of Goguen and generalizes the results of Pavelka on the unit interval. The proof for completeness is purely algebraic. A corollary of the Completeness Theorem is that fuzzy logic on the unit interval is semantically complete if and only if the algebra of the truth values is a complete MV-algebra. In the well-defined fuzzy sentential (...) logic holds the Compactness Theorem, while the Deduction Theorem and the Finiteness Theorem in general do not hold. Because of its generality and good-behaviour, MV-valued logic can be regarded as a mathematical basis of fuzzy reasoning. (shrink)

Two cardinals are said to beindistinguishableif there is no sentence of second order logic which discriminates between them. This notion, which is defined precisely below, is closely related to that ofcharacterizablecardinals, introduced and studied by Garland in [3]. In this paper we give an algebraic criterion for two cardinals to be indistinguishable. As a consequence we obtain a straightforward proof of an interesting theorem about characterizable cardinals due to Zykov [6].

In connection with the work of Anscombe, Macpherson, Steinhorn and the present author in [1] we investigate the notion of a multidimensional exact class (R-mec), a special kind of multidimensional asymptotic class (R-mac) with measuring functions that yield the exact sizes of definable sets, not just approximations. We use results about smooth approximation [24] and Lie coordinatization [13] to prove the following result (Theorem 4.6.4), as conjectured by Macpherson: For any countable language$\mathcal {L}$and any positive integerdthe class$\mathcal {C}(\mathcal {L},d)$of all (...) finite$\mathcal {L}$-structures with at mostd4-types is a polynomial exact class in$\mathcal {L}$, where a polynomial exact class is a multidimensional exact class with polynomial measuring functions. (shrink)

We prove strong completeness results for some modal logics with the universal modality, with respect to their topological semantics over 0-dimensional dense-in-themselves metric spaces. We also use failure of compactness to show that, for some languages and spaces, no standard modal deductive system is strongly complete.

Bernard Bolzano (1781–1848) is commonly thought to have attempted to develop a theory of size for infinite collections that follows the so-called part–whole principle, according to which the whole is always greater than any of its proper parts. In this paper, we develop a novel interpretation of Bolzano’s mature theory of the infinite and show that, contrary to mainstream interpretations, it is best understood as a theory of infinite sums. Our formal results show that Bolzano’s infinite sums can be equipped (...) with the rich and original structure of a non-commutative ordered ring, and that Bolzano’s views on the mathematical infinite are, after all, consistent. (shrink)

It is well known that the convex hull of the classical truth value functions contains all and only the probability functions. Work by Paris and Williams has shown that this also holds for various kinds of nonclassical logics too. This note summarises the formal details of this topic and extends the results slightly.

Following Lauwers and Van Liedekerke (1995), this paper explores in a model-theoretic framework the relation between Arrovian aggregation rules and ultraproducts, in order to investigate a source of impossibility results for the case of an infinite number of individuals and an aggregation rule based on a free ultrafilter of decisive coalitions.

We introduce a logic for a class of probabilistic Kripke structures that we call type structures, as they are inspired by Harsanyi type spaces. The latter structures are used in theoretical economics and game theory. A strong completeness theorem for an associated infinitary propositional logic with probabilistic operators was proved by Meier. By simplifying Meier’s proof, we prove that our logic is strongly complete with respect to the class of type structures. In order to do that, we define a canonical (...) model (in the sense of modal logics), which turns out to be a terminal object in a suitable category. Furthermore, we extend some standard model-theoretic constructions to type structures and we prove analogues of first-order results for those constructions. (shrink)

We prove, in ZFC alone, some new results on regularity and decomposability of ultrafilters; among them: If m ≥ 1 and the ultrafilter D is , equation imagem)-regular, then D is κ -decomposable for some κ with λ ≤ κ ≤ 2λ ). If λ is a strong limit cardinal and D is , equation imagem)-regular, then either D is -regular or there are arbitrarily large κ < λ for which D is κ -decomposable ). Suppose that λ is singular, (...) λ < κ, cf κ ≠ cf λ and D is -regular. Then: D is either -regular, or -regular for some λ' < λ . If κ is regular, then D is either -regular, or -regular for every κ' < κ . If either λ is a strong limit cardinal and λ<λ < 2κ, or λ<λ < κ, then D is either λ -decomposable, or -regular for some λ' < λ . If λ is singular, D is -regular and there are arbitrarily large ν < λ for which D is ν -decomposable, then D is κ -decomposable for some κ with λ ≤ κ ≤ λ<μ . D × D' is -regular if and only if there is a ν such that D is -regular and D' is -regular for all ν∼ < ν .We also list some problems, and furnish applications to topological spaces and to extended logics. (shrink)

The paper establishes the general structure of the inconsistent models of arithmetic of [7]. It is shown that such models are constituted by a sequence of nuclei. The nuclei fall into three segments: the first contains improper nuclei: the second contains proper nuclei with linear chromosomes: the third contains proper nuclei with cyclical chromosomes. The nuclei have periods which are inherited up the ordering. It is also shown that the improper nuclei can have the order type of any ordinal. of (...) the nationals. or of any other order type that can be embedded in the rationals in a certain way. (shrink)

It is well‐known that the theory of algebraically closed fields is not finitely axiomatizable. In this note, we prove that the theory of integrally closed integral domains is also not finitely axiomatizable.

John Crossley settled in Australia in 1968 having been a graduate student and later University Lecturer at Oxford. This is a brief account of his logical career. It is a revised version of a webcast talk for World Logic Day on 14 January 2022.

We discuss the existence of universal spaces (either in the sense of embeddings or continuous images) for some classes of scattered Eberlein compacta. Given a cardinal κ, we consider the class Sκ of all scattered Eberlein compact spaces K of weight ≤ κ and such that the second Cantor-Bendixson derivative of K is a singleton. We prove that if κ is an uncountable cardinal such that κ = 2<κ, then there exists a space X in Sκ such that every member (...) of Sκ is homeomorphic to a retract of X. We show that it is consistent that there does not exist a universal space (either by embeddings or by mappings onto) in Sω₁. Assuming that ∂ = ω₁, we prove that there exists a space X ∈ Sω₁, which is universal in the sense of embeddings. We also show that it is consistent that there exists a space X ∈ Sω₁, universal in the sense of embeddings, but Sω₁ does not contain an universal element in the sense of mappings onto. (shrink)

Here we prove the existence of sheaf cohomology theory in arbitrary o-minimal structures.