Non-deterministic semantics for logics with a consistency operator

doi:10.1016/j.ijar.2006.06.011

Non-deterministic semantics for logics with a consistency operator

2007-07-01

32

PRE

AI

A

Arnon Avron *

DOI：10.1016/j.ijar.2006.06.011

原文链接

原文求助

摘要

En 中文

In order to handle inconsistent knowledge bases in a reasonable way, one needs a logic which allows nontrivial inconsistent theories. Logics of this sort are called paraconsistent. One of the oldest and best known approaches to the problem of designing useful paraconsistent logics is da Costa's approach, which seeks to allow the use of classical logic whenever it is safe to do so, but behaves completely differently when contradictions are involved. da Costa's approach has led to the family of logics of formal (in)consistency (LFIs). In this paper we provide in a modular way simple nondeterministic semantics for 64 of the most important logics from this family. Our semantics is three-valued for sorne of the systems, and infinite-valued for the others. We prove that these results cannot be improved: neither of the systems with a three-valued non -deterministic semantics has either a finite characteristic ordinary matrix or a two-valued characteristic non-deterministic matrix, and neither of the other systems we investigate has a finite characteristic non-deterministic matrix. Still, our semantics provides decision procedures for all the systems investigated, as well as easy proofs of important proof-theoretical properties of them. (C) 2006 Published by Elsevier Inc.

Non-deterministic semantics for logics with a consistency operator

摘要

AI总结

期刊

机构

引用论文