The book proposes that Foucault's archaeology is a direct response to the predicament for thought in modernity that he described in the closing chapters of The Order of Things, and that science and mathematics are fundamental to the possibility of this response. Centered around the figure of man, Foucault described thinking in modernity as split between empirical and transcendental forms of enquiry, neither of which is able to secure a foundation. To understand how Foucault responds to this situation, the book (...) sets out a series of key ideas in the work of Gaston Bachelard, Jean Cavaillès, and Michel Serres that pave the way for Foucault's account of the historical character of the formal conditions of knowledge. In this way, Foucault's conception of discourse, and above all of the historical a priori, can be understood against the background of what he calls the mathematical a priori. The book also provides an analysis of what Foucault calls ‘temporal dispersion’, tracing this idea back to his critique of Kant. Employing these ideas, the book goes on to provide a detailed commentary on Foucault's The Archaeology of Knowledge. (shrink)

Puts The Archaeology of Knowledge at the heart of Foucault's thoughtDavid Webb reveals the extent to which Foucault's approach to language in The Archaeology of Knowledge was influenced by the mathematical sciences, adopting a mode of thought indebted to thinkers in the scientific and epistemological traditions. By aligning his thought with the challenge to Kantian philosophy from mathematics and science in the late-19th and early-20th centuries, he shows how Foucault established his own perspective on the future of critical (...) philosophy. (shrink)

Logic has pride of place in mathematics and its 20th century offshoot, computer science. Modern symbolic logic was developed, in part, as a way to provide a formal framework for mathematics: Frege, Peano, Whitehead and Russell, as well as Hilbert developed systems of logic to formalize mathematics. These systems were meant to serve either as themselves foundational, or at least as formal analogs of mathematical reasoning amenable to mathematical study, e.g., in Hilbert’s consistency program. Similar efforts continue, but (...) have been expanded by the development of sophisticated methods to study the properties of such systems using proof and model theory. In parallel with this evolution of logical formalisms as tools for articulating mathematical theories (broadly speaking), much progress has been made in the quest for a mechanization of logical inference and the investigation of its theoretical limits, culminating recently in the development of new foundational frameworks for mathematics with sophisticated computer-assisted proof systems. In addition, logical formalisms developed by logicians in mathematical and philosophical contexts have proved immensely useful in describing theories and systems of interest to computer scientists, and to some degree, vice versa. Three examples of the influence of logic in computer science are automated reasoning, computer verification, and type systems for programming languages. (shrink)

One of the most important contributions of A. Church to logic is his invention of the lambda calculus. We present the genesis of this theory and its two major areas of application: the representation of computations and the resulting functional programming languages on the one hand and the representation of reasoning and the resulting systems of computer mathematics on the other hand.

Ranging from Alan Turing’s seminal 1936 paper to the latest work on Kolmogorov complexity and linear logic, this comprehensive new work clarifies the relationship between computability on the one hand and constructivity on the other. The authors argue that even though constructivists have largely shed Brouwer’s solipsistic attitude to logic, there remain points of disagreement to this day. Focusing on the growing pains computability experienced as it was forced to address the demands of rapidly expanding applications, the content maps the (...) developments following Turing’s ground-breaking linkage of computation and the machine, the resulting birth of complexity theory, the innovations of Kolmogorov complexity and resolving the dissonances between proof theoretical semantics and canonical proof feasibility. Finally, it explores one of the most fundamental questions concerning the interface between constructivity and computability: whether the theory of recursive functions is needed for a rigorous development of constructive mathematics. This volume contributes to the unity of science by overcoming disunities rather than offering an overarching framework. It posits that computability’s adoption of a classical, ontological point of view kept these imperatives separated. In studying the relationship between the two, it is a vital step forward in overcoming the disagreements and misunderstandings which stand in the way of a unifying view of logic. (shrink)

This volume on the semantic complexity of natural language explores the question why some sentences are more difficult than others. While doing so, it lays the groundwork for extending semantic theory with computational and cognitive aspects by combining linguistics and logic with computations and cognition. -/- Quantifier expressions occur whenever we describe the world and communicate about it. Generalized quantifier theory is therefore one of the basic tools of linguistics today, studying the possible meanings and the inferential power of (...) quantifier expressions by logical means. The classic version was developed in the 1980s, at the interface of linguistics, mathematics and philosophy. Before this volume, advances in "classic" generalized quantifier theory mainly focused on logical questions and their applications to linguistics, this volume adds a computational component, the third pillar of language use and logical activity. This book is essential reading for researchers in linguistics, philosophy, cognitive science, logic, AI, and computer science. (shrink)

The simulation hypothesis has recently excited renewed interest, especially in the physics and philosophy communities. However, the hypothesis specifically concerns {computers} that simulate physical universes, which means that to properly investigate it we need to couple computer science theory with physics. Here I do this by exploiting the physical Church-Turing thesis. This allows me to introduce a preliminary investigation of some of the computer science theoretic aspects of the simulation hypothesis. In particular, building on Kleene's second recursion theorem, I prove (...) that it is mathematically possible for us to be in a simulation that is being run on a computer \textit{by us}. In such a case, there would be two identical instances of us; the question of which of those is ``really us'' is meaningless. I also show how Rice's theorem provides some interesting impossibility results concerning simulation and self-simulation; briefly describe the philosophical implications of fully homomorphic encryption for (self-)simulation; briefly investigate the graphical structure of universes simulating universes simulating universes, among other issues. I end by describing some of the possible avenues for future research that this preliminary investigation reveals. (shrink)

