Leon Horsten

This article discusses Peter Galison's views on the structure and evolution of experimental and instrumental cultures in 20th century particle physics, which are unfolded in his recent book Image and Logic. A Material Culture of Microphysics. First a description is given of the uncomfortable predicament in which the Kuhnian tradition finds itself in the past two decades. It is then explained how Galison distinguishes a layered structure in the practice of modern particle physics. Physics as a practice consists of three relatively autonomous levels: the experimental level, the instrumental level and the theoretical level. This paper focuses mainly (but not exclusively) on the instrumental level in particle physics. Subsequently an analysis is given of Galison's metaphor of the wall, which Galison offers as an alternative to the Kuhnian image of paradigms and scientific revolutions. Galison's model is also compared with Laudan's reticulational model of the evolution of scientific research traditions. To conclude, an analysis is made of Galison's attempt to solve the incommensurability problem

We investigate axiomatizations of Kripke's theory of truth based on the Strong Kleene evaluation scheme for treating sentences lacking a truth value. Feferman's axiomatization KF formulated in classical logic is an indirect approach, because it is not sound with respect to Kripke's semantics in the straightforward sense: only the sentences that can be proved to be true in KF are valid in Kripke's partial models. Reinhardt proposed to focus just on the sentences that can be proved to be true in KF and conjectured that the detour through classical logic in KF is dispensable. We refute Reinhardt's Conjecture, and provide a direct axiomatization PKF of Kripke's theory in partial logic. We argue that any natural axiomatization of Kripke's theory in Strong Kleene logic has the same proof-theoretic strength as PKF, namely the strength of the system RA&lt ωω ramified analysis or a system of Tarskian ramified truth up to ωω. Thus any such axiomatization is much weaker than Feferman's axiomatization KF in classical logic, which is equivalent to the system RA&ltε₀ of ramified analysis up to ε₀

There are two perspectives from which formal theories can be viewed. On the one hand, one can take a theory to be about some privileged models. On the other hand, one can take all models of a theory to be on a par. In contrast with what is usually done in philosophical debates, we adopt the latter viewpoint. Suppose that from this perspective we want to add an adequate truth predicate to a background theory. Then on the one hand the truth theory ought to be semantically conservative over the background theory. At the same time, it is generally recognised that the central function of a truth predicate is an expressive one. A truth predicate ought to allow us to express propositions that we could not express before. In this article we argue that there are indeed natural truth theories which satisfy both the demand of semantical conservativeness and the demand of adequately extending the expressive power of our language.

In this paper, a general perspective on criteria of identity of kinds of objects is developed. The question of the admissibility of impredicative or circular identity criteria is investigated in the light of the view that is articulated. It is argued that in and of itself impredicativity does not constitute sufficient grounds for rejecting a putative identity criterion. The view that is presented is applied to Davidson’s criterion of identity for events and to the structuralist criterion of identity of places in a structure.

In his Gibbs lecture, Gödel argued for the thesis that either the human mind is not a Turing machine, or there exist absolutely undecidable mathematical propositions. He believed that this disjunction can be deduced with mathematical certainty from certain results in mathematical logic. He thought that his disjunctive thesis is of great philosophical importance. First, Gödel's argument for his disjunctive thesis is discussed. It is argued that thisargument contains an ambiguity. But when it is made precise in a certain way, the argument is seen to be ultimately inescapable. Second, the disjuncts of the thesis are considered in their own right. It is argued that there are today no convincing arguments in favor of the first disjunct, nor are there at present convincing arguments against it. But there do exist today strong reasons to believe the second disjunct to be true, although these reasons do not establish the disjunct with anything like mathematical certainty

This paper investigates the role of pictures in mathematics in the particular case of Cayley graphs—the graphic representations of groups. I shall argue that their principal function in that theory—to provide insight into the abstract structure of groups—is performed employing their visual aspect. I suggest that the application of a visual graph theory in the purely non-visual theory of groups resulted in a new effective approach in which pictures have an essential role. Cayley graphs were initially developed as exact mathematical constructions. Therefore, they are legitimate components of the theory and the pictures of Cayley graphs are a part of practical mathematical procedures.

In this contribution, we focus on probabilistic problems with a denumerably or non-denumerably infinite number of possible outcomes. Kolmogorov (1933) provided an axiomatic basis for probability theory, presented as a part of measure theory, which is a branch of standard analysis or calculus. Since standard analysis does not allow for non-Archimedean quantities (i.e. infinitesimals), we may call Kolmogorov's approach "Archimedean probability theory". We show that allowing non-Archimedean probability values may have considerable epistemological advantages in the infinite case. The current paper focuses on the motivation for our new axiomatization.

Given any finite graph, which transitive graphs approximate it most closely and how fast can we find them? The answer to this question depends on the concept of “closest approximation” involved. In [8,9] a qualitative concept of best approximation is formulated. Roughly, a qualitatively best transitive approximation of a graph is a transitive graph which cannot be “improved” without also going against the original graph. A quantitative concept of best approximation goes back at least to [10]. A quantitatively best transitive approximation is a transitive graph that makes the minimal number of mistakes against the original graph. In other words, the sum of the edges that are removed from and are added to the original graph is minimal.

According to structuralism in philosophy of mathematics, arithmetic is about a single structure. First-order theories are satisfied by models that do not instantiate this structure. Proponents of structuralism have put forward various accounts of how we succeed in fixing one single structure as the intended interpretation of our arithmetical language. We shall look at a proposal that involves Tennenbaum's theorem, which says that any model with addition and multiplication as recursive operations is isomorphic to the standard model of arithmetic. On this account, the intended models of arithmetic are the notation systems with recursive operations on them satisfying the Peano axioms. [A]m Anfang […] ist das Zeichen.