The Joint International Conference on Logic Programming, sponsored by the Association for Logic Programming, is a major forum for presentations of research, applications, and implementations in this important area of computer science. Logic programming is one of the most promising steps toward declarative programming and forms the theoretical basis of the programming language Prolog and its various extensions. Logic programming is also fundamental to work in artificial intelligence, where it has been used for nonmonotonic and commonsense reasoning, expert systems implementation, (...) deductive databases, and applications such as computer-aided manufacturing. Krzysztof R. Apt is project leader at the Centre for Mathematics and Computer Science in Amsterdam and part-time Professor in Computer Science at the University of Amsterdam. Topics covered: Theory Foundations. Programming Languages. Implementation. Programming Methodologies and Tools. Applications. Deductive Databases. Artificial Intelligence. Parallelism. (shrink)

This bold and lively essay is one of those rarest of intellectual achievements, a big small book. In its short length are condensed enormous erudition and impressive analytical scope. With verve and self-assurance, it addresses a broad, central question: How can we improve our understanding of the large-scale processes and structures that transformed the world of the nineteenth century and are transforming our world today? Tilly contends that twentieth-century social theories have been encumbered by a nineteenth century heritage of “pernicious (...) postulates.” He subjects each misleading belief to rigorous criticism, challenging many standard social science paradigms and methodologies. As an alternative to those timeless, placeless models of social change and organization, Tilly argues convincingly for a program of concrete, historically grounded analysis and systematic comparison. To illustrate the strategies available for such research, Tilly assesses the works of several major practitioners of comparative historical analysis, making skillful use of this selective review to offer his own speculative, often unconventional accounts of our recent past. Historically oriented social scientists will welcome this provocative essay and its wide-ranging agenda for comparative historical research. Other social scientists, their graduate and undergraduate students, and even the interested general reader will find this new work by a major scholar stimulating and eminently readable. This is the second of five volumes commissioned by the Russell Sage Foundation to mark its seventy-fifth anniversary. "In this short, brilliant book Tilly suggests a way to think about theories of historical social change....This book should find attentive readers both in undergraduate courses and in graduate seminars. It should also find appreciative readers, for Tilly is a writer as well as a scholar." —Choice. (shrink)

Recent discussions on Fregean and neo-Fregean foundations for arithmetic and real analysis pay much attention to what is called either ‘Application Constraint’ ($AC$) or ‘Frege Constraint’ ($FC$), the requirement that a mathematical theory be so outlined that it immediately allows explaining for its applicability. We distinguish between two constraints, which we, respectively, denote by the latter of these two names, by showing how$AC$generalizes Frege’s views while$FC$comes closer to his original conceptions. Different authors diverge on the interpretation of$FC$and on whether (...) it applies to definitions of both natural and real numbers. Our aim is to trace the origins of$FC$and to explore how different understandings of it can be faithful to Frege’s views about such definitions and to his foundational program. After rehearsing the essential elements of the relevant debate (§1), we appropriately distinguish$AC$from$FC$(§2). We discuss six rationales which may motivate the adoption of different instances of$AC$and$FC$(§3). We turn to the possible interpretations of$FC$(§4), and advance a Semantic$FC$(§4.1), arguing that while it suits Frege’s definition of natural numbers (4.1.1), it cannot reasonably be imposed on definitions of real numbers (§4.1.2), for reasons only partly similar to those offered by Crispin Wright (§4.1.3). We then rehearse a recent exchange between Bob Hale and Vadim Batitzky to shed light on Frege’s conception of real numbers and magnitudes (§4.2). We argue that an Architectonic version of$FC$is indeed faithful to Frege’s definition of real numbers, and compatible with his views on natural ones. Finally, we consider how attributing different instances of$FC$to Frege and appreciating the role of the Architectonic$FC$can provide a more perspicuous understanding of his foundational program, by questioning common pictures of his logicism (§5). (shrink)

This chapter introduces the topics investigated in this book and it frames them in a broader historical and philosophical analysis of programming and computing technology.