This much-needed book provides a thorough account of temporal logic, one of the most important areas of logic in computer science today. The book begins with a solid introduction to semantical and axiomatic approaches to temporal logic. It goes on to cover predicate temporal logic, meta-languages, general theories of axiomatization, many dimensional systems, propositional quantifiers, expressive power, Henkin dimension, temporalization of other logics, and decidability results. With its inclusion of cutting-edge results and unifying methodologies, this book is an indispensable reference (...) for both the pure logician and the theoretical computer scientist. (shrink)

This Handbook is a combination of authoritative exposition, comprehensive survey, and fundamental research exploring the underlying unifying themes in the various areas. The intended audience is graduate students and researchers in the areas of computing and logic, as well as other people interested in the subject. We assume as background some mathematical sophistication. Much of the material will also be of interest to logicians and mathematicians.

Many books explain what is known about the universe. This book investigates what cannot be known. Rather than exploring the amazing facts that science, mathematics, and reason have revealed to us, this work studies what science, mathematics, and reason tell us cannot be revealed. In The Outer Limits of Reason, Noson Yanofsky considers what cannot be predicted, described, or known, and what will never be understood. He discusses the limitations of computers, physics, logic, and our own thought processes. Yanofsky describes (...) simple tasks that would take computers trillions of centuries to complete and other problems that computers can never solve; perfectly formed English sentences that make no sense; different levels of infinity; the bizarre world of the quantum; the relevance of relativity theory; the causes of chaos theory; math problems that cannot be solved by normal means; and statements that are true but cannot be proven. He explains the limitations of our intuitions about the world -- our ideas about space, time, and motion, and the complex relationship between the knower and the known. Moving from the concrete to the abstract, from problems of everyday language to straightforward philosophical questions to the formalities of physics and mathematics, Yanofsky demonstrates a myriad of unsolvable problems and paradoxes. Exploring the various limitations of our knowledge, he shows that many of these limitations have a similar pattern and that by investigating these patterns, we can better understand the structure and limitations of reason itself. Yanofsky even attempts to look beyond the borders of reason to see what, if anything, is out there. (shrink)

The present volume stems from a book-proposal made about two years ago to College Publications, London. The main idea was that of illustrating the interplay between the contemporary work in logic and the mainstream mathematics. The division of the volume in two sections - topics in 'logic' vs topics in 'computing' - is more or less conventional. Some contributions are focussed on historical and technical details meant to put in perspective the impact of the work of some outstanding mathematicians (...) and philosophers on the contemporary research in logic and computing science. Some other papers, also with a historical flavour, were supposed to evidentiate punctual methods of research and specific concepts or topics, as, e.g., decidability, computability, randomness, and computational or descriptive complexity. In general, the papers were intended as specific surveys of results. Other volumes - to be issued subsequently in the same series - will hopefully delineate aspects of the contemporary logic landscape that have not been illustrated here. The intended audience of the book includes graduate students in mathematical logic, foundations of matematics, and computing science, as well as philosophers, mathematicians, and, possibly, other scientists interested in the recent research on logic and computing. (shrink)

Climatology is a paradigmatic complex systems science. Understanding the global climate involves tackling problems in physics, chemistry, economics, and many other disciplines. I argue that complex systems like the global climate are characterized by certain dynamical features that explain how those systems change over time. A complex system's dynamics are shaped by the interaction of many different components operating at many different temporal and spatial scales. Examining the multidisciplinary and holistic methods of climatology can help us better understand the nature (...) of complex systems in general. -/- Questions surrounding climate science can be divided into three rough categories: foundational, methodological, and evaluative questions. "How do we know that we can trust science?" is a paradigmatic foundational question (and a surprisingly difficult one to answer). Because the global climate is so complex, questions like "what makes a system complex?" also fall into this category. There are a number of existing definitions of `complexity,' and while all of them capture some aspects of what makes intuitively complex systems distinctive, none is entirely satisfactory. Most existing accounts of complexity have been developed to work with information-theoretic objects (signals, for instance) rather than the physical and social systems studied by scientists. -/- Dynamical complexity, a concept articulated in detail in the first third of the dissertation, is designed to bridge the gap between the mathematics of contemporary complexity theory (in particular the formalism of "effective complexity" developed by Gell-Mann and Lloyd [2003]) and a more general account of the structure of science generally. Dynamical complexity provides a physical interpretation of the formal tools of mathematical complexity theory, and thus can be used as a framework for thinking about general problems in the philosophy of science, including theories, explanation, and lawhood. -/- Methodological questions include questions about how climate science constructs its models, on what basis we trust those models, and how we might improve those models. In order to answer questions about climate modeling, it's important to understand what climate models look like and how they are constructed. Climate model families are significantly more diverse than are the model families of most other sciences (even sciences that study other complex systems). Existing climate models range from basic models that can be solved on paper to staggeringly complicated models that can only be analyzed using the most advanced supercomputers in the world. I introduce some of the central concepts in climatology by demonstrating how one of the most basic climate models might be constructed. I begin with the assumption that the Earth is a simple featureless blackbody which receives energy from the sun and releases it into space, and show how to model that assumption formally. I then gradually add other factors (e.g. albedo and the greenhouse effect) to the model, and show how each addition brings the model's prediction closer to agreement with observation. After constructing this basic model, I describe the so-called "complexity hierarchy" of the rest of climate models, and argue that the sense of "complexity" used in the climate modeling community is related to dynamical complexity. -/- With a clear understanding of the basics of climate modeling in hand, I then argue that foundational issues discussed early in the dissertation suggest that computation plays an irrevocably central role in climate modeling. "Science by simulation" is essential given the complexity of the global climate, but features of the climate system--the presence of non-linearities, feedback loops, and chaotic dynamics--put principled limits on the effectiveness of computational models. This tension is at the root of the staggering pluralism of the climate model hierarchy, and suggests that such pluralism is here to stay, rather than an artifact of our ignorance. Rather than attempting to converge on a single "best fit" climate model, we ought to embrace the diversity of climate models, and view each as a specialized tool designed to predict and explain a rather narrow range of phenomena. Understanding the climate system as a whole requires examining a number of different models, and correlating their outputs. This is the most significant methodological challenge of climatology. -/- Climatology's role contemporary political discourse raises an unusually high number of evaluative questions for a physical science. The two leading approaches to crafting policy surrounding climate change center on mitigation (i.e. stopping the changes from occurring) and adaptation (making post hoc changes to ameliorate the harm caused by those changes). Crafting an effective socio-political response to the threat of anthropogenic climate change, however, requires us to integrate multiple perspectives and values: the proper response will be just as diverse and pluralistic as the climate models themselves, and will incorporate aspects of both approaches. I conclude by offering some concrete recommendations about how to integrate this value pluralism into our socio-political decision making framework. (shrink)

