Abstract

This paper was presented at the Annual Conference of the Australian Association for Logic, Melbourne, November, 1979. The present note being complementary to [1], I shall only brie y recall the key notions to be exploited here, and for more details the reader is advised to consult [1]. By a propositional logic we mean a couple , where L is a propo- sitional language and C a structural consequence de- ned on L. A couple W = is said to be a referential matrix for the language L i there exists a non-empty set T such that the following two conditions are satised: i. A is an abstract algebra similar to L, whose all elements belong to f0; 1g T , i.e. they are mappings from T into the two-element set f0; 1g. ii. D = ffa 2 A : a = 1g : t 2 Tg