Fuzzy social choice theory is useful for modeling the uncertainty and imprecision prevalent in social life yet it has been scarcely applied and studied in the social sciences. Filling this gap, Application of Fuzzy Logic to Social Choice Theory provides a comprehensive study of fuzzy social choice theory. The book explains the concept of a fuzzy maximal subset of a set of alternatives, fuzzy choice functions, the factorization of a fuzzy preference relation into the "union" (conorm) of a strict fuzzy relation and an indifference operator, fuzzy non-Arrowian results, fuzzy versions of Arrow's theorem, and Black's median voter theorem for fuzzy preferences. It examines how unambiguous and exact choices are generated by fuzzy preferences and whether exact choices induced by fuzzy preferences satisfy certain plausible rationality relations. The authors also extend known Arrowian results involving fuzzy set theory to results involving intuitionistic fuzzy sets as well as the Gibbard-Satterthwaite theorem to the case of fuzzy weak preference relations. The final chapter discusses Georgescu's degree of similarity of two fuzzy choice functions.

Originally published in 1931. This inquiry investigates and develops John Cook Wilson's view of the province of logic. It bases the study on the posthumous collected papers Statement and Inference. The author seeks to answer questions on the nature of logic using Cook Wilson's thought. The chapters introduce and consider topics from metaphysics to grammar and from psychology to knowledge. An early conception of logic in the sciences and presenting the work of an important twentieth century philosopher, this is an engaging work.

This book addresses the argument in the history of the philosophy of science between the positivists and the anti-positivists. The author starts from a point of firm conviction that all science and philosophy must start with the given... But that the range of the given is not definite. He begins with an examination of science from the outside and then the inside, explaining his position on metaphysics and attempts to formulate the character of operational acts before a general theory of symbolism is explored. The last five chapters constitute a treatise to show that the development from one stage of symbolismto the next is inevitable, consequently that explanatory science represents the culmination of knowledge.

Originally published in 1973. This book presents a valid mode of reasoning that is different to mathematical probability. This inductive logic is investigated in terms of scientific investigation. The author presents his criteria of adequacy for analysing inductive support for hypotheses and discusses each of these criteria in depth. The chapters cover philosophical problems and paradoxes about experimental support, probability and justifiability, ending with a system of logical syntax of induction. Each section begins with a summary of its contents and there is a glossary of technical terms to aid the reader.

Originally published in 1981. This is a book for the final year undergraduate or first year graduate who intends to proceed with serious research in philosophical logic. It will be welcomed by both lecturers and students for its careful consideration of main themes ranging from Gricean accounts of meaning to two dimensional modal logic. The first part of the book is concerned with the nature of the semantic theorist's project, and particularly with the crucial concepts of meaning, truth, and semantic structure. The second and third parts deal with various constructions that are found in natural languages: names, quantifiers, definite descriptions, and modal operators. Throughout, while assuming some familiarity with philosophical logic and elementary formal logic, the text provides a clear exposition. It brings together related ideas, and in some places refines and improves upon existing accounts.

Originally published in 1966. This is a self-instructional course intended for first-year university students who have not had previous acquaintance with Logic. The book deals with "propositional" logic by the truth-table method, briefly introducing axiomatic procedures, and proceeds to the theory of the syllogism, the logic of one-place predicates, and elementary parts of the logic of many-place predicates. Revision material is provided covering the main parts of the course. The course represents from eight to twenty hours work. depending on the student's speed of work and on whether optional chapters are taken.

Originally published in 1965. This is a textbook of modern deductive logic, designed for beginners but leading further into the heart of the subject than most other books of the kind. The fields covered are the Propositional Calculus, the more elementary parts of the Predicate Calculus, and Syllogistic Logic treated from a modern point of view. In each of the systems discussed the main emphases are on Decision Procedures and Axiomatisation, and the material is presented with as much formal rigour as is compatible with clarity of exposition. The techniques used are not only described but given a theoretical justification. Proofs of Consistency, Completeness and Independence are set out in detail. The fundamental characteristics of the various systems studies, and their relations to each other are established by meta-logical proofs, which are used freely in all sections of the book. Exercises are appended to most of the chapters, and answers are provided.