This volume presents the proceedings from the Eleventh Brazilian Logic Conference on Mathematical Logic held by the Brazilian Logic Society in Salvador, Bahia, Brazil. The conference and the volume are dedicated to the memory of professor Mario Tourasse Teixeira, an educator and researcher who contributed to the formation of several generations of Brazilian logicians. Contributions were made from leading Brazilian logicians and their Latin-American and European colleagues. All papers were selected by a careful refereeing processs and were revised and (...) updated by their authors for publication in this volume. There are three sections: Advances in Logic, Advances in Theoretical Computer Science, and Advances in Philosophical Logic. Well-known specialists present original research on several aspects of model theory, proof theory, algebraic logic, category theory, connections between logic and computer science, and topics of philosophical logic of current interest. Topics interweave proof-theoretical, semantical, foundational, and philosophical aspects with algorithmic and algebraic views, offering lively high-level research results. (shrink)

This volume presents the proceedings of the workshop CSL '91 (Computer Science Logic) held at the University of Berne, Switzerland, October 7-11, 1991. This was the fifth in a series of annual workshops on computer sciencelogic (the first four are recorded in LNCS volumes 329, 385, 440, and 533). The volume contains 33 invited and selected papers on a variety of logical topics in computer science, including abstract datatypes, bounded theories, complexity results, cut elimination, denotational semantics, infinitary queries, Kleene algebra (...) with recursion, minimal proofs, normal forms in infinite-valued logic, ordinal processes, persistent Petri nets, plausibility logic, program synthesis systems, quantifier hierarchies, semantics of modularization, stable logic, term rewriting systems, termination of logic programs, transitive closure logic, variants of resolution, and many others. (shrink)

During the second half of the 20th century, attempts were made to operationally redefine various social activities, including those related to science, the military, administration and industry. These attempts were aided by scientific and technical innovations developed in the Second World War, and subsequently by the increase in use of automation in various domains. This Ph.D. thesis addresses these attempts from a sociohistorical perspective, focusing on the specific case of archaeology. During this period, the domain of archaeology underwent a process (...) of disciplinarisation and professionalisation. The same occurred in applied mathematics and then computer science: this thesis focuses on the relationships between these three domains. In France, during the 1950's and 1960's, there were significant methodological and conceptual innovations. Their subsequent scientific recognition, was, however, relatively minor. In archaeology, innovations related to applied mathematics and automatics did not lead to the emergence of an archaeological speciality based on computation. This situation was in striking contrast to what happened in other scientific domains and in archaeology in other countries, where new theoretical and methodological Anglophone definitions in ‘New Archaeology’ were spreading worldwide. This thesis explores three collective attempts to redefine the conceptual and methodological basis of archaeology, led by Georges Laplace, Jean-Claude Gardin and Jean Lesage, across France, Spain and Italy. These cases are completed by other people who had significant careers in both engineering and archaeology. In general, this thesis studies a scientific activity by investigating the cognitive and social aspects of peoples’ methodological contributions. Three models of the relationships between experts in a scientific domain and experts in an applied science (here mathematics and computing) are empirically identified and described. The effects of introducing mathematical and automation procedures on the division of labour and the distribution of recognition are analysed. The success or failure of the methodological propositions are discussed with reference to several factors and models of scientific innovation. This thesis generates new information on the development of rescue and preventive archaeology and on the use of digital technologies in human sciences. The analysis draws on 82 interviews, 23 archives and several bibliometric datasets (extracted from pre-existing databases or constructed for the purpose of this research). Mirroring the archaeological propositions under study, this research also intends to illustrate the possible use of computing and formalised procedures in social sciences. The documentation and demonstrative principles underlying this work, implemented by using Wiki, the methods of literate programming and reproducible research, are themselves analysed. (shrink)

Extract from Hofstadter's revew in Bulletin of American Mathematical Society : http://www.ams.org/journals/bull/1980-02-02/S0273-0979-1980-14752-7/S0273-0979-1980-14752-7.pdf -/- "Aaron Sloman is a man who is convinced that most philosophers and many other students of mind are in dire need of being convinced that there has been a revolution in that field happening right under their noses, and that they had better quickly inform themselves. The revolution is called "Artificial Intelligence" (Al)-and Sloman attempts to impart to others the "enlighten- ment" which he clearly regrets (...) not having experienced earlier himself. Being somewhat of a convert, Sloman is a zealous campaigner for his point of view. Now a Reader in Cognitive Science at Sussex, he began his academic career in more orthodox philosophy and, by exposure to linguistics and AI, came to feel that all approaches to mind which ignore AI are missing the boat. I agree with him, and I am glad that he has written this provocative book. The tone of Sloman's book can be gotten across by this quotation (p. 5): "I am prepared to go so far as to say that within a few years, if there remain any philosophers who are not familiar with some of the main developments in artificial intelligence, it will be fair to accuse them of professional incom- petence, and that to teach courses in philosophy of mind, epistemology, aesthetics, philosophy of science, philosophy of language, ethics, metaphysics, and other main areas of philosophy, without discussing the relevant aspects of artificial intelligence will be as irresponsible as giving a degree course in physics which includes no quantum theory." -/- (The author now regrets the extreme polemical tone of the book.). (shrink)