Miller, D., G. Nadathur, F. Pfenning and A. Scedrov, Uniform proofs as a foundation for logic programming, Annals of Pure and Applied Logic 51 125–157. A proof-theoretic characterization of logical languages that form suitable bases for Prolog-like programming languages is provided. This characterization is based on the principle that the declarative meaning of a logic program, provided by provability in a logical system, should coincide with its operational meaning, provided by interpreting logical connectives as simple and fixed search instructions. The (...) operational semantics is formalized by the identification of a class of cut-free sequent proofs called uniform proofs. A uniform proof is one that can be found by a goal-directed search that respects the interpretation of the logical connectives as search instructions. The concept of a uniform proof is used to define the notion of an abstract logic programming language, and it is shown that first-order and higher-order Horn clauses with classical provability are examples of such a language. Horn clauses are then generalized to hereditary Harrop formulas and it is shown that first-order and higher-order versions of this new class of formulas are also abstract logic programming languages if the inference rules are those of either intuitionistic or minimal logic. The programming language significance of the various generalizations to first-order Horn clauses is briefly discussed. (shrink)

The search for symmetry is part of the fundamental scientific paradigm in mathematics and physics. Can this be valid also for economics? This book represents an attempt to explore this possibility. The behavior of price-taking producers, monopolists, monopsonists, sectoral market equilibria, behavior under risk and uncertainty, and two-person zero- and non-zero-sum games are analyzed and discussed under the unifying structure called the linear complementarity problem. Furthermore, the equilibrium problem allows for the relaxation of often-stated but unnecessary assumptions. This unifying approach (...) offers the advantage of a better understanding of the structure of economic models. It also introduces the simplest and most elegant algorithm for solving a wide class of problems. (shrink)

applied, for instance, to developing a decision support system for the Space Shuttle INogueira et al., 2001] and to graph-theoretic problems arising in..

The most prominent “schools” or programs for the foundations of mathematics that took shape in the first third of the 20th century emerged directly from, or in response to, developments in mathematics and logic in the latter part of the 19th century. The first of these programs, so-called logicism, had as its aim the reduction of mathematics to purely logical principles. In order to understand properly its achievements and resulting problems, it is necessary to review the background (...) from that previous period. (shrink)

In this thesis I defend and pursue that line about the foundations of probability theory which has come to be known as "the logicist view about probability", and, in particular, the shape which it took in Carnap's Inductive Logic. ;Most philosophers who now deal with probability theory claim that Carnap's program of Inductive Logic has failed. The main aim of my thesis is to show that this judgment is based on a fundamental misunderstanding about the nature and the aim (...) of inductive logic. To that end, I follow, in chapter 1, the events in the history of probability, logic and mathematics which led to choosing certain requirements as the requirements which any theory about the foundations of probability must fulfill in order to be acceptable. ;In chapter 2 I explain how Carnap's inductive logic fulfills those requirements and how the method it uses to give foundations to probability theory can also be used to solve another major problem about probability, namely, the problem of statistical inference. ;Chapter 3 shows how the ideas explained in chapter 2 were developed, formally, by Carnap, and how Carnap's program can be continued in a particular case, that of reasoning by analogy. ;Finally, in chapter 4, I attempt to show that subjectivism about probability theory, the rival theory to Carnap's logicism, does not succeed in meeting the most basic requirement for the acceptability of any theory about the foundations of probability. (shrink)

Organizational ethics programs often are created to address tensions in organizational values that have been identified through repeated clinical ethics consultation requests. Clinical ethicists possess some core competencies that are suitable for the leadership of high-quality organizational ethics programs, but they may need to develop new skills to build these programs, such as familiarity with healthcare delivery science, healthcare financing, and quality improvement methodology. To this end, we suggest that clinical ethicists build organizational ethics programs incrementally (...) and via quality improvement projects undertaken in collaboration with senior clinical leaders. Organizational ethics programs often differ from clinical ethics programs in their membership and processes, and likely will require ethicists to forge new partnerships with a wide array of organizational leaders. With attention to the ways that organizational ethics programs differ from clinical ethics programs, and investment in quality improvement methodology and formal institutional needs assessments, clinical ethics leaders can position an organizational ethics program to advocate effectively for visible and compelling alignment of leadership decision making with the values of the organization. (shrink)

