Utvidet returrett til 31. januar 2025

Bøker utgitt av Kings College Publications

Filter
Filter
Sorter etterSorter Populære
  • av M Zakharyaschev
    273,-

  •  
    350,-

    This book collects most of the invited papers presented at the 12thInternational Congress of Logic, Methodology and Philosophy of Sciencein Oviedo, August 2003. It contains state of the art accounts of ongoingwork by a selection of the most renowned researchers in the field. Thepapers in the Logic section deal with topics in mathematical logic, aswell as philosophical logic, and the area of logic and computation. Thesection on General Methodology contains articles on models, theories,probability, induction, causation, and other topics. A number of papersdiscuss Philosophical Issues of Particular Sciences, such asmathematics, physics, linguistics, psychology, biology, and medicine.There is also a section on Ethics of Science, and papers from a specialsymposium on the Emergence of Scientific Medicine in the 19th-20th Century.

  • - An Introduction
    av M. Fernández
    207,-

    This book provides a concise introduction to the essential concepts in programming languages, using techniques from operational semantics. It is addressed to undergraduate students, as a complement to programming languages or operational semantics courses. There are three parts in the book, highlighting three major programming paradigms: - imperative languages: the main features of these languages are illustrated using Java, C, Pascal - functional languages: modern languages such as ML and Haskell are used to describe the functional style of programming - logic languages: the last part of the book gives an overview of logic programming using Prolog. After a general description of each family of languages, their semantics are studied using abstract machines and structural operational semantics. The book gives an in-depth analysis of the basic concepts in programming languages instead of a mere survey of languages, privileging the understanding of the basic techniques underlying the semantics of languages over simply describing their properties.

  • - An Introduction to the Logic of the Two Notions
    av Jaakko Hintikka
    242,-

    Knowledge and BeliefAn Introduction to the Logic of the Two Notionsby Jaakko HintikkaPrepared by Vincent F. Hendricks & John SymonsIn 1962 Jaakko Hintikka published Knowledge and Belief: An Introductionto the Logic of the Two Notions with Cornell University Press. Almostevery paper or a book on epistemic and doxastic logic that has appearedsince then has referred to this seminal work. Although many philosophersworking in logic, epistemology, game-theory, economics, computer scienceand linguistics mention the book, it is very likely that most have neverliterally had their hands on it, much less owned a copy. After a fourthprinting in 1969, Knowledge and Belief went out of print and as many ofus have found to our dismay, it has become increasingly difficult tofind used copies at our local shops or online. It is our pleasure toprovide the interdisciplinary community with this reprint edition ofKnowledge and Belief.Knowledge and Belief is a classic on which a generation - my generation- of epistemologists cut their teeth. This reissue is welcome. It willprovide something for the next generation to chew on. - Fred Dretske,Duke UniversityIt is wonderful to see this classic being reissued after so many yearsout of print. It was extremely influential in its day; its influencecontinues to this day, through the impact of epistemic logic in fieldsas diverse distributed computing, artificial intelligence, and gametheory. This reissue should make it possible for a new generation ofresearchers to appreciate Hintikka's groundbreaking work. - JosephHalpern, Cornell University

  • - From Philosophy to Poetics
    av Vincent F. Hendricks
    194,-

    Every day logic surrounds us. Used and abused at cocktail parties and dinner functions, in friendly conversations and verbal feuds, in science, in thinking and reflecting, logic is s a tool of mind. It is the language of thought. Logic is very human and concerns us all, even if it is not always used by man. Logical Lyrics: from Philosophy to Poetics is a collection of citations and aphorisms from all sorts of people - from Napoleon bonarparte to Human League - expressing their embracing, critical and humorous views on logic and logical matters. "I found this collection utterly absorbing from beginning to end. It combines some very sagacious ideas with some choice bits that are delightfully funny." Raymond M. Smullyan, New York " "If I were you, I would buy this book". What does that mean? It means, "buy this book." Why does it mean that? Perhaps this book will help you understand. Or perhaps not, but it will certainly be entertaining reading in the meantime." Melvin C. Fitting, CUNY, New York Logical Lyrics is an independent follow-up to Feisty Fragments: For Philosophy

  • av Chris Hankin
    207,-

    The lambda-calculus lies at the very foundations of computer science. Besides its historical role in computability theory it has had significant influence on programming language design and implementation, denotational semantics, and domain theory. The book emphasises the proof theory for the type-free lambda-calculus. The first six chapters concern this calculus and cover the basic theory, reduction, models, computability, and the relationship between the lambda-calculus and combinatory logic. Chapter 7 presents a variety of typed calculi; first the simply typed lambda-calculus, then Milner-style polymorphism and, finally, the polymorphic lambda-calculus. Chapter 8 concerns two variants of the type-free lambda-calculus that have appeared in the research literature: the lazy lambda-calculus, and the lambda sigma-calculus. The final chapter contains references and a guide to further reading. There are exercises throughout. In contrast to earlier books on these topics, which were written by logicians, this book is written from a computer science perspective and emphasises the practical relevance of many of the key theoretical ideas. The book is intended as a course text for final year undergraduates or first year graduate students in computer science. Research students should find it a useful introduction to more specialist literature.

  • av D. C. Makinson
    207,-

    Imagine a robot trying to size up a difficult situation, to find a way of responding. Its sensors receive streams of information from which it tries to reach judgements. If it relies on deduction alone, it will not get far, no matter how fast its inference engines; for even the most massive information is still typically incomplete: there are relevant issues that it does not resolve one way or the other.The robot, or human agent for that matter, needs to go beyond these limits. It needs to `go supraclassical', inferring more than is authorised by classical logic alone. But such inferences are inherently uncertain. They are also nonmonotonic, in the sense that the acquisition of further information, even when consistent with the existing stock, may lead us to abondon as well as add conclusions.Nonmonotonic logic is the study of such reasoning and has been the subject of intensive research for more than two decades. But for the newcomer it is still a disconcerting affair, lacking unity with many systems going in different directions.The purpose of this book is to take the mystery out of the subject, giving a clear overall picture of what is going on. It makes the essential ideas and main approaches to nonmonotonic logic accessible, and meaningful, to anyone with a few basic tools of discrete mathematics and a minimal background in classical propositional logic. It is written as a textbook, with detailed explanations, examples, comments, exercises and answers. Students and instructors alike will find it an invaluable guide.

  • av Kees Doets
    269,-

    Long ago, when Alexander the Great asked the mathematician Menaechmus for a crash course in geometry, he got the famous reply ``There is no royal road to mathematics.'' Where there was no shortcut for Alexander, there is no shortcut for us. Still, the fact that we have access to computers and mature programming languages means that there are avenues for us that were denied to the kings and emperors of yore.The purpose of this book is to teach logic and mathematical reasoning in practice, and to connect logical reasoning with computer programming in Haskell. Haskell emerged in the 1990s as a standard for lazy functional programming, a programming style where arguments are evaluated only when the value is actually needed. Haskell is a marvelous demonstration tool for logic and maths because its functional character allows implementations to remain very close to the concepts that get implemented, while the laziness permits smooth handling of infinite data structures.This book does not assume the reader to have previous experience with either programming or construction of formal proofs, but acquaintance with mathematical notation, at the level of secondary school mathematics is presumed. Everything one needs to know about mathematical reasoning or programming is explained as we go along. After proper digestion of the material in this book, the reader will be able to write interesting programs, reason about their correctness, and document them in a clear fashion. The reader will also have learned how to set up mathematical proofs in a structured way, and how to read and digest mathematical proofs written by others.This is the updated, expanded, and corrected second edition of a much-acclaimed textbook.Praise for the first edition:'Doets and van Eijck's ``The Haskell Road to Logic, Maths and Programming'' is an astonishingly extensive and accessible textbook on logic, maths, and Haskell.' Ralf Laemmel, Professor of Computer Science, University of Koblenz-Landau

  • av Thierry Lecroq & Christian Charras
    254,99

    String matching is a very important subject in the wider domain of text processing. It consists of finding one,or more generally, all the occurrences of a string (more generally called a pattern) in a text. The Handbook of Exact String Matching Algorithms presents 38 methods for solving this problem. For each, it gives the main features, a description, its C code, an example and references.

  • - Computer Citations
    av Vincent F. Hendricks
    173,-

    "hAS aNYONE sEEN MY cAPSLOCK kEY?" 500CC is a compilation of more than 500 citations on the experiences we have as computer users, abusers andInternet-cruisers---from rage and anger via joy, laughter and appreciationto despair and frustration.This volume completes Vincent F. Hendricks' trilogy of quotations including,besides 500CC: ComputerCitations, Feisty Fragments: For Philosophy, andLogical Lyrics: From Philosophy to Poetics.

  • - For Philosophy
    av Vincent F. Hendricks
    249,-

    Philosophers have had a way of sometimes obstructing the admirable endeavour of philosophy: To address the fundamental issues of human existence and the workings of nature. This obstruction is emphasized by suggesting rather odd and exotic prerequisites for solving a seemingly simple problem; a particular jargon in which no words occurring have less than seven syllables and by insane thought experiments. When the impenetrable jargon is paired up with ludicrous thought experiments and the philosopher at the same time continues to insist that he or she is addressing the fundamental problems of the human existence and condition, it begins to sound pretty much like the wizardry of Medieval alchemy. This is what Feisty Fragments echoes in words from Nietzsche to Einstein, from Catherine the Great to John F. Kennedy. Feisty Fragments is a collection of more than 250 quotations from people from all walks of life expressing their rather critical and often quite humorous takes on both philosophy and philosophers.

Gjør som tusenvis av andre bokelskere

Abonner på vårt nyhetsbrev og få rabatter og inspirasjon til din neste leseopplevelse.