An algorithm for axiomatizing and theorem proving in finite many - valued propositional logics

Logique Et Analyse 28 (12):363 (1985)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Remark on a finite axiomatization of finite intermediate propositional logics.D. Skvortsov - 1999 - Journal of Applied Non-Classical Logics 9 (2-3):381-386.
On Finite-Valued Propositional Logical Calculi.O. Anshakov & S. Rychkov - 1995 - Notre Dame Journal of Formal Logic 36 (4):606-629.
Many-valued reflexive autoepistemic logic.C. Koutras & S. Zachos - 2000 - Logic Journal of the IGPL 8 (1):33-54.
Towards structurally-free theorem proving.M. Finger - 1998 - Logic Journal of the IGPL 6 (3):425-449.

Analytics

Added to PP
2015-02-06

Downloads
1 (#1,769,934)

6 months
1 (#1,040,386)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Author's Profile

Walter Carnielli
University of Campinas

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references