Using Riemann’s Rearrangement Theorem, Øystein Linnebo (2020) argues that, if it were possible to apply an infinite positive weight and an infinite negative weight to a working scale, the resulting net weight could end up being any real number, depending on the procedure by which these weights are applied. Appealing to the First Postulate of Archimedes’ treatise on balance, I argue instead that the scale would always read 0 kg. Along the way, we stop to consider an infinitely (...) jittery flea, an infinitely protracted border conflict, and an infinitely electric glass rod. (shrink)

The notions of permutable and weak-permutable convergence of a series|$\sum _{n=1}^{\infty }a_{n}$|of real numbers are introduced. Classically, these two notions are equivalent, and, by Riemann’s two main theorems on the convergence of series, a convergent series is permutably convergent if and only if it is absolutely convergent. Working within Bishop-style constructive mathematics, we prove that Ishihara’s principle BD-|$\mathbb {N}$|implies that every permutably convergent series is absolutely convergent. Since there are models of constructive mathematics in which the Riemann permutation theorem (...) for series holds but BD-|$\mathbb{N}$|does not, the best we can hope for as a partial converse to our first theorem is that the absolute convergence of series with a permutability property classically equivalent to that of Riemann implies BD-|$\mathbb {N}$|. We show that this is the case when the property is weak-permutable convergence. (shrink)

In this paper, we introduce systems of nonstandard second-order arithmetic which are conservative extensions of systems of second-order arithmetic. Within these systems, we do reverse mathematics for nonstandard analysis, and we can import techniques of nonstandard analysis into analysis in weak systems of second-order arithmetic. Then, we apply nonstandard techniques to a version of Riemannʼs mapping theorem, and show several different versions of Riemannʼs mapping theorem.

A famous mathematical theorem says that the sum of an infinite series of numbers can depend on the order in which those numbers occur. Suppose we interpret the numbers in such a series as representing instances of some physical quantity, such as the weights of a collection of items. The mathematics seems to lead to the result that the weight of a collection of items can depend on the order in which those items are weighed. But that is very (...) hard to believe. A puzzle then arises: How do we interpret the metaphysical significance of this mathematical theorem? I first argue that prior solutions to the puzzle lead to implausible consequences. Then I develop my own solution, where the basic idea is that the weight of a collection of items is equal to the limit of the weights of its finite subcollections contained within ever-expanding regions of space. I show how my solution is intuitively plausible and philosophically motivated, how it reveals an underexplored line of metaphysical inquiry about quantities and locations, and how it elucidates some classic puzzles concerning supertasks. (shrink)

Ordinarily, the order in which some objects are attached to a scale does not affect the total weight measured by the scale. This principle is shown to fail in certain cases involving infinitely many objects. In these cases, we can produce any desired reading of the scale merely by changing the order in which a fixed collection of objects are attached to the scale. This puzzling phenomenon brings out the metaphysical significance of a theorem about infinite series that is (...) well known by mathematicians but has so far eluded philosophical scrutiny. (shrink)

Gain not only murdered his brother and lied to God, but he also misled many preachers. And while he murdered and lied in a story, he has misled preachers in fact.

This book presents a comprehensive overview of the sum rule approach to spectral analysis of orthogonal polynomials, which derives from Gábor Szego's classic 1915 theorem and its 1920 extension. Barry Simon emphasizes necessary and sufficient conditions, and provides mathematical background that until now has been available only in journals. Topics include background from the theory of meromorphic functions on hyperelliptic surfaces and the study of covering maps of the Riemann sphere with a finite number of slits removed. This allows (...) for the first book-length treatment of orthogonal polynomials for measures supported on a finite number of intervals on the real line. In addition to the Szego and Killip-Simon theorems for orthogonal polynomials on the unit circle and orthogonal polynomials on the real line, Simon covers Toda lattices, the moment problem, and Jacobi operators on the Bethe lattice. Recent work on applications of universality of the CD kernel to obtain detailed asymptotics on the fine structure of the zeros is also included. The book places special emphasis on OPRL, which makes it the essential companion volume to the author's earlier books on OPUC. (shrink)

