Im Jahr 1931 erschien im Monatsheft für Mathematik und Physik ein Artikel mit dem geheimnisvoll klingenden Titel Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I.
The past fifteen years has witnessed an explosive growth in the fundamental research and applications of artificial neural networks (ANNs) and fuzzy logic (FL).
Relation theory originates with Hausdorff (Mengenlehre 1914) and Sierpinski (Nombres transfinis, 1928) with the study of order types, specially among chains = total orders = linear orders.
Researchers and practitioners of cryptography and information security are constantly challenged to respond to new attacks and threats to information systems.
This is the first volume in a suite of short, inexpensive, paperbound volumes intended for student usage as textbooks, or course supplements, and for purchase as single-copy reference works for professionals in specific disciplines, and, in some cases, for interdisciplinary use.
In this book the authors present an alternative set theory dealing with a more relaxed notion of infiniteness, called finitely supported mathematics (FSM).
The purpose of this book is to provide the reader who is interested in applications of fuzzy set theory, in the first place with a text to which he or she can refer for the basic theoretical ideas, concepts and techniques in this field and in the second place with a vast and up to date account of the literature.
Containing data on number theory, encryption schemes, and cyclic codes, this highly successful textbook, proven by the authors in a popular two-quarter course, presents coding theory, construction, encoding, and decoding of specific code families in an "e;easy-to-use"e; manner appropriate for students with only a basic background in mathematics offerin
In this revolutionary work, the author sets the stage for the science ofthe 21st Century, pursuing an unprecedented synthesis of fields previouslyconsidered unrelated.
Alexander Grothendieck is often considered one of the greatest mathematicians of the twentieth century (if not all time), and his unique vision continues to impact and inspire many fields and researchers today.
The study of random sets is a large and rapidly growing area with connections to many areas of mathematics and applications in widely varying disciplines, from economics and decision theory to biostatistics and image analysis.
Mathematical Logic for Computer Science is a mathematics textbook with theorems and proofs, but the choice of topics has been guided by the needs of students of computer science.
The most comprehensive account of the mathematician's life and workJohn Napier (1550-1617) is celebrated today as the man who invented logarithms-an enormous intellectual achievement that would soon lead to the development of their mechanical equivalent in the slide rule: the two would serve humanity as the principal means of calculation until the mid-1970s.
The book has two parts: In the first, after a review of some seminal classical accounts of laws and explanations, a new account is proposed for distinguishing between laws and accidental generalizations (LAG).
Dieses Buch über elementare Aussagenlogik (wie auch seine geplante Fortsetzung über Elementare Prädikatenlogik und Universelle Algebra) ist aus Vorlesungen an der Technischen Universität München entstanden.