Skip Navigation

Journal of Logic and Computation 1999 9(6):977-994; doi:10.1093/logcom/9.6.977
© 1999 by Oxford University Press
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (5)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Avron, A
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

On the expressive power of three-valued and four-valued languages

A Avron

School of Mathematical Sciences, Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv 69978, Israel E-mail: aa@math.tau.ac.il

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 first stage the ability of the language to characterize sets of tuples of truth-values is determined. In the second stage the results of the first are used to determine its power to represent operations. Special attention is given to the role of monotonicity, closure and freedom properties in classifying languages, as well as to maximality properties (for example: we prove that by adding any nonmonotonic connective to the set of four-valued monotonic connectives, we get a functionally complete set).

Keywords: Many-valued logics, bilattices, expressiveness


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 J Logic ComputationHome page
M. O. Galindo, J. A. Navarro Perez, J. R. Arrazola Ramirez, and V. B. Macias
Logics with Common Weak Completions
J Logic Computation, December 1, 2006; 16(6): 867 - 890.
[Abstract] [Full Text] [PDF]


Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.