Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Logic [Symbolic and mathematical ]

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This work is a sequel to the author's 'Gödel's Incompleteness Theorems', though it can be read independently by anyone familiar with Gödel's incompleteness theorem for Peano arithmetic. The text deals mainly with those aspects of recursion theory that have applications to the metamathematics of incompleteness, undecidability, and related topics. It is both an introduction to the theory and a presentation of new results in the field.

Recursion theory. --- Logic, Symbolic and mathematical

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Automatic theorem proving. --- Logic, Symbolic and mathematical.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

LICS '93 was held in Montreal, Canada, June 1993, to discuss abstract data types, automated deduction, concurrency, constructive math, database theory, knowledge representation, logical aspects of computational complexity, software specification, and type systems, among other related topics. No index. Annotation copyright by Book News, Inc., Portland, OR.

Computer science Mathematics --- Logic, Symbolic and mathematical

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Substructural logics comprise a family of nonclassical logics that arose in response to problems in theoretical computer science, mathematical linguistics, and category theory. They include intuitionist logic, relevant logic, BCK logic, linear logic, and Lambeck's calculus of synthetic categories. This book brings together new papers by some of the most eminent authorities in these various traditions in order to provide a unified view of the field. This important volume--the first to bring together the disparate strands of work in substructural logics--will be welcomed by student and professional logicians, theoretical computer scientists, theoretical linguists, philosophers, and mathematicians working in category theory and universal algebra.

Computer Science --- Logic, symbolic and mathematical --- Computer science. --- Logic, Symbolic and mathematical.