Labelled Non-Classical Logics

Inbunden, Engelska, 2000

AvLuca Viganò

2 029 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (1)

Häftad

2 029 kr

Skickas inom 10-15 vardagar

The subject of this text is the development and investigation of a framework for the modular and uniform presentation and implementation of non-classical logics, in particular modal and relevance logics. Logics are presented as labelled deduction systems, which are proved to be sound and complete with respect to the corresponding Kripke-style semantics. The text investigates the proof theory of certain systems, and shows them to possess structural properties such as normalization and the subformula property, which are exploited not only to establish advantages and limitations of the book's approach with respect to related ones, but also to give, by means of a substructural analysis, a proof-theoretic method for investigating decidability and complexity of (some of) the logics considered. All the deduction systems in the book have been implemented in the generic theorem prover Isabelle, thus providing a simple and natural environment for interactive proof development.

Produktinformation

Utgivningsdatum2000-01-31
Mått156 x 234 x 22 mm
Vikt635 g
FormatInbunden
SpråkEngelska
Antal sidor292
Upplaga2000
FörlagKluwer Academic Publishers
ISBN9780792377498

Tillhör följande kategorier

1. Introduction.- I Labelled deduction for non-classical logics.- 2. Labelled Natural Deduction Systems for Propositional Modal Logics.- 3. Labelled Natural Deduction Systems for Propositional Non-Classical Logics.- 4. Labelled Natural Deduction Systems for Quantified Modal Logics.- 5. Encoding Labelled Non-Classical Logics in Isabelle.- 6. Labelled Sequent Systems for Non-Classical Logics.- 7. Discussion.- II Substructural and complexity analysis of modal sequent systems.- 8. Introduction and Preliminaries.- 9. Substructural Analysis of S(K).- 10. Substructural Analysis of S(T).- 11. Substructural Analysis of S(K4) and S(S4).- 12. Complexity of Proof Search in K, T, K4 and S4.- 13. Discussion.- 14. Conclusions and Further Research.- References.