A generalisation of Slupecki's criterion for functional completeness

&
Mathematical Logic Quarterly 30 (9‐11):173-175 (1984)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19840300907

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,369

External links

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

Through your library

My notes

Similar books and articles

A Relationship Between Ordinary Functional Completeness and a Generalisation of the Concept.Alan Rose - 1986 - Mathematical Logic Quarterly 32 (19‐24):323-330.
A Generalisation of the Concept of Functional Completeness and Applications to Modus Ponens.Alan Rose - 1982 - Mathematical Logic Quarterly 28 (22‐24):317-322.
Review: Jerzy Slupecki, Witold A. Pogorzelski, A Variant of the Proof of the Completeness of the First Order Functional Calculus. [REVIEW]Perry Smith - 1971 - Journal of Symbolic Logic 36 (4):688-689.
Review: Robert E. Clay, A Simple Proof of Functional Completeness in Many-Valued Logics Based on Lukasiewicz's C and N; Robert E. Clay, Note on Slupecki T-Functions. [REVIEW]Arto Salomaa - 1965 - Journal of Symbolic Logic 30 (1):105-105.
A Criterion of Functional Completeness for $\germ{B}^{3}$.Victor K. Finn - 1974 - Studia Logica 33 (2):121 - 125.
Fibring non-truth-functional logics: Completeness preservation.C. Caleiro, W. A. Carnielli, M. E. Coniglio, A. Sernadas & C. Sernadas - 2003 - Journal of Logic, Language and Information 12 (2):183-211.
A note on generalized functional completeness in the realm of elementrary logic.Henri Galinon - 2009 - Bulletin of the Section of Logic 38 (1/2):1-9.
Review: Witold A. Pogorzelski, Jerzy Slupecki, A Proof of the Completeness of the Classical Propositional Calculus on the Ground of an Axiomatic Methodology. [REVIEW]W. Bednarowski - 1967 - Journal of Symbolic Logic 32 (4):536-537.
Review: Jerzy Slupecki, A Criterion of Fullness of Many-Valued Systems of Propositional Logic. [REVIEW]Jan Kalicki - 1946 - Journal of Symbolic Logic 11 (4):128-128.
Generalised functional completeness of sets of m‐valued Sheffer functions.Alan Rose - 1984 - Mathematical Logic Quarterly 30 (12):177-182.
Tarskian Structured Consequence Relations and Functional Completeness.Heinrich Wansing - 1995 - Mathematical Logic Quarterly 41 (1):73-92.
Parity still isn't a generalisation problem.R. I. Damper - 1998 - Behavioral and Brain Sciences 21 (2):307-308.
On canonicity and strong completeness conditions in intermediate propositional logics.Silvio Ghilardi & Pierangelo Miglioli - 1999 - Studia Logica 63 (3):353-385.
Review: Trevor Evans, P. B. Schwartz, On Slupecki T-Functions. [REVIEW]Alan Rose - 1959 - Journal of Symbolic Logic 24 (3):249-250.

Analytics

Added to PP
2013-12-01

Downloads
16 (#912,482)

6 months
3 (#984,212)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references