DSpace DSpace 日本語

AIT Associated Repository of Academic Resources >
A.研究報告 >
A1 愛知工業大学研究報告 >
3.愛知工業大学研究報告 .B(1976-2007) >
25号 >

Please use this identifier to cite or link to this item: http://hdl.handle.net/11133/835

Title: (p,q)論理関数の出力s固定,p-s閉集合のs-(p,q)論理完全性について
Other Titles: (p,q) ロンリ カンスル ノ シュツリョク s コテイ p-s ヘイシュウゴウ ノ s-(p,q) ロンリ カンゼンセイ ニツイテ
s-(p,q)-Logical Completeness for the Output s-Coherent, (p-s)-Closed Set of the (p,q)-Logical Functions
Authors: 羽賀, 隆洋
HAGA, Takahiro
Issue Date: 31-Mar-1990
Publisher: 愛知工業大学
Abstract: The multiple-valued logic (M-V Logic) has been studied in various points of view. Above all, as VLSI has become important in constructing computers, problems such as the complexity of the interconnections in VLSI and the severe restriction of the number of pins have become very important, and their solution is expected to require, for example, M-V Logic. Therefore, we have proposed the idea of the p-valued input, q-valued output logic ((p, q)-Logic), where 2≦q≦p, 3≦p. The idea stems from the considerations that (1) the inputs of the threshold elements can be very easily extended to the p-valued case, while (2) the extention of the outputs of the threshold elements to the p-valued case is difficult because the number of necessary thresholds increases. In this paper, the condition of the s-(p, q)-logical completeness for the output s-coherent, (p, s)-closed set of the (p, q)-logical functions is discussed. As a result, the condition is seen to be almost equivalent to the q-valued one. From the result, it may be expected that the studies and the costs of networks in M-V Logic are almostly reduced to the 2-valued one by selecting q≳2.
URI: http://hdl.handle.net/11133/835
Appears in Collections:25号

Files in This Item:

File Description SizeFormat
紀要25号B(P189-197).pdf617.25 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback