Two ways of describing a group are considered. 1. A group is finite-automaton presentable if its elements can be represented by strings over a finite alphabet, in such a way that the set of representing strings and the group operation can be recognized by finite automata. 2. An infinite f.g. group is quasi-finitely axiomatizable if there is a description consisting of a single first-order sentence, together with the information that the group is finitely generated. In the first part of the (...) paper we survey examples of FA-presentable groups, but also discuss theorems restricting this class. In the second part, we give examples of quasi-finitely axiomatizable groups, consider the algebraic content of the notion, and compare it to the notion of a group which is a prime model. We also show that if a structure is bi-interpretable in parameters with the ring of integers, then it is prime and quasi-finitely axiomatizable. (shrink)

Here, Bob Hale and Crispin Wright assemble the key writings that lead to their distinctive neo-Fregean approach to the philosophy of mathematics. In addition to fourteen previously published papers, the volume features a new paper on the Julius Caesar problem; a substantial new introduction mapping out the program and the contributions made to it by the various papers; a section explaining which issues most require further attention; and bibliographies of references and further useful sources. It will be recognized as the (...) most powerful presentation yet of a neo-Fregean program. (shrink)

The second volume in the _Blackwell Brown Lectures in Philosophy_, this volume offers an original and provocative take on the nature and methodology of philosophy. Based on public lectures at Brown University, given by the pre-eminent philosopher, Timothy Williamson Rejects the ideology of the 'linguistic turn', the most distinctive trend of 20th century philosophy Explains the method of philosophy as a development from non-philosophical ways of thinking Suggests new ways of understanding what contemporary and past philosophers are doing.

The book begins with an overview that introduces the Theorem and the issues surrounding it, and explores how the essays that follow contribute to our understanding of those issues.

In Frege's Conception of Logic Patricia A. Blanchette explores the relationship between Gottlob Frege's understanding of conceptual analysis and his understanding of logic.

Stephen George Simpson. with definition 1.2.3 and the discussion following it. For example, taking 90(n) to be the formula n §E Y, we have an instance of comprehension, VYEIXVn(n€X<—>n¢Y), asserting that for any given set Y there exists a ...

Charles Parsons examines the notion of object, with the aim to navigate between nominalism, denying that distinctively mathematical objects exist, and forms of Platonism that postulate a transcendent realm of such objects. He introduces the central mathematical notion of structure and defends a version of the structuralist view of mathematical objects, according to which their existence is relative to a structure and they have no more of a 'nature' than that confers on them. Parsons also analyzes the concept of intuition (...) and presents a conception of it distantly inspired by that of Kant, which describes a basic kind of access to abstract objects and an element of a first conception of the infinite. (shrink)

While Frege’s own attempt to provide a purely logical foundation for arithmetic failed, Hume’s principle suffices as a foundation for elementary arithmetic. It is known that the resulting system is consistent—or at least if second-order arithmetic is. Some philosophers deny that HP can be regarded as either a truth of logic or as analytic in any reasonable sense. Others—like Crispin Wright and I—take the opposed view. Rather than defend our claim that HP is a conceptual truth about numbers, I explain (...) one way it may be possible to extend our view beyond elementary arithmetic to encompass the theory of real numbers. My approach has affinities to the leading ideas of Frege’s own treatment of the reals, although differing in one fundamental way. I attempt, like the HP approach to elementary arithmetic, to obtain the reals very directly by means of abstraction principles without any essential reliance on a theory of sets. This is the most natural way of extending the neo-Fregean position to the reals. (shrink)

Richard G. Heck, On the Philosophical Significance of Frege's Theorem. Language, Thought, and Logic, Essays in Honour of Michael Dummett.George Boolos, Is Hume's Principle Analytic?.Charles Parsons, Wright onion and Set Theory.Richard G. Heck, The Julius Caesar Objection.

The paper formulates and proves a strengthening of 'Frege's Theorem', which states that axioms for second-order arithmetic are derivable in second-order logic from Hume's Principle, which itself says that the number of Fs is the same as the number of Gs just in case the Fs and Gs are equinumerous. The improvement consists in restricting this claim to finite concepts, so that nothing is claimed about the circumstances under which infinite concepts have the same number. 'Finite Hume's Principle' also suffices (...) for the derivation of axioms for arithmetic and, indeed, is equivalent to a version of them, in the presence of Frege's definitions of the primitive expressions of the language of arithmetic. The philosophical significance of this result is also discussed. (shrink)