With Fermat’s Last Theorem finally disposed of by Andrew Wiles in 1994, it’s only natural that popular attention should turn to arguably the most outstanding unsolved problem in mathematics: the Riemann Hypothesis. Unlike Fermat’s Last Theorem, however, the Riemann Hypothesis requires quite a bit of mathematical background to even understand what it says. And of course both require a great deal of background in order to understand their significance. The Riemann Hypothesis was first articulated by Bernhard Riemann in (...) an address to the Berlin Academy in 1859. The address was called “On the Number of Prime Numbers Less Than a Given Quantity” and among the many interesting results and methods contained in that paper was Riemann’s famous hypothesis: all non-trivial zeros of the zeta function, ζ(s) = ∞ n=1 n−s, have real part 1/2. Although the zeta function as stated and considered as a real-valued function is defined only for s > 1, it can be suitably extended. It can, as a matter of fact, be extended to have as its domain all the complex numbers (numbers of the form x + yi, where x and y √ −1) with the exception of 1 + 0i (at which point are real numbers and i =. (shrink)

This paper critically engages Philip Mirowki's essay, "The scientific dimensions of social knowledge and their distant echoes in 20th-century American philosophy of science." It argues that although the cold war context of anti-democratic elitism best suited for making decisions about engaging in nuclear war may seem to be politically and ideologically motivated, in fact we need to carefully consider the arguments underlying the new rational choice based political philosophies of the post-WWII era typified by Arrow's impossibility theorem. A distrust (...) of democratic decision-making principles may be developed by social scientists whose leanings may be toward the left or right side of the spectrum of political practices. (shrink)

A layman's guide to the mechanics of Gödel's proof together with a lucid discussion of the issues which it raises. Includes an essay discussing the significance of Gödel's work in the light of Wittgenstein's criticisms.

This book discusses how rational choice theory grew out of RAND's work for the US Air Force. It concentrates on the work of William J. Riker, Kenneth J. Arrow, James M. Buchanan, Russel Hardin, and John Rawls. It argues that within the context of the US Cold War with its intensive anti-communist and anti-collectivist sentiment, the foundations of capitalist democracy were grounded in the hyper individualist theory of non-cooperative games.

In 1931 the mathematical logician Kurt Godel published a revolutionary paper that challenged certain basic assumptions underpinning mathematics and logic. A colleague of Albert Einstein, his theorem proved that mathematics was partly based on propositions not provable within the mathematical system and had radical implications that have echoed throughout many fields. A gripping combination of science and accessibility, Godel’s Proof by Nagel and Newman is for both mathematicians and the idly curious, offering those with a taste for logic and (...) philosophy the chance to satisfy their intellectual curiosity. (shrink)

Using recent results in topos theory, two systems of higher-order logic are shown to be complete with respect to sheaf models over topological spaces-so-called "topological semantics". The first is classical higher-order logic, with relational quantification of finitely high type; the second system is a predicative fragment thereof with quantification over functions between types, but not over arbitrary relations. The second theorem applies to intuitionistic as well as classical logic.

Charles Chihara's new book develops and defends a structural view of the nature of mathematics, and uses it to explain a number of striking features of mathematics that have puzzled philosophers for centuries. The view is used to show that, in order to understand how mathematical systems are applied in science and everyday life, it is not necessary to assume that its theorems either presuppose mathematical objects or are even true. Chihara builds upon his previous work, in which he presented (...) a new system of mathematics, the constructibility theory, which did not make reference to, or presuppose, mathematical objects. Now he develops the project further by analysing mathematical systems currently used by scientists to show how such systems are compatible with this nominalistic outlook. He advances several new ways of undermining the heavily discussed indispensability argument for the existence of mathematical objects made famous by Willard Quine and Hilary Putnam. And Chihara presents a rationale for the nominalistic outlook that is quite different from those generally put forward, which he maintains have led to serious misunderstandings.A Structural Account of Mathematics will be required reading for anyone working in this field. (shrink)

A set S of degrees is said to be an initial segment if c ≤ d ∈ S→-c∈S. Shoenfield has shown that if P is the lattice of all subsets of a finite set then there is an initial segment of degrees isomorphic to P. Rosenstein [2] (independently) proved the same to hold of the lattice of all finite subsets of a countable set. We shall show that “countable set” may be replaced by “set of cardinality at most that of (...) the continuum.” This result is also an extension of [3, Corollary 2 to Theorem 15], which states that there is a sublattice of degrees isomorphic to the lattice of all finite subsets of 2N. (A sublattice of degrees is a subset closed under ∪ and ∩; an initial segment closed under ∪ is necessarily a sublattice, but not conversely.)It seems worth noting that the proof of the present result was preceded in time by our proof [4] of the analogous theorem for hyperdegrees, and is in fact an adaptation of that proof. Thus the present work has been influenced much more directly by the Gandy-Sacks forcing construction of a minimal hyperdegree [1] than by previous work on initial segments of degrees. (shrink)

Two reports have shown that mammalian artificial chromosomes (MAC) can be constructed from cloned human centromere DNA and telomere repeats, proving the principle that chromosomes can form from naked DNA molecules transfected into human cells. The MACs were mitotically stable, low copy number and bound antibodies associated with active centromeres. As a step toward second-generation MACs, yeast and bacterial cloning systems will have to be adapted to achieve large MAC constructs having a centromere, two telomeres, and genomic copies of mammalian (...) genes. Available construction techniques are discussed along with a new P1 artificial chromosome (PAC)-derived telomere vector (pTAT) that can be joined to other PACs in vitro, avoiding a cloning step during which large repetitive arrays often rearrange. The PAC system can be used as a route to further define the optimal DNA elements required for efficient MAC formation, to investigate the expression of genes on MACs, and possibly to develop efficient MAC-delivery protocols. BioEssays 1999;21:76–83. © 1999 John Wiley & Sons, Inc. (shrink)

The main theorem of this paper is: If ƒ is a partial function from ℵ 1 to ℵ 1 which is ∑ 1 1 -bounded, then there is a weakly finite primitive recursive dilator D such that for all infinite αϵdom , ƒ ⩽ D . The proof involves only elementary combinatorial constructions of trees. A generalization to ptykes is also given.

This is a critical analysis of the first part of Go¨del’s 1951 Gibbs lecture on certain philosophical consequences of the incompleteness theorems. Go¨del’s discussion is framed in terms of a distinction between objective mathematics and subjective mathematics, according to which the former consists of the truths of mathematics in an absolute sense, and the latter consists of all humanly demonstrable truths. The question is whether these coincide; if they do, no formal axiomatic system (or Turing machine) can comprehend the mathematizing (...) potentialities of human thought, and, if not, there are absolutely unsolvable mathematical problems of diophantine form. (shrink)

This book provides an invaluable overview of the reach of logic. It provides reference to some of the most important, well-established results in logic, while at the same time offering insight into the latest research issues in the area. It also has a balance of theory and practice, containing essays in the areas of modal logic, intuitionistic logic, logic and language, nonmonotonic logic and logic programming, temporal logic, logic and learning, combination of logics, practical reasoning, logic and artificial intelligence, abduction, (...) theorem proving and goal-directed reasoning. It will be invaluable reading for researchers and graduate students in logic and computer science, and a fabulous source of inspiration for research students in search of a topic for a PhD in logic and theoretical computer science. (shrink)

Halin in 1965 proved that if a graph has [Formula: see text] many pairwise disjoint rays for each [Formula: see text] then it has infinitely many pairwise disjoint rays. We analyze the complexity of this and other similar results in terms of computable and proof theoretic complexity. The statement of Halin’s theorem and the construction proving it seem very much like standard versions of compactness arguments such as König’s Lemma. Those results, while not computable, are relatively simple. They only (...) use arithmetic procedures or, equivalently, finitely many iterations of the Turing jump. We show that several Halin-type theorems are much more complicated. They are among the theorems of hyperarithmetic analysis. Such theorems imply the ability to iterate the Turing jump along any computable well ordering. Several important logical principles in this class have been extensively studied beginning with work of Kreisel, H. Friedman, Steel and others in the 1960s and 1970s. Until now, only one purely mathematical example was known. Our work provides many more and so answers Question 30 of Montalbán’s Open Questions in Reverse Mathematics in 2011. Some of these theorems including ones in Halin in 1965 are also shown to have unusual proof theoretic strength as well. (shrink)

In a fluent, clear, and lively style this translation by two of Maslov's junior colleagues brings the work of the late Soviet scientist S. Yu. Maslov to a wider audience. Maslov was considered by his peers to be a man of genius who was making fundamental contributions in the fields of automatic theorem proving and computational logic. He published little, and those few papers were regarded as notoriously difficult. This book, however, was written for a broad audience of readers (...) and describes elegant examples of applications in such fields as computer science, artificial intelligence, operations research, economic modeling, and biological modeling, among others. The book also brings to light the work by the American mathematician E. L. Post, which inspired Maslov's own work in the development of a general theory and which has been long neglected by mathematicial logicians and systems theorists in the United States. The book's first chapter introduces the Rules of the Game. Part I, Mathematics of Calculi, covers E. L. Post's canonical systems, deductive systems and algorithms, and probabilistic calculi and deductive information. Part II, Horizonal Modeling, takes up a "toy" economy, the calculi of technological possibilities, and the development of rules. Part III, Vertical Modeling, deals with the topics of "to fight and to search" and the consequences of the asymmetry of cognitive mechanisms. Vladimir Lifschitz is affiliated with the Department of Computer Science at Stanford University, and Michael Gelfond with the Department of Electrical Engineering and Computer Science at the University of Texas, El Paso. Theory of Deductive Systems and Its Applicationsis included in the Foundation of Computing Series, edited by Michael Garey. (shrink)

This fourth edition of one of the classic logic textbooks has been thoroughly revised by John Burgess. The aim is to increase the pedagogical value of the book for the core market of students of philosophy and for students of mathematics and computer science as well. This book has become a classic because of its accessibility to students without a mathematical background, and because it covers not simply the staple topics of an intermediate logic course such as Godel's Incompleteness Theorems, (...) but also a large number of optional topics from Turing's theory of computability to Ramsey's theorem. John Burgess has now enhanced the book by adding a selection of problems at the end of each chapter, and by reorganising and rewriting chapters to make them more independent of each other and thus to increase the range of options available to instructors as to what to cover and what to defer. (shrink)

By indirect-deduction theorems introduced in the present paper we mean the theorems that allow to formalize indirect reasonings occurring in deductive practice in general and in mathematics in particular. We discuss the relationship between the introduced theorems and some logical calculi being virtually confined to propositional calculi with implication and negation. It is worth to notice that the above theorems are very handy and effective in proving logical theses.

Quantum cognition is a new theoretical framework for constructing cognitive models based on the mathematical principles of quantum theory. Due to its increasing empirical success, one wonders what it tells us about the underlying process of cognition. Does it imply that we have quantum minds and there is some sort of quantum structure in the brain? In this paper, I address this important issue by using a new result in the research of quantum foundations. Based on the PBR theorem (...) about the reality of the wave function, I show, given certain assumptions, that the wave function assigned to a cognitive system such as our brain, which is used to calculate probabilities of thoughts/judgment outcomes in quantum cognition, is a real representation of the cognitive state of the system, not a mere representation of incomplete knowledge about the state of the system. This result supports a realist interpretation of quantum cognition, according to which the cognitive state of our brain and its dynamics are not classical but quantum in quantum cognition. In short, quantum cognition implies quantum minds. However, this result does not mean that we have quantum minds and our brain is a quantum computer, since quantum cognition by its standard formulation has not been fully confirmed by experiments. The hope is that more crucial experiments can be done in the near future to determine whether or not quantum cognition is real. (shrink)

George Boolos was one of the most prominent and influential logician-philosophers of recent times. This collection, nearly all chosen by Boolos himself shortly before his death, includes thirty papers on set theory, second-order logic, and plural quantifiers; on Frege, Dedekind, Cantor, and Russell; and on miscellaneous topics in logic and proof theory, including three papers on various aspects of the Gödel theorems. Boolos is universally recognized as the leader in the renewed interest in studies of Frege's work on logic and (...) the philosophy of mathematics. John Burgess has provided introductions to each of the three parts of the volume, and also an afterword on Boolos's technical work in provability logic, which is beyond the scope of this volume. (shrink)

It is demonstrated that a non Abelian Stokes Theorem is necessary to describe the B3 field of radiation. A simple form of the theorem is build up from the fundamental definition of B3 in O(3) gauge field theory, which is a gauge field theory applied to electrodynamics with an O(3) internal gauge symmetry bases on a complex basis ((1), (2), (3)). The indices (1) and (2) are complex conjugate pairs based on circular polarization, and the index (3) is (...) aligned with the propagation axis of radiation. (shrink)

Northern Ireland physicist John Stewart Bell's possible understanding of quantum theory.

Intuitionistic logic is presented here as part of familiar classical logic which allows mechanical extraction of programs from proofs. to make the material more accessible, basic techniques are presented first for propositional logic; Part II contains extensions to predicate logic. This material provides an introduction and a safe background for reading research literature in logic and computer science as well as advanced monographs. Readers are assumed to be familiar with basic notions of first order logic. One device for making this (...) book short was inventing new proofs of several theorems. The presentation is based on natural deduction. The topics include programming interpretation of intuitionistic logic by simply typed lambda-calculus (Curry-Howard isomorphism), negative translation of classical into intuitionistic logic, normalization of natural deductions, applications to category theory, Kripke models, algebraic and topological semantics, proof-search methods, interpolation theorem. The text developed from materal for several courses taught at Stanford University in 1992-1999. (shrink)

We prove the following three theorems on the enumeration degrees of ∑20 sets. Theorem A: There exists a nonzero noncuppable ∑20 enumeration degree. Theorem B: Every nonzero Δ20enumeration degree is cuppable to 0′e by an incomplete total enumeration degree. Theorem C: There exists a nonzero low Δ20 enumeration degree with the anticupping property.

We consider Borel equivalence relations E induced by actions of the infinite symmetric group, or equivalently the isomorphism relation on classes of countable models of bounded Scott rank. We relate the descriptive complexity of the equivalence relation to the nature of its complete invariants. A typical theorem is that E is potentially Π03 iff the invariants are countable sets of reals, it is potentially Π04 iff the invariants are countable sets of countable sets of reals, and so on. The (...) proofs use various techniques, including Vaught transforms, changing topologies, and the Scott analysis of countable models. (shrink)

The quantum probability flux of a particle integrated over time and a distant surface gives the probability for the particle crossing that surface at some time. We prove the free fluxacross-surfaces theorem, which was conjectured by Combes, Newton and Shtokhamer [1], and which relates the integrated quantum flux to the usual quantum mechanical formula for the cross section. The integrated quantum flux is equal to the probability of outward crossings of surfaces by Bohmian trajectories in the scattering regime.

Some sufficient conditions on a Symmetric Monoidal Closed category K are obtained such that a diagram in a free SMC category generated by the set A of atoms commutes if and only if all its interpretations in K are commutative. In particular, the category of vector spaces on any field satisfies these conditions . Instead of diagrams, pairs of derivations in Intuitionistic Multiplicative Linear logic can be considered . Two derivations of the same sequent are equivalent if and only if (...) all their interpretations in K are equal. In fact, the assignment of values to atoms is defined constructively for each pair of derivations. Taking into account a mistake in R. Voreadou's proof of the “abstract coherence theorem” found by the author, it was necessary to modify her description of the class of non-commutative diagrams in SMC categories; our proof of S. Mac Lane conjecture also proves the correctness of the modified description. (shrink)

Using recent results in topos theory, two systems of higher-order logic are shown to be complete with respect to sheaf models over topological spaces- so -called "topological semantics." The first is classical higher-order logic, with relational quantification of finitely high type; the second system is a predicative fragment thereof with quantification over functions between types, but not over arbitrary relations. The second theorem applies to intuitionistic as well as classical logic.