Article thumbnail

On Matrix Characterizations for Propositional Substructural Logics

By Enno Sandner, Fachgebiet Intellektik, Fachbereich Informatik and Technische Hochschule Darmstadt

Abstract

. This paper provides a unified approach for matrix characterizations for propositional substructural logics, whereby the focus is laid on a uniform representation of different validity concepts in matrices. Starting from a restricted validity concept for matrices called basic-validity, where a matrix is considered as valid if each literal is connected exactly once, we use rewrite rules to obtain a wider class of validity concepts. Here a matrix is considered as valid if it can be transformed to a basic-valid matrix by using the appropriate rewrite-rules. For each validity concept we give corresponding algebraic semantics. 1 Introduction In the last years there has been an undeniable growing interest in the computer science community concerning non-classical logics. This is on the one side caused by the development of new logics like Girards linear logic [6]. On the other side there are application-domains, for example planning tasks where ordinary first-order logic turns out..

Year: 1996
OAI identifier: oai:CiteSeerX.psu:10.1.1.33.2042
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.intellektik.informa... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.