The IOth International Congress of Logic, Methodology and Philosophy of Science, which took place in Florence in August 1995, offered a vivid and comprehensive picture of the present state of research in all directions of Logic and Philosophy of Science. The final program counted 51 invited lectures and around 700 contributed papers, distributed in 15 sections. Following the tradition of previous LMPS-meetings, some authors, whose papers aroused particular interest, were invited to submit their works for publication in a collection of (...) selected contributed papers. Due to the large number of interesting contributions, it was decided to split the collection into two distinct volumes: one covering the areas of Logic, Foundations of Mathematics and Computer Science, the other focusing on the general Philosophy of Science and the Foundations of Physics. As a leading choice criterion for the present volume, we tried to combine papers containing relevant technical results in pure and applied logic with papers devoted to conceptual analyses, deeply rooted in advanced present-day research. After all, we believe this is part of the genuine spirit underlying the whole enterprise of LMPS studies. (shrink)

In terms of control of composition, the fabrication of money was arguably the most demanding of all pre-Industrial Revolution metallurgical practices. The calculations involved in such control needed arithmetical computations involving repeated multiplications and divisions, not only of integers but also of mixed numbers. Such computations were possible using Roman numerals, but with some difficulties. The advantages gained by employing arithmetic using Indo-arabic numerals for alloying calculations would have been the same as for other types of commercial calculations. A method (...) of calculating the proportions of two coinage alloys of different compositions that were needed to produce a third alloy of specified intermediate composition, eventually known as the rule of alternate alligation, was however, a specific requirement in the minting of money. This requirement made a particular demand on medieval mathematics, as a solution was not possible using arithmetic alone. Furthermore, the problem became indeterminate when more than two components were available for mixing. All the necessary methods of calculation were described by Fibonacci in his Liber abbaci. These methods are to be found in a sequence of practical arithmetics that stretch through the trattati d'abbaco of the Italian city states during the fourteenth and fifteenth centuries, to the first printed books of Continental authors such as Pacioli. Of the earliest sixteenth-century printed English books on practical arithmetic, The Grounde of Artes by Robert Recorde contained the first advance in the methodology of alternate alligation since Fibonacci. In the seventeenth century, formal proof of the rule of alternate alligation was given by Kersey in his practical arithmetics and his treatise on algebra. The topic was also addressed by several authors of academic algebras. It was in this century that the problem of indeterminacy in the solution of alternate alligation involving the mixture of more than two components, was finally resolved. English mint accounts provide little direct information on the alloying calculations carried out, and nothing on the methods used. However, the continued description of such calculations in other mint documents, merchants notebooks, and in goldsmiths' handbooks spanning four centuries imply that the calculations described in practical arithmetics were used in practice. Monetary matters had high economic and political profiles during the whole of the time span covered in this study. The influence of such considerations pervades the history of the technology of minting and the mathematics on which it called, and is discussed in context. (shrink)

The state of computing science and, particularly, software engineering and knowledge engineering is generally considered immature. The best starting point for achieving a mature engineering discipline is a solid scientific theory, and the primary reason behind the immaturity in these fields is precisely that computing science still has no such agreed upon underlying theory. As theories in other fields of science do, this paper formally establishes the fundamental elements and postulates making up a first attempt at a theory (...) in this field, considering the features and peculiarities of computing science. The fundamental elements of this approach are informons and holons, and it is a general and comprehensive theory of software engineering and knowledge engineering that related disciplines (e.g., information systems) can particularise and/or extend to take benefit from it (Lakatos’ concepts of core theory and protective belt theories). (shrink)

This workshop on stochastic theory and adaptive control assembled many of the leading researchers on stochastic control and stochastic adaptive control to increase scientific exchange and cooperative research between these two subfields of stochastic analysis. The papers included in the proceedings include survey and research. They describe both theoretical results and applications of adaptive control. There are theoretical results in identification, filtering, control, adaptive control and various other related topics. Some applications to manufacturing systems, queues, networks, medicine and other topics (...) are gien. (shrink)

Combining physics, mathematics and computer science, quantum computing and its sister discipline of quantum information have developed in the past few decades from visionary ideas to two of the most fascinating areas of quantum theory. General interest and excitement in quantum computing was initially triggered by Peter Shor (1994) who showed how a quantum algorithm could exponentially “speed-up” classical computation and factor large numbers into primes far more efficiently than any (known) classical algorithm. Shor’s algorithm was soon followed (...) by several other algorithms that aimed to solve combinatorial and algebraic problems, and in the years since theoretical study of quantum systems serving as computational devices has achieved tremendous progress. Common belief has it that the implementation of Shor’s algorithm on a large scale quantum computer would have devastating consequences for current cryptography protocols which rely on the premise that all known classical worst-case algorithms for factoring take time exponential in the length of their input (see, e.g., Preskill 2005). Consequently, experimentalists around the world are engaged in attempts to tackle the technological difficulties that prevent the realisation of a large scale quantum computer. But regardless whether these technological problems can be overcome (Unruh 1995; Ekert and Jozsa 1996; Haroche and Raimond 1996), it is noteworthy that no proof exists yet for the general superiority of quantum computers over their classical counterparts. -/- The philosophical interest in quantum computing is manifold. From a social-historical perspective, quantum computing is a domain where experimentalists find themselves ahead of their fellow theorists. Indeed, quantum mysteries such as entanglement and nonlocality were historically considered a philosophical quibble, until physicists discovered that these mysteries might be harnessed to devise new efficient algorithms. But while the technology for harnessing the power of 50–100 qubits (the basic unit of information in the quantum computer) is now within reach (Preskill 2018), only a handful of quantum algorithms exist, and the question of whether these can truly outperform any conceivable classical alternative is still open. From a more philosophical perspective, advances in quantum computing may yield foundational benefits. For example, it may turn out that the technological capabilities that allow us to isolate quantum systems by shielding them from the effects of decoherence for a period of time long enough to manipulate them will also allow us to make progress in some fundamental problems in the foundations of quantum theory itself. Indeed, the development and the implementation of efficient quantum algorithms may help us understand better the border between classical and quantum physics (Cuffaro 2017, 2018a; cf. Pitowsky 1994, 100), and perhaps even illuminate fundamental concepts such as measurement and causality. Finally, the idea that abstract mathematical concepts such as computability and complexity may not only be translated into physics, but also re-written by physics bears directly on the autonomous character of computer science and the status of its theoretical entities—the so-called “computational kinds”. As such it is also relevant to the long-standing philosophical debate on the relationship between mathematics and the physical world. (shrink)