Introduces a general framework for the theoretical investigation of psychology, to move the field beyond the usual informal style and everyday language. Psychologists, political scientists, sociologists, and philosophers of science provide constructions and reconstructions of various theories from a structuralist perspective, dealing with both fundamental aspects and with problems of application. Annotation copyright by Book News, Inc., Portland, OR.

This book examines how the Ford Foundation International Fellowships Program, the world's largest private fellowship program in higher education, has succeeded in fostering social justice leadership over the past ten years. Top scholars from Asia Pacific, Latin America, the US, Africa, and Europe inquire into the program's development, implementation, and outcomes in their regions. They analyze the program's background, its effects on institutions, its effects on students' learning environments, and how well changes toward social justice worked. Through in-depth studies of (...) leadership, diversity, social inclusion, and social justice in regional context, this book provides a wealth of comparative information on social justice in higher education worldwide. (shrink)

In the early 1920s, the German mathematician David Hilbert (1862–1943) put forward a new proposal for the foundation of classical mathematics which has come to be known as Hilbert's Program. It calls for a formalization of all of mathematics in axiomatic form, together with a proof that this axiomatization of mathematics is consistent. The consistency proof itself was to be carried out using only what Hilbert called “finitary” methods. The special epistemological character of finitary reasoning then yields the required justification (...) of classical mathematics. Although Hilbert proposed his program in this form only in 1921, various facets of it are rooted in foundational work of his going back until around 1900, when he first pointed out the necessity of giving a direct consistency proof of analysis. Work on the program progressed significantly in the 1920s with contributions from logicians such as Paul Bernays, Wilhelm Ackermann, John von Neumann, and Jacques Herbrand. It was also a great influence on Kurt Gödel, whose work on the incompleteness theorems were motivated by Hilbert's Program. Gödel's work is generally taken to show that Hilbert's Program cannot be carried out. It has nevertheless continued to be an influential position in the philosophy of mathematics, and, starting with the work of Gerhard Gentzen in the 1930s, work on so-called Relativized Hilbert Programs have been central to the development of proof theory. (shrink)

ArgumentThe main contribution of the Alfred P. Sloan and Russell Sage Foundations' behavioral economics program (1984–1992) was not the resources it provided, which were relatively modest. Instead, the program's contribution lay in catalyzing “a sense of mission” in the collaboration between psychologists Daniel Kahneman and Amos Tversky, economist Richard Thaler, and their associates. Partly this reflected the common strategy of American foundations to pick an individual or small group of scientists and stick with them until scientific success had (...) been achieved. But moreover, it was a consequence of the careful management of the program's director Eric Wanner. The various actors involved in the behavioral economics program constructed a new behavioral economic sub-discipline in economics by tapping into existing missionary sentiments in the economic and psychological disciplines, while at the same time actively shaping this sense of mission. (shrink)

El objetivo de este trabajo es poner al descubierto los principales valores cognitivos y epistemológicos desde los que Warren Weaver puso en marcha el Programa de Biología Experimental, un programa que llevado a cabo desde la presidencia de la división de ciencias naturales de la Fundación Rockefeller, marcó y condicionó en buena medida el posterior desarrollo de la investigación biológica. Para tal fin se mostrará, en primer lugar, cómo fue la llegada de Weaver a la Fundación Rockefeller, así como las (...) razones bajo las cuáles el consejo de esa institución decidió entre 1932 y 1933 dar prioridad a las investigaciones biomédicas, y la manera por la cual lo hicieron. En un segundo momento, el más extenso e importante, veremos algunos de los elementos más significativos de la perspectiva epistemológica y cognoscitiva de de Weaver. Finalizaremos viendo cómo esa perspectiva, desarrollada en conexión con el Programa de Biología Experimental, inter-actuó con la visión reduccionista de la biología a la que el programa parecía apuntar. The aim of this article is to uncover the main cognitive and epistemological values that influenced Warren Weaver in starting the Experimental Biology Program, a program carried out from the time that he became president of the Natural Sciences Division of the Rockefeller Foundation, and which significantly marked and conditioned the subsequent development of biological research. To this end, we first describe the arrival of Warren Weaver at the Rockefeller Foundation, and the reasons for which the Board of this Foundation, between 1932 and 1933, decided to prioritize biomedical research, and the manner in which they did so. Then, secondly, in the largest and most important part of the article, we will present some of the most significant elements of Weaver's epistemological and cognitive perspective. Finally, we will show how this perspective, developed in connection with the Experimental Biology Program, interacted with the reductionist view of biology to which the program seemed to point. (shrink)

