A deduction theorem schema for deductive systems of propositional logics

Studia Logica 50 (3-4):385 - 390 (1991)
  Copy   BIBTEX

Abstract

We propose a new schema for the deduction theorem and prove that the deductive system S of a prepositional logic L fulfills the proposed schema if and only if there exists a finite set A(p, q) of propositional formulae involving only prepositional letters p and q such that A(p, p) L and p, A(p, q) s q.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 106,716

External links

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

Through your library

Analytics

Added to PP
2009-01-28

Downloads
65 (#358,214)

6 months
6 (#738,277)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

References found in this work

Protoalgebraic logics.W. J. Blok & Don Pigozzi - 1986 - Studia Logica 45 (4):337 - 369.
Algebraic aspects of deduction theorems.Janusz Czelakowski - 1985 - Studia Logica 44 (4):369 - 387.
Local deductions theorems.Janusz Czelakowski - 1986 - Studia Logica 45 (4):377 - 391.

View all 9 references / Add more references