The paper deals with some conceptual trends in the philosophy of science of the 1980‒90s, which being evolved simultaneously with the computer revolution, make room for treating it as a revolution in mathematics. The immense and widespread popularity of Thomas Kuhn’s theory of scientific revolutions had made a demand for overcoming this theory, at least in some aspects, just inevitable. Two of such aspects are brought into focus in this paper. Firstly, it is the shift from theoretical to instrumental revolutions (...) which are sometimes called “Galisonian revolutions” after Peter Galison. Secondly, it is the shift from local (“little”) to global (“big”) scientific revolutions now connected with the name of Ian Hacking; such global, transdisciplinary revolutions are at times called “Hacking-type revolutions”. The computer revolution provides a typical example of both global and instrumental revolutions. That change of accents in the post-Kuhnian perspective on scientific revolutions was closely correlated with the general tendency to treat science as far more pluralistic and transdisciplinary. That tendency is primarily associated with the so-called Stanford School; Peter Galison and Ian Hacking are often seen as its representatives. In particular, that new image of science gave no support to a clear-cut separation of mathematics from other sciences. Moreover, it has formed prerequisites for the recognition of material and technical revolutions in the history of mathematics. Especially, the computer revolution can be considered in the new framework as a revolution in mathematics par excellence. (shrink)

In this paper it is argued that the fundamental difference of the formal and the informal position in the philosophy of mathematics results from the collision of an object and a process centric perspective towards mathematics. This collision can be overcome by means of dialectical analysis, which shows that both perspectives essentially depend on each other. This is illustrated by the example of mathematical proof and its formal and informal nature. A short overview of the employed materialist dialectical approach (...) is given that rationalises mathematical development as a process of model production. It aims at placing more emphasis on the application aspects of mathematical results. Moreover, it is shown how such production realises subjective capacities as well as objective conditions, where the latter are mediated by mathematical formalism. The approach is further sustained by Polanyi’s theory of problem solving and Stegmaier’s philosophy of orientation. In particular, the tool and application perspective illuminates which role computer-based proofs can play in mathematics. (shrink)

This book presents new results in computability theory, a branch of mathematical logic and computer science that has become increasingly relevant in recent years. The field's connections with disparate areas of mathematical logic and mathematics more generally have grown deeper, and now have a variety of applications in topology, group theory, and other subfields. This monograph establishes new directions in the field, blending classic results with modern research areas such as algorithmic randomness. The significance of the book lies (...) not only in the depth of the results contained therein, but also in the fact that the notions the authors introduce allow them to unify results from several subfields of computability theory. (shrink)

Kant famously distinguishes between the methods of mathematics and of metaphysics, holding that metaphysicians err when they avail themselves of the mathematical method. Nonetheless, in the Metaphysical Foundations of Natural Science, he insists that mathematics and metaphysics must jointly ground ‘proper natural science’. This article examines the distinctive contributions and unity of mathematics and metaphysics to the foundations of the science of body. I argue that the two are distinct insofar as they involve distinctive sorts of grounding relations – (...) mathematics pertains to formal grounding, while metaphysics concerns material grounding – while they are unified insofar as they treat motion, the fundamental determination of the science of body. (shrink)

This book examines the interface between mathematics and applied sciences. The editor examines the present and future needs for the interaction between various science and engineering areas. This edited book brings together the cutting-edge research on mathematics, combining various fields of science and engineering. The book begins with an introduction to computing and modeling. Next, computation and modeling trends are covered, along with chapters on structural static and vibration problems, heat conduction and diffusion problems, and fluid dynamics problems. (...) Soft computing and machine intelligence based modeling are also discussed, along with bio medical problems. The book concludes with a chapter on modeling in mining, electrical, electronics, and chemical problems. This book is a reference for students and researchers in various fields of engineering such as computer, mechanical, civil, aerospace, electrical, and chemical, as well as and other sciences such as applied mathematics, physics, chemistry, and life sciences. (shrink)

This collection of 38 papers gives a cross-section of ongoing research in philosophy of science and philosophical logic. The papers, written by active researchers in the field and published here for the first time, are drawn from around 650 papers that were contributed to the 9th International Congress of Logic, Methodology and Philosophy of Science in Uppsala, Sweden, 1991. Some of the speakers whose contributions attracted special interest were invited to contribute their papers to this volume. A few papers appear (...) here more or less as they were presented at the Congress, whereas others are expansions or elaborations of the talks given. There is one section with five papers on philosophical logic. The other papers deal with many different aspects of philosophy of science, including general methodological questions, problems of probability, induction and decision theory, and ethics of science and technology, as well as foundational problems about particular sciences. Five special sections are concerned with logic, mathematics and computer science, the physical sciences, the biological sciences, cognitive science, and linguistics, respectively. Finally, there is one section on the history of logic, methodology and philosophy of science. The book will be of interest to philosophers of science and logicians, as well as to all researchers interested in the foundations of their disciplines. (shrink)