Philosophy Compass, Volume 17, Issue 1, January 2022.

Quasi-set theory provides us a mathematical background for dealing with collections of indistinguishable elementary particles. In this paper, we show how to obtain the usual statistics (Maxwell–Boltzmann, Bose–Einstein, and Fermi–Dirac) into the scope of quasi-set theory. We also show that, in order to derive Maxwell–Boltzmann statistics, it is not necessary to assume that the particles are distinguishable or individuals. In other words, Maxwell–Boltzmann statistics is possible even in an ensamble of indistinguishable particles, at least from the theoretical point of view. (...) The main goal of this paper is to provide the mathematical grounds of a quasi-set theoretical framework for statistical mechanics. (shrink)

This two-part article presents the research program for a theory and empirical analysis of religious evolution. It is assumed that religion isprimarilya co-evolution to societal evolution, which in turn is a co-evolution to mental, organic, and physical evolution. The theory of evolution is triangulated with the systems theory and the semiotically informed theory of communication, so that knowledge can be gained that would not be acquired by only one of the three theories: The differentiation between religion and its environment can (...) be reconstructed based on the theory of evolution. The elements of the theory of evolution can be understood as the formation of systems. The semiotically informed theory of communication clarifies the conditions of the combination of both the systems theory and the theory of evolution as well as its objects. In turn, the combination of the systems theory and the theory of evolution can describe how communication—including religion and science—evolves and is structured. (shrink)

Foundations of Set Theory discusses the reconstruction undergone by set theory in the hands of Brouwer, Russell, and Zermelo. Only in the axiomatic foundations, however, have there been such extensive, almost revolutionary, developments. This book tries to avoid a detailed discussion of those topics which would have required heavy technical machinery, while describing the major results obtained in their treatment if these results could be stated in relatively non-technical terms. This book comprises five chapters and begins with a (...) discussion of the antinomies that led to the reconstruction of set theory as it was known before. It then moves to the axiomatic foundations of set theory, including a discussion of the basic notions of equality and extensionality and axioms of comprehension and infinity. The next chapters discuss type-theoretical approaches, including the ideal calculus, the theory of types, and Quine's mathematical logic and new foundations; intuitionistic conceptions of mathematics and its constructive character; and metamathematical and semantical approaches, such as the Hilbert program. This book will be of interest to mathematicians, logicians, and statisticians. (shrink)

Foundations of Algorithms, Fifth Edition offers a well-balanced presentation of algorithm design, complexity analysis of algorithms, and computational complexity. Ideal for any computer science students with a background in college algebra and discrete structures, the text presents mathematical concepts using standard English and simple notation to maximize accessibility and user-friendliness. Concrete examples, appendices reviewing essential mathematical concepts, and a student-focused approach reinforce theoretical explanations and promote learning and retention. C++ and Java pseudocode help students better understand complex algorithms. A (...) chapter on numerical algorithms includes a review of basic number theory, Euclid's Algorithm for finding the greatest common divisor, a review of modular arithmetic, an algorithm for solving modular linear equations, an algorithm for computing modular powers, and the new polynomial-time algorithm for determining whether a number is prime. The revised and updated Fifth Edition features an all-new chapter on genetic algorithms and genetic programming, including approximate solutions to the traveling salesperson problem, an algorithm for an artificial ant that navigates along a trail of food, and an application to financial trading. With fully updated exercises and examples throughout and improved instructor resources including complete solutions, an Instructor's Manual and PowerPoint lecture outlines, Foundations of Algorithms is an essential text for undergraduate and graduate courses in the design and analysis of algorithms. Key features include: • The only text of its kind with a chapter on genetic algorithms • Use of C++ and Java pseudocode to help students better understand complex algorithms • No calculus background required • Numerous clear and student-friendly examples throughout the text • Fully updated exercises and examples throughout • Improved instructor resources, including complete solutions, an Instructor's Manual, and PowerPoint lecture outlines. (shrink)

