This book presents a new nominalistic philosophy of mathematics: semantic conventionalism. Its central thesis is that mathematics should be founded on the human ability to create language – and specifically, the ability to institute conventions for the truth conditions of sentences. This philosophical stance leads to an alternative way of practicing mathematics: instead of “building” objects out of sets, a mathematician should introduce new syntactical sentence types, together with their truth conditions, as he or she develops a theory. Semantic conventionalism is justified first through criticism of Cantorian set theory, intuitionism, logicism, and predicativism; then on its own terms; and finally, exemplified by a detailed reconstruction of arithmetic and real analysis. Also included is a simple solution to the liar paradox and the other paradoxes that have traditionally been recognized as semantic. And since it is argued that mathematics is semantics, this solution also applies to Russell’s paradox and the other mathematical paradoxes of self-reference. In addition to philosophers who care about the metaphysics and epistemology of mathematics or the paradoxes of self-reference, this book should appeal to mathematicians interested in alternative approaches.

Language and Philosophical Problems investigates problems about mind, meaning and mathematics rooted in preconceptions of language. It deals in particular with problems which are connected with our tendency to be misled by certain prevailing views and preconceptions about language. Philosophical claims made by theorists of meaning are scrutinized and shown to be connected with common views about the nature of certain mathematical notions and methods. Drawing in particular on Wittgenstein's ideas, Sren Stenlund demonstrates a strategy for tracing out and resolving conceptual and philosophical problems. By a critical examination of examples from different areas of philosophy, he shows that many problems arise through the transgression of the limits of the use of technical concepts and formal methods. Many prima facie different kinds of problems are shown to have common roots, and should thus be dealt and resolved together. Such an approach is usually prevented by the influence of traditional philosophical terminology and classification. The results of this investigation make it clear that the received ways of subdividing the subject matter of philosophy often conceal the roots of the problem.

Although many agree that all teaching rests on a theory of knowledge, there has been no in-depth exploration of the implications of the philosophy of mathematics for education. This is Paul Ernest's aim. Building on the work of Lakatos and Wittgenstein it challenges the prevalent notion that mathematical knowledge is certain, absolute and neutral, and offers instead an account of mathematics as a social construction. This has profound educational implications for social issues, including gender, race and multiculturalism; for pedagogy, including investigations and problem solving; and challenges hierarchical views of mathematics, learning and ability. Beyond this, the book offers a well-grounded model of five educational ideologies, each with its own epistemology, values, aims and social group of adherents. An analysis of the impact of these groups on the National Curriculum results in a powerful critique, revealing the questionable assumptions, values and interests upon which it rests. The book finishes on an optimistic note, arguing that pedagogy, left unspecified by the National Curriculum, is the way to achieve the radical aims of educating confident problem posers and solvers who are able to critically evaluate the social uses of mathematics.

The Formal Semantics of Programming Languages provides the basic mathematical techniques necessary for those who are beginning a study of the semantics and logics of programming languages. These techniques will allow students to invent, formalize, and justify rules with which to reason about a variety of programming languages. Although the treatment is elementary, several of the topics covered are drawn from recent research, including the vital area of concurency. The book contains many exercises ranging from simple to miniprojects.Starting with basic set theory, structural operational semantics is introduced as a way to define the meaning of programming languages along with associated proof techniques. Denotational and axiomatic semantics are illustrated on a simple language of while-programs, and fall proofs are given of the equivalence of the operational and denotational semantics and soundness and relative completeness of the axiomatic semantics. A proof of Godel's incompleteness theorem, which emphasizes the impossibility of achieving a fully complete axiomatic semantics, is included. It is supported by an appendix providing an introduction to the theory of computability based on while-programs. Following a presentation of domain theory, the semantics and methods of proof for several functional languages are treated. The simplest language is that of recursion equations with both call-by-value and call-by-name evaluation. This work is extended to lan guages with higher and recursive types, including a treatment of the eager and lazy lambda-calculi. Throughout, the relationship between denotational and operational semantics is stressed, and the proofs of the correspondence between the operation and denotational semantics are provided. The treatment of recursive types - one of the more advanced parts of the book - relies on the use of information systems to represent domains. The book concludes with a chapter on parallel programming languages, accompanied by a discussion of methods for specifying and verifying nondeterministic and parallel programs.

Elementary set theory accustoms the students to mathematical abstraction, includes the standard constructions of relations, functions, and orderings, and leads to a discussion of the various orders of infinity. The material on logic covers not only the standard statement logic and first-order predicate logic but includes an introduction to formal systems, axiomatization, and model theory. The section on algebra is presented with an emphasis on lattices as well as Boolean and Heyting algebras. Background for recent research in natural language semantics includes sections on lambda-abstraction and generalized quantifiers. Chapters on automata theory and formal languages contain a discussion of languages between context-free and context-sensitive and form the background for much current work in syntactic theory and computational linguistics. The many exercises not only reinforce basic skills but offer an entry to linguistic applications of mathematical concepts. For upper-level undergraduate students and graduate students in theoretical linguistics, computer-science students with interests in computational linguistics, logic programming and artificial intelligence, mathematicians and logicians with interests in linguistics and the semantics of natural language.

"This accessible approach to set theory for upper-level undergraduates poses rigorous but simple arguments. Each definition is accompanied by commentary that motivates and explains new concepts. A historical introduction is followed by discussions of classes and sets, functions, natural and cardinal numbers, the arithmetic of ordinal numbers, and related topics. 1971 edition with new material by the author"--