Goal-Directed Proof Theory

;

108,98 €
103,53 €
AGGIUNGI AL CARRELLO
TRAMA
Goal Directed Proof Theory presents a uniform and coherent methodology for automated deduction in non-classical logics, the relevance of which to computer science is now widely acknowledged. The methodology is based on goal-directed provability. It is a generalization of the logic programming style of deduction, and it is particularly favourable for proof search. The methodology is applied for the first time in a uniform way to a wide range of non-classical systems, covering intuitionistic, intermediate, modal and substructural logics. The book can also be used as an introduction to these logical systems form a procedural perspective. Readership: Computer scientists, mathematicians and philosophers, and anyone interested in the automation of reasoning based on non-classical logics. The book is suitable for self study, its only prerequisite being some elementary knowledge of logic and proof theory.

SOMMARIO
1 Introduction.- 2 Intuitionistic and Classical Logics.- 3 Intermediate Logics.- 4 Modal Logics of Strict Implication.- 5 Substructural Logics.- 6 Conclusions and Further Work.

ALTRE INFORMAZIONI
  • Condizione: Nuovo
  • ISBN: 9789048155262
  • Collana: Applied Logic Series
  • Dimensioni: 235 x 155 mm
  • Formato: Brossura
  • Illustration Notes: X, 268 p.
  • Pagine Arabe: 268
  • Pagine Romane: x