A new hypothesis on the basic features characterising the Foundations of Mathematics is suggested. By means of them the entire historical development of Mathematics before the 20th Century is summarised through a table. Also the several programs, launched around the year 1900, on the Foundations of Mathematics are characterised by a corresponding table. The major difficulty that these programs met was to recognize an alternative to the basic feature of the deductive organization of a theory - (...) more precisely, to Hilbert’s main tenet. Ironically, already half a century before the births of these programs the alternative organization has been substantially represented by Lobachevsky's theory on parallel lines. Moreover, although each program’s founder recognised the basic features in a partial way only, all together these programs represented just the four possible foundational approaches. (shrink)

Name der Zeitschrift: Zeitschrift für Religionswissenschaft Jahrgang: 26 Heft: 1 Seiten: 1-51.

The Advanced School on Quantum Foundations and Open Quantum Systems was an exceptional combination of lectures. These comprise lectures in standard physics and investigations on the foundations of quantum physics. On the one hand it included lectures on quantum information, quantum open systems, quantum transport and quantum solid state. On the other hand it included lectures on quantum measurement, models for elementary particles, sub-quantum structures and aspects on the philosophy and principles of quantum physics. The special program of (...) this school offered a broad outlook on the current and near future fundamental research in theoretical physics. The lectures were delivered at the level of PhD students. (shrink)

This collection of current research on logic programming languages presents results from a three-year, ESPRIT-funded effort to explore the integration of the foundational issues of functional, logic, and object-oriented programming. It offers valuable insights into the fast-developing extensions of logic programming with functions, constraints, concurrency, and objects. Chapters are grouped according to the unifying themes of functional programming, constraint, logic programming, and object-oriented programming.

In the article, philosophical and methodological analysis of the program of Hilbert’s formalism as a really working direction for consideration of the bases of modern mathematics is presented. For the professional mathematicians methodological advantages of the program of formalism advanced by David Hilbert, consist primarily in the fact that the highest possible level of theoretical rigor of modern mathematical theories was practically represented there. To resolve the fundamental difficulties of the problem of bases of mathematics, according to Hilbert, the theory (...) of mathematical proof is needed, but contrary to popular belief rigorous formalization of the proof is not a synonym of reliability and rigor of mathematical reasoning from the point of view of the philosophy of the foundations of mathematics. In fact, the consistency of the theories is "more important" than their logical consistency because not every statement, which does not contradict to the reasonable ones, can be attributed to a true statement. However, for working mathematicians, Hilbert is logical and consistent and the axiomatic method and formalism are an essential part of their rules of thinking. (shrink)

It has been known since the seventies that the formulas of modal logic are invariant for bisimulations between possible worlds models — while conversely, all bisimulation-invariant first-order formulas are modally definable. In this paper, we extend this semantic style of analysis from modal formulas to dynamic program operations. We show that the usual regular operations are safe for bisimulation, in the sense that the transition relations of their values respect any given bisimulation for their arguments. Our main result is a (...) complete syntactic characterization of all first-order definable program operations that are safe for bisimulation. This is a semantic functional completeness result for programming, which may be contrasted with the more usual analysis in terms of computational power. The 'Safety Theorem' can be modulated in several ways. We conclude with a list of variants, extensions, and further developments. (shrink)

This paper describes formalizations of Tait's normalization proof for the simply typed λ-calculus in the proof assistants Minlog, Coq and Isabelle/HOL. From the formal proofs programs are machine-extracted that implement variants of the well-known normalization-by-evaluation algorithm. The case study is used to test and compare the program extraction machineries of the three proof assistants in a non-trivial setting.

