Non-deterministic matrices

Arnon Avron, Iddo Lev

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The ordinary concept of a multiple-valued matrix is generalized by introducing non-deterministic matrices (Nmatrices), in which non-deterministic computations of truth-values are allowed. The induced logics are investigated, and a generalized compactness theorem that applies to all finite Nmatrices is proved. Among the applications, it is shown that some important logics for reasoning under uncertainty can be characterized by finite Nmatrices but not by finite ordinary matrices.

Original languageEnglish
Title of host publicationProceedings. 34th International Symposium on Multiple-Valued Logic
PublisherIEEE
Pages282-287
Number of pages6
ISBN (Print)0-7695-2130-4
DOIs
StatePublished - 2004
EventProceedings - 34th International Symposium on Multiple-Values Logic, ISMVL 2004 - Toronto, Ont, Canada
Duration: 19 May 200422 May 2004

Publication series

NameProceedings of The International Symposium on Multiple-Valued Logic
PublisherIEEE Computer Society
ISSN (Print)0195-623X

Conference

ConferenceProceedings - 34th International Symposium on Multiple-Values Logic, ISMVL 2004
Country/TerritoryCanada
CityToronto, Ont
Period19/05/0422/05/04

Fingerprint

Dive into the research topics of 'Non-deterministic matrices'. Together they form a unique fingerprint.

Cite this