Every functionally complete $m$-valued logic has a Post-complete axiomatization

Notre Dame Journal of Formal Logic 11 (1):106-106 (1970)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On n-valued functionally complete truth functions.R. L. Graham - 1967 - Journal of Symbolic Logic 32 (2):190-195.
The Power of a Propositional Constant.Robert Goldblatt & Tomasz Kowalski - 2012 - Journal of Philosophical Logic (1):1-20.
An axiomatization of full computation tree logic.M. Reynolds - 2001 - Journal of Symbolic Logic 66 (3):1011-1057.
Algorithmic logic. Multiple-valued extensions.Helena Rasiowa - 1979 - Studia Logica 38 (4):317 - 335.
On dedekind complete o-minimal structures.Anand Pillay & Charles Steinhorn - 1987 - Journal of Symbolic Logic 52 (1):156-164.

Analytics

Added to PP
2010-08-24

Downloads
13 (#886,512)

6 months
1 (#1,040,386)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Storrs McCall
McGill University
Nuel Belnap
University of Pittsburgh

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references