Hilbert’s program was an ambitious and wide-ranging project in the philosophy and foundations of mathematics. In order to “dispose of the foundational questions in mathematics once and for all,” Hilbert proposed a two-pronged approach in 1921: first, classical mathematics should be formalized in axiomatic systems; second, using only restricted, “finitary” means, one should give proofs of the consistency of these axiomatic systems. Although Gödel’s incompleteness theorems show that the program as originally conceived cannot be carried out, it had many (...) partial successes, and generated important advances in logical theory and metatheory, both at the time and since. The article discusses the historical background and development of Hilbert’s program, its philosophical underpinnings and consequences, and its subsequent development and influences since the 1930s. (shrink)

This volume is a tribute by his peers, and by younger scholars of the next generation, to Harvey M. Friedman, perhaps the most profound foundationalist since Kurt Godel. Friedman's researches, beginning precociously in his mid-teens, have fundamentally shaped our contemporary understanding of set theory, recursion theory, model theory, proof theory and metamathematics. His achievements in concept formation and theory formulation have also renewed the standard set by Godel and Alfred Tarski for the general intellectual interest and importance of technical work (...) in foundations. Friedman pioneered the now well-established and flourishing field of Reverse Mathematics, whose aim is to calibrate the intrinsic logico-mathematical consistency-strength of all the important theorems of mathematics. He has relentlessly pursued the full extent of the incompleteness phenomena into which Godel provided the first revealing glimpse. The Godel--Friedman program, as it is now deservingly called, seeks to find simple, natural and elegant mathematical statements of a combinatorial nature, that can be proved to be independent of set theory even when extended by powerful large-cardinal existence axioms. (shrink)

Hilbert's finitist program was not created at the beginning of the twenties solely to counteract Brouwer's intuitionism, but rather emerged out of broad philosophical reflections on the foundations of mathematics and out of detailed logical work; that is evident from notes of lecture courses that were given by Hilbert and prepared in collaboration with Bernays during the period from 1917 to 1922. These notes reveal a dialectic progression from a critical logicism through a radical constructivism toward finitism; the progression (...) has to be seen against the background of the stunning presentation of mathematical logic in the lectures given during the winter term 1917/18. In this paper, I sketch the connection of Hilbert's considerations to issues in the foundations of mathematics during the second half of the 19th century, describe the work that laid the basis of modern mathematical logic, and analyze the first steps in the new subject of proof theory. A revision of the standard view of Hilbert's and Bernays's contributions to the foundational discussion in our century has long been overdue. It is almost scandalous that their carefully worked out notes have not been used yet to understand more accurately the evolution of modern logic in general and of Hilbert's Program in particular. One conclusion will be obvious: the dogmatic formalist Hilbert is a figment of historical (de)construction! Indeed, the study and analysis of these lectures reveal a depth of mathematical-logical achievement and of philosophical reflection that is remarkable. In the course of my presentation many questions are raised and many more can be explored; thus, I hope this paper will stimulate interest for new historical and systematic work. (shrink)

In this book – the first of three volumes – Franco Archibugi sets out to create an epistemology of economics, arguing for a radical overturning of the conventional analysis from a “positive” approach to a “programming” approach. This overturning leads to a reappraisal of the foundations of Economics itself, and to an improved integration of Economics as an autonomous discipline alongside Sociology, Political Science, Operational Research, Social Engineering and Physical or Spatial Planning. The author interrogates how scientific the social (...) sciences really are before proposing a new scientific paradigm for the social sciences, a political preference function and a general programming approach. The chapters revisit hitherto neglected economists like Gunnar Myrdal, Ragnar Frisch, Vassili Leontief, and Leif Johansen, using their theory to overturn the epistemological approach of the entire science of economics. Volume II explores oppositions to the traditional and conventional teaching of economics, whilst Volume III presents a concrete and practical example of how to build a Planning Accounting Framework, as associated with Frisch’s ‘plan-frame’, to demonstrate the extent to which decisions and negotiations can be routed in the social sciences. (shrink)