Quantification in non-deterministic multi-valued structures

Arnon Avron, Anna Zamansky

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

Abstract

In this paper the concept of a multi-valued non-deterministic (prepositional) matrix, in which non-deterministic computations of truth values are allowed, is extended to languages with quantifiers. We describe the difficulties involved in applying the two main classical approaches to interpreting quantifiers, the objectual and the substitutional, and solve the difficulties in the case of the latter. Then we turn to the two-valued case, and explore the effects in this context of each of the four standard Gentzen-type rules for the classical quantifiers. As an example, a sound and complete two-valued non-deterministic semantics is provided for a family of first-order proof systems.

Original languageEnglish
Title of host publication35th International Symposium on Multiple-Valued Logic (ISMVL'05)
PublisherIEEE
Pages296-301
Number of pages6
ISBN (Print)0-7695-2336-6
DOIs
StatePublished - 2005
Event35th International Symposium on Multiple-Valued Logic, ISMVL 2005 - Calgary, Alta., Canada
Duration: 19 May 200521 May 2005

Publication series

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

Conference

Conference35th International Symposium on Multiple-Valued Logic, ISMVL 2005
Country/TerritoryCanada
CityCalgary, Alta.
Period19/05/0521/05/05

Fingerprint

Dive into the research topics of 'Quantification in non-deterministic multi-valued structures'. Together they form a unique fingerprint.

Cite this