Matematisk logik

The requirement to reason logically forms the basis of all mathematics, and hence mathematical logic is one of the most fundamental topics that students will study. Assuming no prior knowledge of the topic, this book provides an accessible introdu...

Läs mer »

The requirement to reason logically forms the basis of all mathematics, and hence mathematical logic is one of the most fundamental topics that students will study. Assuming no prior knowledge of the topic, this book provides an accessible introdu...

Läs mer »

Douglas Hofstadter's book is concerned directly with the nature of maps" or links between formal systems. However, according to Hofstadter, the formal system that underlies all mental activity transcends the system that supports it. If life c...

Läs mer »

Written in a clear, precise and user-friendly style, Logic as a Tool: A Guide to Formal Logical Reasoning is intended for undergraduates in both mathematics and computer science, and will guide them to learn, understand and master the use of class...

Läs mer »

A perennial bestseller by eminent mathematician G. Polya, How to Solve It will show anyone in any field how to think straight. In lucid and appealing prose, Polya reveals how the mathematical method of demonstrating a proof or finding an unknown c...

Läs mer »

This textbook offers an introduction to the philosophy of science. It helps undergraduate students from the natural, the human and social sciences to gain an understanding of what science is, how it has developed, what its core traits are, how to ...

Läs mer »

Programming Legend Charles Petzold unlocks the secrets of the extraordinary and prescient 1936 paper by Alan M. Turing Mathematician Alan Turing invented an imaginary computer known as the Turing Machine; in an age before computers, he explored th...

Läs mer »

Semantic tableaux are used because they are theoretically sound and easy to understand The Third Edition has new chapters on SAT solvers and model checking Supplementary materials: Prolog source code for the algorithms and answers to the exercises...

Läs mer »

The foundations of mathematics include mathematical logic, set theory, recursion theory, model theory, and Gdel's incompleteness theorems. Professor Wolf provides here a guide that any interested reader with some post-calculus experience in mathem...

Läs mer »

In the last 60 years, the use of the notion of category has led to a remarkable unification and simplification of mathematics. Conceptual Mathematics introduces this tool for the learning, development, and use of mathematics, to beginning students...

Läs mer »

An array of general ideas useful in a wide variety of fields. Starting from the foundations, this book illuminates the concepts of category, functor, natural transformation, and duality. It then turns to adjoint functors, which provide a descripti...

Läs mer »

Assuming no previous study in logic, this informal yet rigorous text covers the material of a standard undergraduate first course in mathematical logic, using natural deduction and leading up to the completeness theorem for first-order logic.

Läs mer »

"Among the many expositions of Goedel's incompleteness theorems written for non-specialists, this book stands apart. With exceptional clarity, Franzen gives careful, non-technical explanations both of what those theorems say and, more importa...

Läs mer »

Only minimal background in mathematics necessary Careful selection of material that is really needed by students in the first two years of their university life in Computer Science and Information Sciences Brings out the interplay between qualitat...

Läs mer »

This textbook provides a concise and self-contained introduction to mathematical logic, with a focus on the fundamental topics in first-order logic and model theory. Including examples from several areas of mathematics (algebra, linear algebra and...

Läs mer »

This book describes established and advanced methods for reducing the dimensionality of numerical databases. Each description starts from intuitive ideas, develops the necessary mathematical details, and ends by outlining the algorithmic implement...

Läs mer »

For more than two generations, W. V. Quine has contributed fundamentally to the substance, the pedagogy, and the philosophy of mathematical logic. Selected Logic Papers, long out of print and now reissued with eight additional essays, includes muc...

Läs mer »

Many students have trouble the first time they take a mathematics course in which proofs play a significant role. This new edition of Velleman's successful text will prepare students to make the transition from solving problems to proving theorems...

Läs mer »

Through its engaging and unusual problems, this book demonstrates methods of reasoning necessary for learning number theory. Every technique is followed by problems (as well as detailed hints and solutions) that apply theorems immediately, so read...

Läs mer »

Graham Priest shows that formal logic is a powerful, exciting part of modern philosophy a tool for thinking about everything from the existence of God and the reality of time to paradoxes of probability. Explaining formal logic in simple, non-tech...

Läs mer »

Kurt Gdel (1906 - 1978) was a logician, mathematician and philosopher. He is regarded as one of the most significant logicians of all time, whose work has had immense impact upon scientific and philosophical thinking in the 20th century. Gdel is b...

Läs mer »

The area of coalgebra has emerged within theoretical computer science with a unifying claim: to be the mathematics of computational dynamics. It combines ideas from the theory of dynamical systems and from the theory of state-based computation. Al...

Läs mer »

Computability and Logic has become a classic because of its accessibility to students without a mathematical background and because it covers not simply the staple topics of an intermediate logic course, such as Godel's incompleteness theorems, bu...

Läs mer »

Proof complexity is a rich subject drawing on methods from logic, combinatorics, algebra and computer science. This self-contained book presents the basic concepts, classical results, current state of the art and possible future directions in the ...

Läs mer »

Combinatory logic and lambda-calculus, originally devised in the 1920s, have since developed into linguistic tools, especially useful in programming languages. The authors' previous book served as the main reference for introductory courses on lam...

Läs mer »

An anthology of papers on undecidability and unsolvability by major figures, this reference is suited as a text for graduate and undergraduate courses in logic, philosophy, and foundations of mathematics. Slightly corrected republication of the ed...

Läs mer »

This book presents and applies a framework for studying the complexity of algorithms. It is aimed at logicians, computer scientists, mathematicians and philosophers interested in the theory of computation and its foundations, and it is written at ...

Läs mer »

Classical logic is concerned, loosely, with the behaviour of truths. Epistemic logic similarly is about the behaviour of known or believed truths. Justification logic is a theory of reasoning that enables the tracking of evidence for statements an...

Läs mer »

First English translation of revolutionary paper (1931) that established unprovability of certain propositions in any arithmetical system.

Läs mer »

En introduktion till Gödels liv och tänkande, den man som för alltid förändrade matematiken. Kurt Gödel betraktas allmänt som den störste logikern sedan Aristoteles. Hans ofullständighetsteorem från 1931 bevisade att det i varje formellt system fö...

Läs mer »