This textbook is a logic manual which includes an elementary course and an advanced course. It covers more than most introductory logic textbooks, while maintaining a comfortable pace that students can follow. The technical exposition is clear, precise and follows a paced increase in complexity, allowing the reader to get comfortable with previous definitions and procedures before facing more difficult material. The book also presents an interesting overall balance between formal and philosophical discussion, making it suitable for both philosophy and (...) more formal/science oriented students. This textbook is of great use to undergraduate philosophy students, graduate philosophy students, logic teachers, undergraduates and graduates in mathematics, computer science or related fields in which logic is required. (shrink)

Formal spaces have become commonplace conceptual and computational tools in a large array of scientific disciplines, including both the natural and the social sciences. Morphological spaces are spaces describing and relating organismal phenotypes. They play a central role in morphometrics, the statistical description of biological forms, but also underlie the notion of adaptive landscapes that drives many theoretical considerations in evolutionary biology. We briefly review the topological and geometrical properties of the most common morphospaces in the biological literature. In (...) contemporary geometric morphometrics, the notion of a morphospace is based on the Euclidean tangent space to Kendall’s shape space, which is a Riemannian manifold. Many more classical morphospaces, such as Raup’s space of coiled shells, lack these metric properties, e.g., due to incommensurably scaled variables, so that these morphospaces typically are affine vector spaces. Other notions of a morphospace, like Thomas and Reif’s skeleton space, may not give rise to a quantitative measure of similarity at all. Such spaces can often be characterized in terms of topological or pretopological spaces. (shrink)

This volume contains the proceedings of three special sessions: Algebra and Computer Science, held during the Joint AMS-EMS-SPM meeting in Porto, Portugal, June 10–13, 2015; Groups, Algorithms, and Cryptography, held during the Joint Mathematics Meeting in San Antonio, TX, January 10–13, 2015; and Applications of Algebra to Cryptography, held during the Joint AMS-Israel Mathematical Union meeting in Tel-Aviv, Israel, June 16–19, 2014. Papers contained in this volume address a wide range of topics, from theoretical aspects of algebra, namely group (...) theory, universal algebra and related areas, to applications in several different areas of computer science. From the computational side, the book aims to reflect the rapidly emerging area of algorithmic problems in algebra, their computational complexity and applications, including information security, constraint satisfaction problems, and decision theory. The book gives special attention to recent advances in quantum computing that highlight the need for a variety of new intractability assumptions and have resulted in a new area called group-based cryptography. (shrink)

Epistemic logic has grown from its philosophical beginnings to find diverse applications in computer science, and as a means of reasoning about the knowledge and belief of agents. This book provides a broad introduction to the subject, along with many exercises and their solutions. The authors begin by presenting the necessary apparatus from mathematics and logic, including Kripke semantics and the well-known modal logics K, T, S4 and S5. Then they turn to applications in the context of distributed systems and (...) artificial intelligence. These include the notions of common knowledge, distributed knowledge, explicit and implicit belief, the interplays between knowledge and time, and knowledge and action, as well as a graded (or numerical) variant of the epistemic operators. The authors also discuss extensively the problem of logical omniscience. They cover Halpern & Moses' theory of honest formulas, and they make a digression into the realm of nonmonotonic reasoning and preferential entailment. They discuss Moore's autoepistemic logic, together with Levesque's related logic of "all I know". Furthermore, they show how one can base default and counterfactual reasoning on epistemic logic. Graduate students in philosophy or in computer science, especially those with an interest in AI, will find this book useful. (shrink)

The comparison made by Ada Lovelace in 1843 between the Analytical Engine and the Jacquard loom is one of the well-known analogies between looms and computation machines. Given the fact that weaving – and textile production in general – is one of the oldest cultural techniques in human history, the question arises whether this was the first time that such a parallel was drawn. As this paper will show, centuries before Lovelace’s analogy, such a comparison was made by Gottfried Wilhelm (...) Leibniz. During the 17th century, Leibniz compared his calculating machines with another textile machine, the stocking frame, a machine which mechanized knitting and which was invented in 1589. During the following centuries, this machine was considered as a technological wonder and as a creation of God, and, during the last decades of the 17th century, Leibniz emphasized the need to consider it and other textile machines mathematically. What, then, were the reasons for the parallel drawn between this machine and Leibniz’s automatic computation machines? And what were the consequences of this analogy concerning the artisanal knowledge embedded in manual textile practices? (shrink)

In December and January of 1983–1984, archaeologists excavating the tomb of an ancient Chinese provincial bureaucrat at a Western Han Dynasty site near Zhangjiashan, in Jiangling county, Hubei Province, discovered a number of books on bamboo strips, including inter alia works on legal statutes, military practice, and medicine. Among these was a previously unknown mathematical work on some 200 bamboo strips, the Suan shu shu, or Book of Numbers and Computations. Based upon other works found in the tomb, especially (...) a copy of the Er nian lü ling (Laws and Decrees of the Second Year (of the reign of empress Lü, i.e. Lü Hou)), archaeologists have dated the tomb to ca. 186 BCE (Lü Hou’s regency lasted from 188 to 180 BCE). The Suan shu shu, as the earliest yet discovered work devoted specifically to mathematics from ancient China, has stirred considerable interest among Chinese historians of science. The translation and commentary offered here draw extensively on the works cited in Sect. 3 below. Several appendixes devoted to specific issues related to translating the Suan shu shu, including its title and the problem of determining English equivalents for various commodities that arise in the text, may be found in Appendix II. (shrink)

