Author : Thomas Ehrhard
Publisher : Cambridge University Press
Page : 393 pages
File Size : 28,64 MB
Release : 2004-11-15
Category : Computers
ISBN : 0521608570
This book illustrates linear logic in the application of proof theory to computer science.
Author : G. M. Bierman
Publisher :
Page : 210 pages
File Size : 26,13 MB
Release : 1994
Category : Logic, Symbolic and mathematical
ISBN :
Author : Nachum Dershowitz
Publisher : Springer
Page : 564 pages
File Size : 21,11 MB
Release : 2009-09-02
Category : Computers
ISBN : 9783540844884
This book constitutes the refereed proceedings of the 14th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2007, held in Yerevan, Armenia. It contains 36 revised full papers, 15 short papers and three invited talks that were carefully selected from 78 submissions. The papers address all current issues in logic programming, logic-based program manipulation, formal method, automated reasoning, and various kinds of AI logics.
Author : Anne Sjerp Troelstra
Publisher : Center for the Study of Language and Information Publications
Page : 215 pages
File Size : 46,47 MB
Release : 1992-05-01
Category : Mathematics
ISBN : 9780937073773
The initial sections of this text deal with syntactical matters such as logical formalism, cut-elimination, and the embedding of intuitionistic logic in classical linear logic. Concluding chapters focus on proofnets for the multiplicative fragment and the algorithmic interpretation of cut-elimination in proofnets.
Author : Andrzej M. Borzyszkowski
Publisher : Lecture Notes in Computer Science
Page : 804 pages
File Size : 43,79 MB
Release : 1993-08-18
Category : Computers
ISBN :
This volume contains the proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science, MFCS '93, held in Gdansk, Poland, August-September 1993. The MFCS symposia, organized annually in Poland and the former Czechoslovakia since 1972, have a long and well-established tradition. Over the years they have served as a meeting ground for specialists from all branches of theoretical computer science, in particular - algorithms and complexity, automata theory and theory of languages, - concurrent, distributed and real-time systems, - the theory of functional, logic and object-oriented programming, - lambda calculus and type theory, - semantics and logics of programs, and others. The volume contains 12 invitedlectures and 56 contributed papers selected from 133 submissions.
Author :
Publisher : World Scientific
Page : 410 pages
File Size : 16,7 MB
Release :
Category :
ISBN : 1911298763
Author : A. S. Troelstra
Publisher : Cambridge University Press
Page : 436 pages
File Size : 42,39 MB
Release : 2000-07-27
Category : Computers
ISBN : 9780521779111
This introduction to the basic ideas of structural proof theory contains a thorough discussion and comparison of various types of formalization of first-order logic. Examples are given of several areas of application, namely: the metamathematics of pure first-order logic (intuitionistic as well as classical); the theory of logic programming; category theory; modal logic; linear logic; first-order arithmetic and second-order logic. In each case the aim is to illustrate the methods in relatively simple situations and then apply them elsewhere in much more complex settings. There are numerous exercises throughout the text. In general, the only prerequisite is a standard course in first-order logic, making the book ideal for graduate students and beginning researchers in mathematical logic, theoretical computer science and artificial intelligence. For the new edition, many sections have been rewritten to improve clarity, new sections have been added on cut elimination, and solutions to selected exercises have been included.
Author : David J. Pym
Publisher : Springer Science & Business Media
Page : 323 pages
File Size : 31,17 MB
Release : 2013-04-17
Category : Mathematics
ISBN : 9401700915
This is a monograph about logic. Specifically, it presents the mathe matical theory of the logic of bunched implications, BI: I consider Bl's proof theory, model theory and computation theory. However, the mono graph is also about informatics in a sense which I explain. Specifically, it is about mathematical models of resources and logics for reasoning about resources. I begin with an introduction which presents my (background) view of logic from the point of view of informatics, paying particular attention to three logical topics which have arisen from the development of logic within informatics: • Resources as a basis for semantics; • Proof-search as a basis for reasoning; and • The theory of representation of object-logics in a meta-logic. The ensuing development represents a logical theory which draws upon the mathematical, philosophical and computational aspects of logic. Part I presents the logical theory of propositional BI, together with a computational interpretation. Part II presents a corresponding devel opment for predicate BI. In both parts, I develop proof-, model- and type-theoretic analyses. I also provide semantically-motivated compu tational perspectives, so beginning a mathematical theory of resources. I have not included any analysis, beyond conjecture, of properties such as decidability, finite models, games or complexity. I prefer to leave these matters to other occasions, perhaps in broader contexts.
Author : Katalin Bimbo
Publisher : CRC Press
Page : 388 pages
File Size : 39,74 MB
Release : 2014-08-20
Category : Mathematics
ISBN : 1466564660
Although sequent calculi constitute an important category of proof systems, they are not as well known as axiomatic and natural deduction systems. Addressing this deficiency, Proof Theory: Sequent Calculi and Related Formalisms presents a comprehensive treatment of sequent calculi, including a wide range of variations. It focuses on sequent calculi for various non-classical logics, from intuitionistic logic to relevance logic, linear logic, and modal logic. In the first chapters, the author emphasizes classical logic and a variety of different sequent calculi for classical and intuitionistic logics. She then presents other non-classical logics and meta-logical results, including decidability results obtained specifically using sequent calculus formalizations of logics. The book is suitable for a wide audience and can be used in advanced undergraduate or graduate courses. Computer scientists will discover intriguing connections between sequent calculi and resolution as well as between sequent calculi and typed systems. Those interested in the constructive approach will find formalizations of intuitionistic logic and two calculi for linear logic. Mathematicians and philosophers will welcome the treatment of a range of variations on calculi for classical logic. Philosophical logicians will be interested in the calculi for relevance logics while linguists will appreciate the detailed presentation of Lambek calculi and their extensions.
Author : S.R. Buss
Publisher : Elsevier
Page : 823 pages
File Size : 28,66 MB
Release : 1998-07-09
Category : Mathematics
ISBN : 0080533183
This volume contains articles covering a broad spectrum of proof theory, with an emphasis on its mathematical aspects. The articles should not only be interesting to specialists of proof theory, but should also be accessible to a diverse audience, including logicians, mathematicians, computer scientists and philosophers. Many of the central topics of proof theory have been included in a self-contained expository of articles, covered in great detail and depth.The chapters are arranged so that the two introductory articles come first; these are then followed by articles from core classical areas of proof theory; the handbook concludes with articles that deal with topics closely related to computer science.
