Non-deterministic Matrices and Modular Semantics of Rules

Arnon Avron ()
Additional contact information
Arnon Avron: Tel-Aviv University, School of Computer Science

A chapter in Logica Universalis, 2005, pp 149-167 from Springer

Abstract: Abstract We show by way of example how one can provide in a lot of cases simple modular semantics of rules of inference, so that the semantics of a system is obtained by joining the semantics of its rules in the most straightforward way. Our main tool for this task is the use of finite Nmatrices, which are multi-valued structures in which the value assigned by a valuation to a complex formula can be chosen non-deterministically out of a certain nonempty set of options. The method is applied in the area of logics with a formal consistency operator (knowns as LFIs), allowing us to provide in a modular way effective, finite semantics for thousands of different LFIs.

Keywords: Propositional logics; multiple-valued semantics; paraconsistency (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-7643-7304-7_9

Ordering information: This item can be ordered from
http://www.springer.com/9783764373047

DOI: 10.1007/3-7643-7304-0_9

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().