You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Romantic love presents some of life's most challenging questions. Can we choose who to love? Is romantic love rational? Can we love more than one person at a time? And can we make ourselves fall out of love? In On Romantic Love, Berit Brogaard attempts to get to the bottom of love's many contradictions. This short book, informed by both historical and cutting edge philosophy, psychology, and neuroscience, combines a new theory of romantic love with entertaining anecdotes from real life and accessible explanations of the neuroscience underlying our wildest passions. Against the grain, Brogaard argues that love is an emotion; that it can be, at turns, both rational and irrational; and that it ...
ETAPS 2001 was the fourth instance of the European Joint Conferences on Theory and Practice of Software. ETAPS is an annual federated conference that was established in 1998 by combining a number of existing and new conferences. This year it comprised ve conferences (FOSSACS, FASE, ESOP, CC, TACAS), ten satellite workshops (CMCS, ETI Day, JOSES, LDTA, MMAABS, PFM, RelMiS, UNIGRA, WADT, WTUML), seven invited lectures, a debate, and ten tutorials. The events that comprise ETAPS address various aspects of the system de- lopment process, including speci cation, design, implementation, analysis, and improvement. The languages, methodologies, and tools which support these - tivities are all well within its scope. Di erent blends of theory and practice are represented, with an inclination towards theory with a practical motivation on one hand and soundly-based practice on the other. Many of the issues involved in software design apply to systems in general, including hardware systems, and the emphasis on software is not intended to be exclusive.
This volume contains the proceedings of the Third International Conference on Algebraic and Logic Programming, held in Pisa, Italy, September 2-4, 1992. Like the two previous conferences in Germany in 1988 and France in 1990, the third conference aims at strengthening the connections betweenalgebraic techniques and logic programming. On the one hand, logic programming has been very successful during the last decades and more and more systems compete in enhancing its expressive power. On the other hand, concepts like functions, equality theory, and modularity are particularly well handled in an algebraic framework. Common foundations of both approaches have recently been developed, and this conference is a forum for people from both areas to exchange ideas, results, and experiences. The book covers the following topics: semantics ofalgebraic and logic programming; integration of functional and logic programming; term rewriting, narrowing, and resolution; constraintlogic programming and theorem proving; concurrent features in algebraic and logic programming languages; and implementation issues.
This book constitutes the refereed proceedings of the First Asian Symposium on Programming Languages and Systems, APLAS 2003, held in Beijing, China in November 2003. The 24 revised full papers presented together with abstracts of 3 invited talks were carefully reviewed and selected from 75 submissions. The papers are devoted to concurrency and parallelism, language implementation and optimization, mobile computation and security, program analysis and verification, program transformation and calculation, programming paradigms and language design, programming techniques and applications, program semantics, categorical and logical foundations, tools and environments, type theory and type systems.
This volume tackles Gödel's two-stage project of first using Husserl's transcendental phenomenology to reconstruct and develop Leibniz' monadology, and then founding classical mathematics on the metaphysics thus obtained. The author analyses the historical and systematic aspects of that project, and then evaluates it, with an emphasis on the second stage. The book is organised around Gödel's use of Leibniz, Husserl and Brouwer. Far from considering past philosophers irrelevant to actual systematic concerns, Gödel embraced the use of historical authors to frame his own philosophical perspective. The philosophies of Leibniz and Husserl define his project, while Brouwer's intuitionism is its...
The New Yearbook for Phenomenology and Phenomenological Philosophy provides an annual international forum for phenomenological research in the spirit of Husserl's groundbreaking work and the extension of this work by such figures as Scheler, Heidegger, Sartre, Levinas, Merleau-Ponty and Gadamer.
This book constitutes the refereed proceedings of the 20th International Workshop on Computer Science Logic, CSL 2006, held as the 15th Annual Conference of the EACSL in Szeged, Hungary in September 2006. The 37 revised full papers presented together with 4 invited contributions were carefully reviewed and selected from 132 submissions. All current aspects of logic in computer science are addressed, including automated deduction and interactive theorem proving, constructive mathematics and type theory, equational logic and term rewriting, automata and formal logics, modal and temporal logic, model checking, logical aspects of computational complexity, finite model theory, computational proof theory, logic programming and constraints, lambda calculus and combinatory logic, categorical logic and topological semantics, domain theory, database theory, specification, extraction and transformation of programs, logical foundations of programming paradigms, verification of security protocols, linear logic, higher-order logic, nonmonotonic reasoning, as well as logics and type systems for biology.
This book constitutes the refereed proceedings of the 4th International Conference on Typed Lambda Calculi and Applications, TLCA'99, held in L'Aquila, Italy in April 1999. The 25 revised full papers presented were carefully reviewed and selected from a total of 50 submissions. Also included are two invited demonstrations. The volume reports research results on various aspects of typed lambda calculi. Among the topics addressed are noncommutative logics, type theory, algebraic data types, logical calculi, abstract data types, and subtyping.