Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-17T08:33:51.954Z Has data issue: false hasContentIssue false

Functional completeness and canonical forms in many-valued logics1

Published online by Cambridge University Press:  12 March 2014

William H. Jobe*
Affiliation:
University of Tulsa and University of Kansas

Extract

This paper examines the questions of functional completeness and canonical completeness in many-valued logics, offering proofs for several theorems on these topics.

A skeletal description of the domain for these theorems is as follows. We are concerned with a proper logic L, containing a denumerably infinite class of propositional symbols, P, Q, R, …, a finite set of unary operations, U1, U2,…, Ub, and a finite set of binary operations, B1, B2, …, Bc. Well-formed formulas in L are recursively defined by the conventional set of rules. With L there is associated an integer, M ≧ 2, and the integers m, where (1 ≦m≦M), are the truth values of L.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1962

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable