Publication Date:
2014-03-26
Description:
Segerberg presented a general completeness proof for propositional logics. For this purpose, a deductive system was defined in a way that its rules were rules for an arbitrary k -place Boolean operator in a given propositional logic. Each of those rules corresponds to a row on the operator's truth-table. This article extends Segerberg's idea to finite-valued propositional logic. We maintain the idea of defining a deductive system whose rules correspond to rows of truth-tables, but instead of having n types of rules (one for each truth-value), we use a bivalent representation that makes use of the technique of separating formulas as defined by Carlos Caleiro and João Marcos.
Print ISSN:
1367-0751
Electronic ISSN:
1368-9894
Topics:
Mathematics
Permalink