This volume honours the life and work of Solomon Feferman, one of the most prominent mathematical logicians of the latter half of the 20th century. In the collection of essays presented here, researchers examine Feferman's work on mathematical as well as specific methodological and philosophical issues that tie into mathematics. Feferman's work was largely based in mathematical logic (namely model theory, set theory, proof theory and computability theory), but also branched out into methodological and philosophical issues, making it well known beyond the borders of the mathematics community. With regard to methodological issues, Feferman supported concrete projects. On the one hand, these projects calibrate the proof theoretic strength of subsystems of analysis and set theory and provide ways of overcoming the limitations imposed by Goedel's incompleteness theorems through appropriate conceptual expansions. On the other, they seek to identify novel axiomatic foundations for mathematical practice, truth theories, and category theory. In his philosophical research, Feferman explored questions such as "What is logic?" and proposed particular positions regarding the foundations of mathematics including, for example, his "conceptual structuralism." The contributing authors of the volume examine all of the above issues. Their papers are accompanied by an autobiography presented by Feferman that reflects on the evolution and intellectual contexts of his work. The contributing authors critically examine Feferman's work and, in part, actively expand on his concrete mathematical projects. The volume illuminates Feferman's distinctive work and, in the process, provides an enlightening perspective on the foundations of mathematics and logic.

Regression Analysis and Its Application: A Data-Oriented Approach answers the need for researchers and students who would like a better understanding of classical regression analysis. Useful either as a textbook or as a reference source, this book bridges the gap between the purely theoretical coverage of regression analysis and its practical application. The book presents regression analysis in the general context of data analysis. Using a teach-by-example format, it contains ten major data sets along with several smaller ones to illustrate the common characteristics of regression data and properties of statistics that are employed in regression analysis. The book covers model misspecification, residual analysis, multicollinearity, and biased regression estimators. It also focuses on data collection, model assumptions, and the interpretation of parameter estimates. Complete with an extensive bibliography, Regression Analysis and Its Application is suitable for statisticians, graduate and upper-level undergraduate students, and research scientists in biometry, business, ecology, economics, education, engineering, mathematics, physical sciences, psychology, and sociology. In addition, data collection agencies in the government and private sector will benefit from the book.

For computer scientists, especially those in the security field, the use of chaos has been limited to the computation of a small collection of famous but unsuitable maps that offer no explanation of why chaos is relevant in the considered contexts. Discrete Dynamical Systems and Chaotic Machines: Theory and Applications shows how to make finite machines, such as computers, neural networks, and wireless sensor networks, work chaotically as defined in a rigorous mathematical framework. Taking into account that these machines must interact in the real world, the authors share their research results on the behaviors of discrete dynamical systems and their use in computer science. Covering both theoretical and practical aspects, the book presents: Key mathematical and physical ideas in chaos theory Computer science fundamentals, clearly establishing that chaos properties can be satisfied by finite state machines Concrete applications of chaotic machines in computer security, including pseudorandom number generators, hash functions, digital watermarking, and steganography Concrete applications of chaotic machines in wireless sensor networks, including secure data aggregation and video surveillance Until the authors' recent research, the practical implementation of the mathematical theory of chaos on finite machines raised several issues. This self-contained book illustrates how chaos theory enables the study of computer security problems, such as steganalysis, that otherwise could not be tackled. It also explains how the theory reinforces existing cryptographically secure tools and schemes.

This introduction to mathematical logic takes Goedel's incompleteness theorem as a starting point. It goes beyond a standard text book and should interest everyone from mathematicians to philosophers and general readers who wish to understand the foundations and limitations of modern mathematics.

Wearing Gauss's Jersey focuses on "Gauss problems," problems that can be very tedious and time consuming when tackled in a traditional, straightforward way but if approached in a more insightful fashion, can yield the solution much more easily and elegantly. The book shows how mathematical problem solving can be fun and how students can improve their mathematical insight, regardless of their initial level of knowledge. Illustrating the underlying unity in mathematics, it also explores how problems seemingly unrelated on the surface are actually extremely connected to each other. Each chapter starts with easy problems that demonstrate the simple insight/mathematical tools necessary to solve problems more efficiently. The text then uses these simple tools to solve more difficult problems, such as Olympiad-level problems, and develop more complex mathematical tools. The longest chapters investigate combinatorics as well as sequences and series, which are some of the most well-known Gauss problems. These topics would be very tedious to handle in a straightforward way but the book shows that there are easier ways of tackling them.

Intellectual property owners must continually exploit new ways of reproducing, distributing, and marketing their products. However, the threat of piracy looms as a major problem with digital distribution and storage technologies. Multimedia Encryption and Authentication Techniques and Applications covers current and future trends in the design of modern systems that use encryption and authentication to protect multimedia content. Containing the works of contributing authors who are worldwide experts in their fields, this volume is intended for researchers and practitioners, as well as for those who want a broad understanding of multimedia security. In the wake of the explosive growth of digital entertainment and Internet applications, this book is a definitive resource for scientists, researchers, programmers, engineers, business managers, entrepreneurs, and investors. Features Describes and evaluates the state of the art in multimedia encryption and authentication techniques and related technologies, architectures, standards, and applications Includes advanced topics, such as chaotic encryption techniques for digital images and video, as well as streaming media encryption Focuses on digital rights management issues for video and for consumer devices Covers key management and protection for IP multimedia, digital media fingerprinting, and signature-based media authentication

This book on proof theory centers around the legacy of Kurt Schutte and its current impact on the subject. Schutte was the last doctoral student of David Hilbert who was the first to see that proofs can be viewed as structured mathematical objects amenable to investigation by mathematical methods (metamathematics). Schutte inaugurated the important paradigm shift from finite proofs to infinite proofs and developed the mathematical tools for their analysis. Infinitary proof theory flourished in his hands in the 1960s, culminating in the famous bound 0 for the limit of predicative mathematics (a fame shared with Feferman). Later his interests shifted to developing infinite proof calculi for impredicative theories. Schutte had a keen interest in advancing ordinal analysis to ever stronger theories and was still working on some of the strongest systems in his eighties. The articles in this volume from leading experts close to his research, show the enduring influence of his work in modern proof theory. They range from eye witness accounts of his scientific life to developments at the current research frontier, including papers by Schutte himself that have never been published before.

Presents Results from a Very Active Area of Research Exploring an active area of mathematics that studies the complexity of equivalence relations and classification problems, Invariant Descriptive Set Theory presents an introduction to the basic concepts, methods, and results of this theory. It brings together techniques from various areas of mathematics, such as algebra, topology, and logic, which have diverse applications to other fields. After reviewing classical and effective descriptive set theory, the text studies Polish groups and their actions. It then covers Borel reducibility results on Borel, orbit, and general definable equivalence relations. The author also provides proofs for numerous fundamental results, such as the Glimm-Effros dichotomy, the Burgess trichotomy theorem, and the Hjorth turbulence theorem. The next part describes connections with the countable model theory of infinitary logic, along with Scott analysis and the isomorphism relation on natural classes of countable models, such as graphs, trees, and groups. The book concludes with applications to classification problems and many benchmark equivalence relations. By illustrating the relevance of invariant descriptive set theory to other fields of mathematics, this self-contained book encourages readers to further explore this very active area of research.

