Expressive Three-valued Truth Functions
نویسندگان
چکیده
منابع مشابه
Expressive Three-valued Truth Functions
The expressive truth functions of two-valued logic have all been characterized, as have the expressive unary truth functions of finitely-many-valued logic. This paper introduces some techniques for identifying expressive functions in three-valued logics. 1 We are going to explore a property of truth functions known as “expressiveness.” Before subjecting readers to the long-winded exp...
متن کاملMany-Valued Truth Functions, Cernys' Conjecture, and Road Coloring
We investigate interconnections between many-valued truth functions and functions de ned by nite deterministic automata. Propositions in one of the theory have often their natural counterpart in the other theory. Such is the case with problems about completeness, as well as with Cern y's conjecture in automata theory. Sometimes results in one theory, such as those concerning self-conjugacy of t...
متن کاملOn the Expressive Power of Three-Valued and Four-Valued Languages
We investigate the expressive power relative to three-valued and four-valued logics of various subsets of the set of connectives which are used in the bilattices-based logics. Our study of a language is done in two stages. In the rst stage the ability of the language to characterize sets of tuples of truth-values is determined. In the second stage the results of the rst are used to determine it...
متن کاملUsing Three Layer Neural Network to Compute Multi-valued Functions
A novel global hybrid algorithm for feedforward neural networks p. 9 Study on relationship between NIHSS and TCM-SSASD based on the BP neural network multiple models method p. 17 Application of back-propagation neural network to power transformer insulation diagnosis p. 26 Momentum BP neural networks in structural damage detection based on static displacements and natural frequencies p. 35 Defo...
متن کاملClassification of three-valued logical functions preserving 0
(0, 1,2}. The set of three-valued logical functions (i.e., f: E” --t E for n=l,2,... ) is denoted by P3. A subset F of P3 is said to be closed if it contains all superpositions (i.e., compositions or substitutions) of its members (cf. [l, 1 l-131). For closed sets F and H such that FC H (proper inclusion), F is an H-maxima/ set if FC G c H for no closed set G. A subset F of H is complete in H i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Australasian Journal of Logic
سال: 2006
ISSN: 1448-5052
DOI: 10.26686/ajl.v4i0.1782