Depending on what one means by the main connective of logic, the -if..., then... -, several systems of logic result: classic and modal logics, intuitionistic logic or relevance logic. This book presents the underlying ideas, the syntax and the semantics of these logics. Soundness and completeness are shown constructively and in a uniform way. Attention is paid to the interdisciplinary role of logic: its embedding in the foundations of mathematics and its intimate connection with philosophy, in particular the philosophy of (...) language. Set theory is presented both as a conditio sine qua non for logic and as a interesting exact ontology. The study of infinite sets yields perplexing results. Formalization of informal number theory results in formal number theory; Godel's incompleteness is treated. At appropriate places attention is paid to paradoxes, intuitionism, conditionals, the historical development of logic, to logic programming and automated theorem proving for classical logic.". (shrink)

This is a concise book that introduces students to the basics of logical thinking and important mathematical structures that are critical for a solid understanding of logical formalisms themselves as well as for building the necessary background to tackle other fields that are based on these logical principles. Despite its compact and small size, it includes many solved problems and quite a few end-of-section exercises that will help readers consolidate their understanding of the material. This textbook is essential reading (...) for anyone interested in the logical foundations of Informatics, Computer Science, Data Science, Artificial Intelligence, and other related areas. Written with undergraduate students in these disciplines in mind, this book can very well serve the needs of interested and curious readers who wish to get a grasp of the logical principles upon which these fields are built. This book does not require readers to possess math skills beyond those learned in high school. (shrink)

Summary In terms of control of composition, the fabrication of money was arguably the most demanding of all pre-Industrial Revolution metallurgical practices. The calculations involved in such control needed arithmetical computations involving repeated multiplications and divisions, not only of integers but also of mixed numbers. Such computations were possible using Roman numerals, but with some difficulties. The advantages gained by employing arithmetic using Indo-arabic numerals for alloying calculations would have been the same as for other types of commercial calculations. A (...) method of calculating the proportions of two coinage alloys of different compositions that were needed to produce a third alloy of specified intermediate composition, eventually known as the rule of alternate alligation, was however a specific requirement in the minting of money. This requirement made a particular demand on medieval mathematics, as a solution was not possible using arithmetic alone. Furthermore, the problem became indeterminate when more than two components were available for mixing. All the necessary methods of calculation were described by Fibonacci in his Liber abbaci. These methods are to be found in a sequence of practical arithmetics that stretch through the trattati d'abbaco of the Italian city states during the fourteenth and fifteenth centuries, to the first printed books of Continental authors such as Pacioli. Of the earliest sixteenth-century printed English books on practical arithmetic, The Grounde of Artes by Robert Recorde contained the first advance in the methodology of alternate alligation since Fibonacci. In the seventeenth century, formal proof of the rule of alternate alligation was given by Kersey in his practical arithmetics and in his treatise on algebra. The topic was also addressed by several authors of academic algebras. It was in this century that the problem of indeterminacy in the solution of alternate alligation involving the mixture of more than two components, was finally resolved. English mint accounts provide little direct information on the alloying calculation carried out, and nothing on the methods used. However, the continued description of such calculations in other mint documents, merchants notebooks, and in goldsmiths' handbooks spanning four centuries imply that the calculations described in practical arithmetics were used in practice. Monetary matters had high economic and political profiles during the whole of the time span covered in this study. The influence of such considerations pervades the history of the technology of minting and the mathematics on which it called, and is discussed in context. (shrink)

Constructive mathematics – mathematics in which ‘there exists’ always means ‘we can construct’ – is enjoying a renaissance. Fifty years on from Bishop’s groundbreaking account of constructive analysis, constructive mathematics has spread out to touch almost all areas of mathematics and to have profound influence in theoretical computer science. This handbook gives the most complete overview of modern constructive mathematics, with contributions from leading specialists surveying the subject’s myriad aspects. Major themes include: constructive algebra and geometry, constructive analysis, constructive topology, (...) constructive logic and foundations of mathematics, and computational aspects of constructive mathematics. A series of introductory chapters provides graduate students and other newcomers to the subject with foundations for the surveys that follow. Edited by four of the most eminent experts in the field, this is an indispensable reference for constructive mathematicians and a fascinating vista of modern constructivism for the increasing number of researchers interested in constructive approaches. (shrink)

a Mathematicians, like Proust and everyone else, are at their best when writing about their first lovea (TM) a ] They are among the very best we have; and their best is very good indeed. a ] One approaches this book with high hopes. Happily, one is not disappointed. a ]In paperback it might well have become a best seller. a ]read it. From The Mathematical Intelligencer Mathematics is shaped by the consistent concerns and styles of powerful minds a (...) three of which are represented here. Kaca (TM)s work is marked by deep commitment and breadth of inquiry. Rota is the easiest of these authors to reada ]a delight: witty and urbane, with a clear and interesting agenda and an astonishing intellectual range. To read him is to be a part of a pleasant and rewarding conversation. Jacob T. Schwartz attacks problems ina ]computer science, mathematical economics, computer and instructional a ] No matter how slippery the problem, Schwartz manages to capture a substantial chunk of it in his mathematical net. a Mathematics Magazine This is a volume of essays and reviews that delightfully explore mathematics in all its moods a from the light and the witty, and humorous to serious, rational, and cerebral. Topics include: logic, combinatorics, statistics, economics, artificial intelligence, computer science, and applications of mathematics broadly. You will also find history and philosophy covered, including discussion of the work of Ulam, Kant, Heidegger among others. (shrink)