Researchers and practitioners of cryptography and information security are constantly challenged to respond to new attacks and threats to information systems. Authentication Codes and Combinatorial Designs presents new findings and original work on perfect authentication codes characterized in terms of combinatorial designs, namely strong partially balanced designs (SPBD). Beginning with examples illustrating the concepts of authentication schemes and combinatorial designs, the book considers the probability of successful deceptions followed by schemes involving three and four participants, respectively. From this point, the author constructs the perfect authentication schemes and explores encoding rules for such schemes in some special cases. Using rational normal curves in projective spaces over finite fields, the author constructs a new family of SPBD. He then presents some established combinatorial designs that can be used to construct perfect schemes, such as t-designs, orthogonal arrays of index unity, and designs constructed by finite geometry. The book concludes by studying definitions of perfect secrecy, properties of perfectly secure schemes, and constructions of perfect secrecy schemes with and without authentication. Supplying an appendix of construction schemes for authentication and secrecy schemes, Authentication Codes and Combinatorial Designs points to new applications of combinatorial designs in cryptography.

Boolean algebras have historically played a special role in the development of the theory of general or "universal" algebraic systems, providing important links between algebra and analysis, set theory, mathematical logic, and computer science. It is not surprising then that focusing on specific properties of Boolean algebras has lead to new directions in universal algebra. In the first unified study of polynomial completeness, Polynomial Completeness in Algebraic Systems focuses on and systematically extends another specific property of Boolean algebras: the property of affine completeness. The authors present full proof that all affine complete varieties are congruence distributive and that they are finitely generated if and only if they can be presented using only a finite number of basic operations. In addition to these important findings, the authors describe the different relationships between the properties of lattices of equivalence relations and the systems of functions compatible with them. An introductory chapter surveys the appropriate background material, exercises in each chapter allow readers to test their understanding, and open problems offer new research possibilities. Thus Polynomial Completeness in Algebraic Systems constitutes an accessible, coherent presentation of this rich topic valuable to both researchers and graduate students in general algebraic systems.

For propositional logic it can be decided whether a formula has a deduction from a finite set of other formulas. This volume begins with a method to decide this for the quantified formulas of those fragments of arithmetic which express the properties of order-plus-successor and of order-plus-addition (Pressburger arithmetic). It makes use of an algorithm eliminating quantifiers which, in turn, is also applied to obtain consistency proofs for these fragments.

In this volume, logic starts from the observation that in everyday arguments, as brought forward by say a lawyer, statements are transformed linguistically, connecting them in formal ways irrespective of their contents. Understanding such arguments as deductive situations, or "sequents" in the technical terminology, the transformations between them can be expressed as logical rules. The book concludes with the algorithms producing the results of Gentzen's midsequent theorem and Herbrand's theorem for prenex formulas.

The huge number and broad range of the existing and potential applications of fuzzy logic have precipitated a veritable avalanche of books published on the subject. Most, however, focus on particular areas of application. Many do no more than scratch the surface of the theory that holds the power and promise of fuzzy logic. Fuzzy Automata and Languages: Theory and Applications offers the first in-depth treatment of the theory and mathematics of fuzzy automata and fuzzy languages. After introducing background material, the authors study max-min machines and max-product machines, developing their respective algebras and exploring properties such as equivalences, homomorphisms, irreducibility, and minimality. The focus then turns to fuzzy context-free grammars and languages, with special attention to trees, fuzzy dendrolanguage generating systems, and normal forms. A treatment of algebraic fuzzy automata theory follows, along with additional results on fuzzy languages, minimization of fuzzy automata, and recognition of fuzzy languages. Although the book is theoretical in nature, the authors also discuss applications in a variety of fields, including databases, medicine, learning systems, and pattern recognition. Much of the information on fuzzy languages is new and never before presented in book form. Fuzzy Automata and Languages incorporates virtually all of the important material published thus far. It stands alone as a complete reference on the subject and belongs on the shelves of anyone interested in fuzzy mathematics or its applications.

