The search functionality is under construction.

The search functionality is under construction.

In this paper, we focus on regularity and set-valued functions. Regularity was first introduced by S. C. Kleene in the propositional operations of his ternary logic. Then, M. Mukaidono investigated some properties of ternary functions, which can be represented by regular operations. He called such ternary functions "regular ternary logic functions". Regular ternary logic functions are useful for representing and analyzing ambiguities such as transient states or initial states in binary logic circuits that Boolean functions cannot cope with. Furthermore, they are also applied to studies of fail-safe systems for binary logic circuits. In this paper, we will discuss an extension of regular ternary logic functions into *r*-valued set-valued functions, which are defined as mappings on a set of nonempty subsets of the *r*-valued set {0, 1, . . . , *r*-1}. First, the paper will show a method by which operations on the *r*-valued set {0, 1, . . . , *r*-1} can be expanded into operations on the set of nonempty subsets of {0, 1, . . . , *r*-1}. These operations will be called regular since this method is identical with the way that Kleene expanded operations of binary logic into his ternary logic. Finally, explicit expressions of set-valued functions monotonic in

- Publication
- IEICE TRANSACTIONS on Information Vol.E82-D No.10 pp.1344-1351

- Publication Date
- 1999/10/25

- Publicized

- Online ISSN

- DOI

- Type of Manuscript
- PAPER

- Category
- Computer Hardware and Design

The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.

Copy

Noboru TAKAGI, Kyoichi NAKASHIMA, "A Logical Model for Representing Ambiguous States in Multiple-Valued Logic Systems" in IEICE TRANSACTIONS on Information,
vol. E82-D, no. 10, pp. 1344-1351, October 1999, doi: .

Abstract: In this paper, we focus on regularity and set-valued functions. Regularity was first introduced by S. C. Kleene in the propositional operations of his ternary logic. Then, M. Mukaidono investigated some properties of ternary functions, which can be represented by regular operations. He called such ternary functions "regular ternary logic functions". Regular ternary logic functions are useful for representing and analyzing ambiguities such as transient states or initial states in binary logic circuits that Boolean functions cannot cope with. Furthermore, they are also applied to studies of fail-safe systems for binary logic circuits. In this paper, we will discuss an extension of regular ternary logic functions into *r*-valued set-valued functions, which are defined as mappings on a set of nonempty subsets of the *r*-valued set {0, 1, . . . , *r*-1}. First, the paper will show a method by which operations on the *r*-valued set {0, 1, . . . , *r*-1} can be expanded into operations on the set of nonempty subsets of {0, 1, . . . , *r*-1}. These operations will be called regular since this method is identical with the way that Kleene expanded operations of binary logic into his ternary logic. Finally, explicit expressions of set-valued functions monotonic in

URL: https://global.ieice.org/en_transactions/information/10.1587/e82-d_10_1344/_p

Copy

@ARTICLE{e82-d_10_1344,

author={Noboru TAKAGI, Kyoichi NAKASHIMA, },

journal={IEICE TRANSACTIONS on Information},

title={A Logical Model for Representing Ambiguous States in Multiple-Valued Logic Systems},

year={1999},

volume={E82-D},

number={10},

pages={1344-1351},

abstract={In this paper, we focus on regularity and set-valued functions. Regularity was first introduced by S. C. Kleene in the propositional operations of his ternary logic. Then, M. Mukaidono investigated some properties of ternary functions, which can be represented by regular operations. He called such ternary functions "regular ternary logic functions". Regular ternary logic functions are useful for representing and analyzing ambiguities such as transient states or initial states in binary logic circuits that Boolean functions cannot cope with. Furthermore, they are also applied to studies of fail-safe systems for binary logic circuits. In this paper, we will discuss an extension of regular ternary logic functions into *r*-valued set-valued functions, which are defined as mappings on a set of nonempty subsets of the *r*-valued set {0, 1, . . . , *r*-1}. First, the paper will show a method by which operations on the *r*-valued set {0, 1, . . . , *r*-1} can be expanded into operations on the set of nonempty subsets of {0, 1, . . . , *r*-1}. These operations will be called regular since this method is identical with the way that Kleene expanded operations of binary logic into his ternary logic. Finally, explicit expressions of set-valued functions monotonic in

keywords={},

doi={},

ISSN={},

month={October},}

Copy

TY - JOUR

TI - A Logical Model for Representing Ambiguous States in Multiple-Valued Logic Systems

T2 - IEICE TRANSACTIONS on Information

SP - 1344

EP - 1351

AU - Noboru TAKAGI

AU - Kyoichi NAKASHIMA

PY - 1999

DO -

JO - IEICE TRANSACTIONS on Information

SN -

VL - E82-D

IS - 10

JA - IEICE TRANSACTIONS on Information

Y1 - October 1999

AB - In this paper, we focus on regularity and set-valued functions. Regularity was first introduced by S. C. Kleene in the propositional operations of his ternary logic. Then, M. Mukaidono investigated some properties of ternary functions, which can be represented by regular operations. He called such ternary functions "regular ternary logic functions". Regular ternary logic functions are useful for representing and analyzing ambiguities such as transient states or initial states in binary logic circuits that Boolean functions cannot cope with. Furthermore, they are also applied to studies of fail-safe systems for binary logic circuits. In this paper, we will discuss an extension of regular ternary logic functions into *r*-valued set-valued functions, which are defined as mappings on a set of nonempty subsets of the *r*-valued set {0, 1, . . . , *r*-1}. First, the paper will show a method by which operations on the *r*-valued set {0, 1, . . . , *r*-1} can be expanded into operations on the set of nonempty subsets of {0, 1, . . . , *r*-1}. These operations will be called regular since this method is identical with the way that Kleene expanded operations of binary logic into his ternary logic. Finally, explicit expressions of set-valued functions monotonic in

ER -