We study the logical and computational properties of basic theorems of uncountable mathematics, in particular Pincherle's theorem, published in 1882. This theorem states that a locally bounded function is bounded on certain domains, i.e. one of the first ‘local-to-global’ principles. It is well-known that such principles in analysis are intimately connected to (open-cover) compactness, but we nonetheless exhibit fundamental differences between compactness and Pincherle's theorem. For instance, the main question of Reverse Mathematics, namely which set existence axioms are necessary to (...) prove Pincherle's theorem, does not have an unique or unambiguous answer, in contrast to compactness. We establish similar differences for the computational properties of compactness and Pincherle's theorem. We establish the same differences for other local-to-global principles, even going back to Weierstrass. We also greatly sharpen the known computational power of compactness, for the most shared with Pincherle's theorem however. Finally, countable choice plays an important role in the previous, we therefore study this axiom together with the intimately related Lindelöf lemma. (shrink)

What is a language? What do scientific grammars tell us about the structure of individual languages and human language in general? What kind of science is linguistics? These and other questions are the subject of Ryan M. Nefdt's Language, Science, and Structure. -/- Linguistics presents a unique and challenging subject matter for the philosophy of science. As a special science, its formalisation and naturalisation inspired what many consider to be a scientific revolution in the study of mind and language. Yet (...) radical internal theory change, multiple competing frameworks, and issues of modelling and realism have largely gone unaddressed in the field. Nefdt develops a structural realist perspective on the philosophy of linguistics which aims to confront the aforementioned topics in new ways while expanding the outlook toward new scientific connections and novel philosophical insights. On this view, languages are real patterns which emerge from complex biological systems. Nefdt's exploration of this novel view will be especially valuable to those working in formal and computational linguistics, cognitive science, and the philosophies of science, mathematics, and language. (shrink)

The book starts with the assumption that vagueness is a fundamental property of this world. From a philosophical account of vagueness via the presentation of alternative mathematics of vagueness, the subsequent chapters explore how vagueness manifests itself in the various exact sciences: physics, chemistry, biology, medicine, computer science, and engineering.

Alan M. Turing, pioneer of computing and WWII codebreaker, is one of the most important and influential thinkers of the twentieth century. In this volume for the first time his key writings are made available to a broad, non-specialist readership. They make fascinating reading both in their own right and for their historic significance: contemporary computational theory, cognitive science, artificial intelligence, and artificial life all spring from this ground-breaking work, which is also rich in philosophical and logical insight. An (...) introduction by leading Turing expert Jack Copeland provides the background and guides the reader through the selection. About Alan Turing Alan Turing FRS OBE, (1912-1954) studied mathematics at King's College, Cambridge. He was elected a Fellow of King's in March 1935, at the age of only 22. In the same year he invented the abstract computing machines - now known simply as Turing machines - on which all subsequent stored-program digital computers are modelled. During 1936-1938 Turing continued his studies, now at Princeton University. He completed a PhD in mathematical logic, analysing the notion of 'intuition' in mathematics and introducing the idea of oracular computation, now fundamental in mathematical recursion theory. An 'oracle' is an abstract device able to solve mathematical problems too difficult for the universal Turing machine. In the summer of 1938 Turing returned to his Fellowship at King's. When WWII started in 1939 he joined the wartime headquarters of the Government Code and Cypher School (GC&CS) at Bletchley Park, Buckinghamshire. Building on earlier work by Polish cryptanalysts, Turing contributed crucially to the design of electro-mechanical machines ('bombes') used to decipher Enigma, the code by means of which the German armed forces sought to protect their radio communications. Turing's work on the version of Enigma used by the German navy was vital to the battle for supremacy in the North Atlantic. He also contributed to the attack on the cyphers known as 'Fish'. Based on binary teleprinter code, Fish was used during the latter part of the war in preference to morse-based Enigma for the encryption of high-level signals, for example messages from Hitler and other members of the German High Command. It is estimated that the work of GC&CS shortened the war in Europe by at least two years. Turing received the Order of the British Empire for the part he played. In 1945, the war over, Turing was recruited to the National Physical Laboratory (NPL) in London, his brief to design and develop an electronic computer - a concrete form of the universal Turing machine. Turing's report setting out his design for the Automatic Computing Engine (ACE) was the first relatively complete specification of an electronic stored-program general-purpose digital computer. Delays beyond Turing's control resulted in NPL's losing the race to build the world's first working electronic stored-program digital computer - an honour that went to the Royal Society Computing Machine Laboratory at Manchester University, in June 1948. Discouraged by the delays at NPL, Turing took up the Deputy Directorship of the Royal Society Computing Machine Laboratory in that year. Turing was a founding father of modern cognitive science and a leading early exponent of the hypothesis that the human brain is in large part a digital computing machine, theorising that the cortex at birth is an 'unorganised machine' which through 'training' becomes organised 'into a universal machine or something like it'. He also pioneered Artificial Intelligence. Turing spent the rest of his short career at Manchester University, being appointed to a specially created Readership in the Theory of Computing in May 1953. He was elected a Fellow of the Royal Society of London in March 1951 (a high honour). (shrink)

Zalamea’s book is as original as it is belated. It is indeed surprising, if we give it a moment’s thought, just how greatly behind schedule philosophical reflection on contemporary mathematics lags, especially considering the momentous changes that took place in the second half of the twentieth century. Zalamea compares this situation with that of the philosophy of physics: he mentions D’Espagnat’s work on quantum mechanics, but we could add several others who, in the last few decades, have elaborated an (...) extremely timely philosophy of contemporary physics (see for example Bitbol 2000; Bitbol et al. 2009). As was the case in biology, philosophy – since Kant’s crucial observations in the Critique of Judgment, at least – has often “run ahead” of life sciences, exploring and opening up a space for reflections that are not derived from or integrated with its contemporary scientific practice. Some of these reflections are still very much auspicious today. And indeed, some philosophers today are saying something truly new about biology... (shrink)