This is the first comprehensive treatment of subjective logic and all its operations. The author developed the approach, and in this book he first explains subjective opinions, opinion representation, and decision-making under vagueness and uncertainty, and he then offers a full definition of subjective logic, harmonising the key notations and formalisms, concluding with chapters on trust networks and subjective Bayesian networks, which when combined form general subjective networks. The author shows how real-world situations can be realistically modelled with regard to how situations are perceived, with conclusions that more correctly reflect the ignorance and uncertainties that result from partially uncertain input arguments. The book will help researchers and practitioners to advance, improve and apply subjective logic to build powerful artificial reasoning models and tools for solving real-world problems. A good grounding in discrete mathematics is a prerequisite.

This book provides an introduction to some key subjects in algebra and topology. It consists of comprehensive texts of some hours courses on the preliminaries for several advanced theories in (categorical) algebra and topology. Often, this kind of presentations is not so easy to find in the literature, where one begins articles by assuming a lot of knowledge in the field. This volume can both help young researchers to quickly get into the subject by offering a kind of " roadmap " and also help master students to be aware of the basics of other research directions in these fields before deciding to specialize in one of them. Furthermore, it can be used by established researchers who need a particular result for their own research and do not want to go through several research papers in order to understand a single proof. Although the chapters can be read as " self-contained " chapters, the authors have tried to coordinate the texts in order to make them complementary. The seven chapters of this volume correspond to the seven courses taught in two Summer Schools that took place in Louvain-la-Neuve in the frame of the project Fonds d'Appui a l'Internationalisation of the Universite catholique de Louvain to strengthen the collaborations with the universities of Coimbra, Padova and Poitiers, within the Coimbra Group.

Algorithms and Theory of Computation Handbook, Second Edition: Special Topics and Techniques provides an up-to-date compendium of fundamental computer science topics and techniques. It also illustrates how the topics and techniques come together to deliver efficient solutions to important practical problems. Along with updating and revising many of the existing chapters, this second edition contains more than 15 new chapters. This edition now covers self-stabilizing and pricing algorithms as well as the theories of privacy and anonymity, databases, computational games, and communication networks. It also discusses computational topology, natural language processing, and grid computing and explores applications in intensity-modulated radiation therapy, voting, DNA research, systems biology, and financial derivatives. This best-selling handbook continues to help computer professionals and engineers find significant information on various algorithmic topics. The expert contributors clearly define the terminology, present basic results and techniques, and offer a number of current references to the in-depth literature. They also provide a glimpse of the major research issues concerning the relevant topics.

In order to perform effective analysis of today’s information security systems, numerous components must be taken into consideration. This book presents a well-organized, consistent solution created by the author, which allows for precise multilevel analysis of information security systems and accounts for all of the significant details. Enabling the multilevel modeling of secure systems, the quality of protection modeling language (QoP-ML) approach provides for the abstraction of security systems while maintaining an emphasis on quality protection. This book introduces the basis of the QoP modeling language along with all the advanced analysis modules, syntax, and semantics. It delineates the steps used in cryptographic protocols and introduces a multilevel protocol analysis that expands current understanding. Introduces quality of protection evaluation of IT Systems Covers the financial, economic, and CO2 emission analysis phase Supplies a multilevel analysis of Cloud-based data centers Details the structures for advanced communication modeling and energy analysis Considers security and energy efficiency trade-offs for the protocols of wireless sensor network architectures Includes case studies that illustrate the QoP analysis process using the QoP-ML Examines the robust security metrics of cryptographic primitives Compares and contrasts QoP-ML with the PL/SQL, SecureUML, and UMLsec approaches by means of the SEQUAL framework The book explains the formal logic for representing the relationships between security mechanisms in a manner that offers the possibility to evaluate security attributes. It presents the architecture and API of tools that ensure automatic analysis, including the automatic quality of protection analysis tool (AQoPA), crypto metrics tool (CMTool), and security mechanisms evaluation tool (SMETool). The book includes a number of examples and case studies that illustrate the QoP analysis process by the QoP-ML. Every operation defined by QoP-ML is described within parameters of security metrics to help you better evaluate the impact of each operation on your system's security.