Listing 1 - 10 of 337 | << page >> |
Sort by
|
Choose an application
Aimed at starting researchers in the field, Realizability gives a rigorous, yet reasonable introduction to the basic concepts of a field which has passed several successive phases of abstraction. Material from previously unpublished sources such as Ph. D. theses, unpublished papers, etc. has been molded into one comprehensive presentation of the subject area. - The first book to date on this subject area - Provides an clear introduction to Realizability with a comprehensive bibliography - Easy to read and mathematically rigorous - Written by an expert in the field.
Choose an application
This is a short, distinctive, modern, and motivated introduction to mathematical logic for senior undergraduate and beginning graduate students in mathematics and computer science. Any mathematician who is interested in knowing what logic is concerned with and who would like to learn Gödel's incompleteness theorems should find this book particularly convenient. The treatment is thoroughly mathematical, and the entire subject has been approached like a branch of mathematics. Serious efforts have been made to make the book suitable for the classroom as well as for self-reading. The book does not strive to be a comprehensive encyclopedia of logic. Still, it gives essentially all the basic concepts and results in mathematical logic. The book prepares students to branch out in several areas of mathematics related to foundations and computability such as logic, axiomatic set theory, model theory, recursion theory, and computability. The main prerequisite for this book is the willingness to work at a reasonable level of mathematical rigor and generality. Shashi Mohan Srivastava is a Professor at the Indian Statistical Institute, Kolkata, India. He is also the author of A Course on Borel Sets, GTM 180.
Mathematical logic --- wiskunde --- logica
Choose an application
Completeness is one of the most important notions in logic and the foundations of mathematics. Many variants of the notion have been de?ned in literature. We shallconcentrateonthesevariants,andaspects,of completenesswhicharede?ned in propositional logic. Completeness means the possibility of getting all correct and reliable sc- mata of inference by use of logical methods. The word all', seemingly neutral, is here a crucial point of distinction. Assuming the de?nition as given by E. Post we get, say, a global notion of completeness in which the reliability refers only to syntactic means of logic and outside the correct schemata of inference there are only inconsistent ones. It is impossible, however, to leave aside local aspects of the notion when we want to make it relative to some given or invented notion of truth. Completeness understood in this sense is the adequacy of logic in relation to some semantics, and the change of the logic is accompanied by the change of its semantics. Such completeness was e?ectively used by J. ?ukasiewicz and investigated in general terms by A. Tarski and A. Lindenbaum, which gave strong foundations for research in logic and, in particular, for the notion of consequence operation determined by a logical system. The choice of logical means, by use of which we intend to represent logical inferences, is also important. Most of the de?nitions and results in completeness theory were originally developed in terms of propositional logic. Propositional formal systems ?nd many applications in logic and theoretical computer science.
Mathematical logic --- wiskunde --- logica
Choose an application
Mathematical logic --- wiskunde --- logica
Choose an application
Mathematical logic --- wiskunde --- logica
Choose an application
A model theory that is independent of any concrete logical system allows a general handling of a large variety of logics. This generality can be achieved by applying the theory of institutions that provides a precise mathematical formulation for the intuitive concept of a logical system. Especially in computer science, where the development of a huge number of specification logics is observable, institution-independent model theory simplifies and sometimes even enables a concise model-theoretic analysis of the system. Besides incorporating important methods and concepts from conventional model theory, the proposed top-down methodology allows for a structurally clean understanding of model-theoretic phenomena. As a consequence, results from conventional concrete model theory can be understood more easily, and sometimes even new results are obtained.
Mathematical logic --- Logic --- wiskunde --- logica
Choose an application
Starting with simple examples showing the relevance of cutting and pasting logics, the monograph develops a mathematical theory of combining and decomposing logics, ranging from propositional and first-order based logics to higher-order based logics as well as to non-truth functional logics. The theory covers mechanisms for combining semantic structures and deductive systems either of the same or different nature (for instance, two Hilbert calculi or a Hilbert calculus and a tableau calculus). The important issue of preservation of properties is extensively addressed. For instance, sufficient conditions are provided for a combined logic to be sound and complete when the original component logics are known to be sound and complete. The book brings the reader to the front line of current research in the field by showing both recent achievements and directions of future investigations (in particular, multiple open problems). It also provides examples of potential applications in emergent fields like security protocols, quantum computing, networks and argumentation theory, besides discussing more classical applications like software specification, knowledge representation, computational linguistics and modular automated reasoning. This monograph will be of interest to researchers and graduate students in mathematical logic, theory of computation and philosophical logic with no previous knowledge of the subject of combining and decomposing logics, but with a working knowledge of first-order logic. The book will also be relevant for people involved in research projects where logic is used as a tool and the need for working with several logics at the same time is mandatory (for instance, temporal, epistemic and probabilistic logics).
Mathematical logic --- Logic --- wiskunde --- logica
Choose an application
This book presents the author's recent investigations of the two main concepts of negation developed in the constructive logic: the negation as reduction to absurdity (L.E.J. Brouwer) and the strong negation (D. Nelson) are studied in the setting of paraconsistent logic. The paraconsistent logics are those, which admit inconsistent but non-trivial theories, i.e., the logics which allow making inferences in non-trivial fashion from an inconsistent set of hypotheses. Logics in which all inconsistent theories are trivial are called explosive. In the intuitionistic logic Li, the negation is defined as reduction to absurdity. The concept of strong negation is realized in the Nelson logic N3. Both logics are explosive and have paraconsistent analogs: Johansson's logic Lj and paraconsistent Nelson's logic N4. It will be shown that refusing the explosion axiom "contradiction implies everything" does not lead to decrease of the expressive power of a logic. To understand, which new expressive possibilities have the logics Lj and N4 as compared to the explosive logics Li and N3, we study the lattices of extensions of the logics Lj and N4. This is the first case when lattices of paraconsistent logics are systematically investigated. The study is based on algebraic methods, demonstrates the remarkable regularity and the similarity of structures of both lattices of logics, and gives essential information on the paraconsistent nature of logics Lj and N4. The methods developed in this book can be applied for investigation of other classes of paraconsistent logics.
Mathematical logic --- Logic --- wiskunde --- logica
Choose an application
Mathematical logic --- Logic --- wiskunde --- logica
Choose an application
Mathematical logic --- Logic --- wiskunde --- logica
Listing 1 - 10 of 337 | << page >> |
Sort by
|