POST ALGEBRAS AND POST LOGICS

Ewa Orlowska

Institute of Telecommunications, Warsaw

Emil Post doctoral dissertation Post (1921) contained a description of an n-valued, functionally complete algebra, for a finite n³ 2. The notion of Post algebra was introduced in Rosenbloom (1942). In Rousseau (1969, 1970) an equivalent formulation of the class of Post algebras was given which became a starting point for extensive research. Since then various generalisations of Post algebras inspired by applications in computer science have been developed. This note in a brief survey of major classes of Post algebras.

1. Plain semi-Post algebras

These algebras were introduced and investigated in Cat Ho (1973), Cat Ho and Rasiowa (1987, 1989, 1992). Let (T, £ ) be a poset and let ET be the set of ideals of T together with the empty set Æ . Clearly, TÎ ET. It is known that any sÎ ET is of the form s=È {s(t): s(t) Í s}, where s(t)={wÎ T: w£ t}. The system (ET, Í ) is a complete lattice, where join and meet are set-theoretical union and intersection, respectively.

An abstract algebra

(P) P=(P, È , Ç , ® , Ø , {dt: tÎ T}, {es: sÎ ET}) where È , Ç , ® are 2-argument operations, Ø , dt for tÎ T are unary operations and es for sÎ ET are 0-argument operations (constants) is a plain semi-Post algebra (psP-algebra) of type T provided that the following conditions are satisfied:

(p0) (P, È , Ç , ® , Ø )

is a Heyting algebra with the zero element 0=eÆ and the unit element 1=eT,

For any a, bÎ P

(p1) dt(a È b)=dta È dtb,

(p2) dt(a Ç b)=dta Ç dtb,

(p3) dwdta=dta,

(p4) dtes= 1 if tÎ s, otherwise dtes=0

(p5) dta È Ø dta=1

(p6) a = È {es(t) Ç dta: tÎ T} where È is the least upper bound in P

Let P=(P, È , Ç , ® , Ø , {dt: tÎ T}, {es: sÎ ET}) be a psP-algebra of type (T, £ ).

By BP we denote the set of elements of P of the form dta, tÎ T. Then

Proposition 1.1

(b) BP is closed under the operations È , Ç , ® , Ø of P

(c) The algebra BP=(BP, È , Ç , ® , Ø , 1, 0) is a Boolean algebra.

Let CP be the set of all complemented elements in the distributive lattice (P, È , Ç ). Then

Proposition 1.2

(b) CP is closed under the operations È , Ç , ® , Ø of P

(c) The algebra CP=(CP, È , Ç , ® , Ø , 1, 0) is a Boolean algebra

(d) For every aÎ CP, dtØ a=Ø dta, tÎ T.

However, BP and CP do not always equal. Consider a poset (T, £ ) such that T={a, b, c} and £ ={(b,a)}. Then ET={Æ , {b}, {c}, {b,c}, {a,b}, T}, BP={Æ , T}, and CP={Æ , T, {c}, {a,b}}.

Proposition 1.3 (Epstein lemma)

For any set {aj: jÎ J} of elements in P it holds

(a) a = (P)È {aj: jÎ J} iff for every tÎ T dta = (BP)È {dtaj: jÎ J}

(b) a = (P)Ç {aj: jÎ J} iff for every tÎ T dta = (BP)Ç {dtaj: jÎ J}.

Proposition 1.4

(a) dt(a® c) = Ç {dwa® dwc: w £ t}

(b) dtØ a = Ç {Ø dwa: w £ t}

(c) dwa£ dta whenever w£ t, for any w, tÎ T

(d) a£ b iff dta£ dtb for all tÎ T

(e) ew£ et iff wÍ t, for any w, tÎ ET

It follows that every psP-algebra of type (T, £ ) uniquely determines the set

M(P)={ Ç {dwa® dwc: w £ t}: tÎ T} of infinite meets of P.

Observe that for any sets s', s''Î ET there exists the relative pseudo-complement s'® s'' defined by s'® s''=È {sÎ ET: s'Ç sÍ s''}

and the pseudo-complement Ø s' defined by

Ø s'=s'® Æ ==È {sÎ ET: s'Ç s=Æ }

Clearly, s'® s'', Ø s'Î ET.

Proposition 1.5

(a) For any poset (T, £ ), the system (ET, È , Ç , ® , Ø , T, Æ ), where È , Ç are set-theoretical operations of union and intersection, respectively, and ® , Ø are defined as above, is a Heyting algebra with the unit element T and zero element Æ .

(b) Given a psP-algebra P=(P, È , Ç , ® , Ø , {dt: tÎ T}, {es: sÎ ET}), let EP={es: sÎ ET}. Then (EP, £ ) is a poset isomorphic to (ET, Í ).

Condition (b) follows from Proposition 1.4(e).

Example 1.1

An important example of a psP-algebra is the following algebra, referred to as a basic psP-algebra:

(ET, È , Ç , ® , Ø , {dt: tÎ T}, {es: sÎ ET})

where (ET, È , Ç , ® , Ø ) is the Heyting algebra defined above and the operations dt, tÎ T, and es, sÎ ET, are defined by:

es=s, in particular eÆ =Æ and eT=T,

dts=T if tÎ s, otherwise dts=Æ .

Proposition 1.6

The basic psP-algebra is functionally complete, that is any n-argument operation f: ETn® ET, n=0, 1,...., is definable with the operations of this algebra.

Given a Boolean algebra B=(B, È , Ç , ® , -, 1B, 0b) and a poset (T, £ ), by a descending T-sequence of elements of B we mean an indexed family (bt)tÎ T of elements of B such that w£ t in T implies bt£ bw in B (for the sake of simplicity we denote the Boolean ordering of B with the same symbol). We say that B and T satisfy condition (erpc) of existence of relative pseudo-complement if

(erpc) For any two descending T-sequences b=(bt)tÎ T, c=(ct)tÎ T of elements of B there exists (B)Ç {bw® cw: w£ t} for all tÎ T.

Example 1.2

We present a psP-algebra PT(B) of type T determined by a Boolean algebra B=(B, È , Ç , ® , -, 1B, 0B) such that B and T satisfy condition (erpc). The universe P(B) of PT(B) is the set of all descending T-sequences of elements of B. We define a partial ordering £ on P(B) as follows. Let b=(bt)tÎ T and c=(ct)tÎ T be any elements of P(B). Then

b£ c in P(B) iff bt£ ct in B for all tÎ T.

The system (P(B), £ ) is a lattice with join and meet defined by

bÈ c=(btÈ ct)tÎ T, bÇ c=(btÇ ct)tÎ T.

Since B and T satisfy (erpc), for any b, c in P(B) there exists the relative pseudo-complement b® c and

b® c=(xt)tÎ T, where xt=Ç {bw® cw: w£ t}.

For every sÎ ET we define

es=(xt)tÎ T, where xt=1B if tÎ s, otherwise xt=0B.

Moreover, we put

dwb=(xt)tÎ T, where xt=bw for every tÎ T,

Ø b=(xt)tÎ T, where xt=Ç {-bw: w£ t}.

It is easy to verify that the algebra PT(B)=(P(B), È , Ç , ® , Ø , {dt: tÎ T}, {es: sÎ ET}) defined above is a psP-algebra of type (T, £ ).

Proposition 1.7

Let a Boolean algebra B and a poset (T, £ ) satisfying (erpc) be given. Let P be the algebra PT(B) defined as in Example 1.2. Then the algebra BP (see Proposition 1.4) is isomorphic to B.

Example 1.3

A particular instance of the algebra defined in Example 1.2 is a set algebra obtained by taking the field of all subsets of a set as the respective Boolean algebra. Let U be a nonempty set and let B(U) be the field of all subsets of U. We have 1B(U)=U and 0B(U)=Æ . For any poset (T, £ ), B(U) and T satisfy condition (erpc). Let P(B(U)) be the set of all descending T-sequences of sets from B(U). The ordering on P(B(U)) is the inclusion. The algebra PT(B(U))=(P(B(U)), È , Ç , ® , Ø , {dt: tÎ T}, {es: sÎ ET}) defined as in Example 1.2 is a psP-algebra of type (T, £ ). The infinite joins in the axiom (p6) are set unions.

Proposition 1.8 (Representation theorem)

Let P=(P, È , Ç , ® , Ø , {dt: tÎ T}, {es: sÎ ET}) be a psP-algebra of type (T, £ ). If T is denumerable and either well-founded or the set M(P) is denumerable (in particular if P is denumerable), then for any denumerable set Q of infinite joins and meets in P there exists the field B(U) of all subsets of a nonempty set U and a monomorphism h from P into PT(B(U)) preserving all the operations in Q.

2. Post algebras of order m

The first axiom system for the algebras characterising Post's m-valued logics, for a finite m greater than 2, was presented in Rosenbloom (1942). He called them Post algebras. The axiomatisation was then simplified in Epstein (1960) and Traczyk (1964). Traczyk proved the equational definability of the class of Post algebras. Over the years the theory of Post algebras and several generalisations of these algebras have been developed. Here we define Post algebras of order m as a particular case of psP-algebras.

Let (Tm, £ ) be a poset such that Tm={1,..., m-1}, where m is a natural number greater than 2, and £ is a natural ordering in Tm. Then ETm={Æ , s(1),...,s(m-1)}, where s(t)={wÎ Tm: w£ t}. Clearly, (ETm, Í ) is isomorphic to {0, 1,..., m-1} with the natural ordering. Hence, we can identify these two posets and assume that constants es are indexed with elements from {0, 1,..., m-1}.

By a Post algebra of order m we mean a psP-algebra of type (Tm, £ ).

It can be easily shown that this definition is equivalent to the standard definition of Rousseau (1969, 1970).

Example 2.1

A classical example of a Post algebra of order m is an m-element Post algebra such that

P={e0,..., em-1}, and for i, jÎ {0, 1,..., m-1} the operations in P are defined as follows:

(ex1) eiÈ ej=emax(i,j),

(ex2) eiÇ ej=emin(i,j),

(ex3) ei® ej=1 if i£ j, otherwise ei® ej=ej,

(ex4) Ø ei=ei® 0,

(ex5) diej=1 if i£ j, otherwise diej=0.

Proposition 2.1

(a) e0® a=em-1

(b) es® a=È {dtaÇ et: t< s}È dsa

(c) em-1® a=a

(d) a® es=esÈ Ø ds+1a, for s=0,...,m-2

(e) a® em-1=em-1.

We define disjoint operations cs for sÎ {0, 1,..., m-1} as follows:

(c1) c0a=Ø d1a=Ø a

(c2) csa=dsaÇ Ø ds+1a for sÎ T-{m-1}

(c3) cm-1a=dm-1a.

We clearly have

csaÇ cta=e0 for s¹ t.

Any element a of P has the following disjoint representation:

(c4) a=È {ctaÇ et: tÎ T}.

Theorems analogous to propositions 1.1,..., 1.8 hold and constructions from examples 1.2 and 1.3 carry over to the case of type (Tm, £ ). Algebras presented in Example 1.1 can be identified with those defined in Example 2.1. Moreover, the algebras BP and CP corresponding to a Post algebra of order m coincide.

The m-valued Post logic is a propositional logic with binary connectives Ú , Ù , ® , unary connectives Ø , Dt for tÎ T, and propositional constants Es for sÎ {0, 1,..., m-1}. The algebraic semantics for the logic is determined in the standard way by the class of Post algebras of order m. A Hilbert-style axiomatisation of m-valued Post logic and its completeness with respect to the algebraic semantics is presented in Rasiowa (1969). The main results on m-valued Post logic include: Model existence theorem (Rasiowa 1970), Craig interpolation theorem (Rasiowa 1970), Herbrand theorem (Perkowska 1972).

Applications of the m-valued Post logic are concerned with the theory of programming. An algorithmic logic based on m-valued Post logic is developed in Perkowska (1972).

Post algebras and logics of any finite type (T, £ ) are considered in Nour (1997). They are also treated in Konikowska, Morgan and Orlowska (1998).

3. Post algebras of order w +

Let (Tw , £ ) be a poset such that Tw =w is the set of natural numbers and £ is the natural ordering of natural numbers. Then ETw ={Æ , s(1), s(2),..., Tw }. Clearly, (ETw , Í ) is isomorphic to {0, 1, 2,...,w } with the natural ordering. Hence, we can identify these two posets and assume that constants es are indexed with elements from {0, 1,..., w }.

A Post algebra of order w + is a psP-algebra of type (Tw , £ ).

An example of a Post algebra of order w + can be defined in a way similar to that developed in Example 2.1.

Theorems analogous to propositions 1.1,..., 1.8 hold and constructions from examples 1.2 and 1.3 carry over to the case of type (Tw , £ ). Moreover, the algebras BP and CP corresponding to a Post algebra of order w + coincide.

Representation theory for Post algebras of order w + has been also developed in Maksimova and Vakarelov (1974), Rasiowa (1985).

A Hilbert-style axiomatisation of w +-valued Post predicate logic and its completeness with respect to the algebraic semantics is presented in Rasiowa (1973). The other results on w +-valued Post logic include: Kripke style semantics (Maximova and Vakarelov 1974, Vakarelov 1977), Herbrand theorem and a resolution-style proof system (Orlowska 1977, 1978, 1980), relational semantics and a relational proof system (Orlowska 1991).

Applications of the w +-valued Post logic are concerned with the theory of programming. An algorithmic logic based on w +-valued Post logic is developed and investigated in Rasiowa (1974a, 1977, 1979).

4. Post algebras of order w +w * (in a strict sense)

These algebras are introduced and investigated in Epstein and Rasiowa (1990, 1991). Let T={1, 2,...-2, -1} and E={0, 1, 2,..., -2, -1}. A Post algebra of order w +w * is an algebra of the form (P) satisfying axioms (p0),...,(p6), where in (p0) 0=e0 and 1=e-1, and the following

(p7) d1a = d-1a È È {dsa Ç Ø ds+1a: 1 £ s < -1} pivot elimination axiom

(p8) (a® b)È (b® a)=1

The axiom (p7) says that an element e such that et < e (dte = 1) for all positive t

and e < et (dte =0) for all negative t does not exist.

Propositions analogous to Propositions1.1, 1.2, 1.3, 1.4 hold for Post algebras of order w +w *. Moreover, the algebras BP and CP corresponding to a Post algebra of order w +w * coincide.

Example 4.1

A most natural example of a Post algebra of order w +w * is a linear Post algebra of order w +w * defined as follows:

P={es: sÎ E}, and the operations in P are defined with conditions analogous to (ex1),...,(ex5) from Example 2.1.

Disjoint operations in Post algebras of order w +w * can be defined with conditions analogous to (c1), (c2), (c3) from section 2 by replacing m-1 with -1. Then any element a of P has a disjoint representation given by condition (c4).

In Post algebras of order w +w * one can define arithmetic-like operations in the following way.

The successor sa (the predecessor pa) of an element a of P is an element given by the following disjoint representation

sa=È {ctaÇ et+1: tÎ E}

pa=È {ctaÇ et-1: tÎ E}

provided that either of these exist.

The inverse -a of an element a is given by the disjoint representation

-a=È {ctaÇ e-1: tÎ T} provided that it exists.

Addition and multiplication operations have disjoint representations as follows

a+b=È {ct(a+b) Ç et: tÎ T} where for each tÎ T the infinite join ct(a+b)=È {ciaÇ cjb: i+j=t} exists

a· b=È {ct(a· b)Ç et: tÎ T} where for each t there is the finite join ct(a· b)=È {ciaÇ cjb: ij=t}.

Proposition 4.1

A Post algebra of order w +w * with inverse, addition and multiplication is a commutative ring with unit, where the ring zero is e0 and the ring unit is e1.

These rings have the characteristic 0.

For a descending T-sequence X=(Xt)tÎ T of subsets from the field B(U) of all subsets of a nonempty set U we define

X+=Ç {Xt: t positive}

X-=È {Xt: t negative}.

It can be shown that the algebra of descending T-sequences X=(Xt)tÎ T of sets from B(U) such that X+=X-, with the operations defined as in Example 1.2 is a Post algebra of order w +w *.

Representation theorem Post algebras of order w +w * has the following form.

Proposition 4.2 (Representation theorem)

For every denumerable Post algebra P of order w +w * there is a monomorphism h of P into a Post set algebra of order w +w * whose elements are descending T-sequences X=(Xt)tÎ T of sets from the field B(U) of all subsets of a nonempty set U such that X+=X-. Moreover, h preserves a given denumerable set Q of infinite joins and meets of P.

Applications of the logic are concerned with approximation reasoning. An approximation reasoning to recognise a subset S of a nonempty universe U is understood as a process of gradual approximating S by

subsets of U S Í S1 Í S2 Í ... which cover S

and subsets ... Í S-2 Í S-1 Í S which are contained in S.

Then the approximations of set S are defined as follows:

S+ = Ç {St: t positive}

S- = È {St: t negative}.

In Epstein and Rasiowa (1991) a characterisation of sets S such that S+ = S- is given.

Post algebras of order u , where u is an arbitrary ordinal number are introduced and investigated in Przymusinska (1980, 1980a, 1980b, 1980c).

Bibliography of Post algebras

Cat-Ho, Nguyen. (1973) Generalised Post algebras and their applications to some infinitary many-valued logics. Dissertationes Mathematicae 57, 1-76.

Cat-Ho, Nguyen and Rasiowa, H. (1987) Semi-Post algebras. Studia Logica 46, No 2, 147-158.

Cat-Ho, Nguyen and Rasiowa, H. (1989) Plain semi-Post algebras as a poset-based generalisation of Post algebras and their representability. Studia Logica 48, No 4, 509-530.

Cat-Ho, Nguyen and Rasiowa, H. (1992) LT-fuzzy logics. In: Zadeh, L. A. and Kacprzyk, J. (eds) Fuzzy Logic for Management of Uncertainty. J. Wiley, New York, 121-139.

Chang, C. C. and Horn, A. (1961) Prime ideals characterisation of generalised Post algebras. Proceedings of the Symposium in Pure Mathematics 2, 43-48.

Dwinger, Ph. (1966) Notes on Post algebras I, II. Indagationes Mathematicae28, 462-478.

Dwinger, Ph. (1968) Generalised Post algebras. Bulletin of the Polish Academy of Sciences, Mathematics, vol. 16, 559-563.

Dwinger, Ph. (1977) A survey of the theory of Post algebras and their generalisations. In: Dunn, J. M. and Epstein, G. (eds) Modern Uses of Multiple-Valued Logic. Reidel, Dordrecht, 53-75.

Epstein, G. (1960) The lattice theory of Post algebras. Transactions of the American Mathematical Society 95, 300-317.

Epstein, G. and Horn, A. (1974) P-algebras, An abstraction from Post algebras. Algebra Universalis 4, 195-206.

Epstein, G. and Rasiowa, H. (1990) Theory and uses of Post algebras of order w +w *, Part I. Proceedings of the 20th International Symposium on Multiple-Valued Logic, Charlotte, NC, USA, 42-47.

Epstein, G. and Rasiowa, H. (1990) Theory and uses of Post algebras of order w +w *, Part II. Proceedings of the 21th International Symposium on Multiple-Valued Logic, Victoria, Canada, 248-254.

Konikowska, B., Morgan, Ch. and Orlowska, E. (1998) Relational formalisation of arbitrary finite valued logics. Logic Journal of the Interest Group in Pure and Applied Logic, to appear.

Maksimova, L. and Vakarelov, D. (1974) Semantics for w +-valued predicate calculi. Bulletin of the Polish Academy of Sciences, Mathematics, vol. 22, No 8, 765-771.

Maksimova, L. and Vakarelov, D. (1974) Representation theorems for generalised Post algebras of order w +. Bulletin of the Polish Academy of Sciences, Mathematics, vol. 22, No 8, 757-764.

Nour, A. (1997) Etude de modeles logiques. Extensions de la logique intuitionniste. PhD dissertation, University Joseph Fourier, Grenoble.

Orlowska, E. (1977) The Herbrand theorem for w +-valued logic. Bulletin of the Polish Academy of Sciences, Mathematics, vol. 25, No 11, 1069-1071.

Orlowska, E. (1978) The resolution principle for w +-valued logic. Fundamenta Informaticae II, 1-15.

Orlowska, E. (1980) Resolution systems and their applications II. Fundamenta Informaticae III, 333-362.

Orlowska, E. (1985) Mechanical proof methods for Post logics. Logique et Analyse 110-111, 173-192.

Orlowska, E. (1991) Post relation algebras and their proof system. Proceedings of the 21th International Symposium on Multiple-Valued Logic, Victoria, Canada, 298-305.

Perkowska, E. (1971) Herbrand theorem for theories based on m-valued logics. Bulletin of the Polish Academy of Sciences, Mathematics, vol. 19, 893-899.

Perkowska, E. (1972) On algorithmic m-valued logics. Bulletin of the Polish Academy of Sciences, Mathematics, vol. 20, 717-719.

Post, E. (1920) Introduction to a general theory of elementary propositions. Bulletin of the American Mathematical Society 26.

Post, E. (1921) Introduction to a general theory of elementary propositions. American Journal of Mathematics 43, 163-185.

Przymusinska, H. (1980) On u -valued infinitary predicate calculi. Bulletin of the Polish Academy of Sciences, Mathematics, vol. 28, 193-198.

Przymusinska, H. (1980a) Some results concerning u -valued infinitary predicate calculi. Bulletin of the Polish Academy of Sciences, Mathematics, vol. 28, 199-202.

Przymusinska, H. (1980b) Genzen type semantics for u -valued infinitary predicate calculi. Bulletin of the Polish Academy of Sciences, Mathematics, vol. 28, 203-206.

Przymusinska, H. (1980c) Craig interpolation theorem and Hanf number for u -valued infinitary predicate calculi. Bulletin of the Polish Academy of Sciences, Mathematics, vol. 28, 207-211.

Rasiowa, H. (1969) A theorem on existence of prime filters in Post algebras and the completeness theorem for some many-valued predicate calculi. Bulletin of the Polish Academy of Sciences, Mathematics, vol. 17, 347-354.

Rasiowa, H. (1970) Ultraproducts of m-valued models and a generalisation of the Lowenheim-Skolem-Godel-Malcev theorem for theories based on m-valued logics. Bulletin of the Polish Academy of Sciences, Mathematics, vol. 18, 415-420.

Rasiowa, H. (1972) The Craig interpolation theorem for m-valued predicate calculi. Bulletin of the Polish Academy of Sciences, Mathematics, vol. 20, 341-346.

Rasiowa, H. (1973) On generalised Post algebras of order w + and w +-valued predicate calculi. Bulletin of the Polish Academy of Sciences, Mathematics, vol. 21, 209-219.

Rasiowa, H. (1973) Formalised w +-valued algorithmic systems. Bulletin of the Polish Academy of Sciences, Mathematics, vol. 21, 559-565.

Rasiowa, H. (1974) An Algebraic Approach to Non-Classical Logics. North Holland and Polish Scientific Publishers, Amsterdam, Warsaw.

Rasiowa, H. (1974a) Extended w +-valued algorithmic logic (a formalised theory of programs with recursive procedures). Bulletin of the Polish Academy of Sciences, Mathematics, vol. 22, 605-610.

Rasiowa, H. (1977) Many-valued algorithmic logic as a tool to investigate programs. In: Epstein, G. and Dunn, J. M. (eds) Modern Uses of Multiple-Valued Logic, Reidel, Dordrecht, 77-102.

Rasiowa, H. (1979) Algorithmic logic. Multiple-valued extension. Studia Logica 38, No 4, 317-325.

Rasiowa, H. (1985) Topological representations of Post algebras of order w + and open theories based on w +-valued Post logic. Studia Logica 44, No 4, 353-368.

Rasiowa, H. (1992) Towards fuzzy logic. In: Zadeh, L. A. and Kacprzyk, J. (eds) Fuzzy Logic for Management of Uncertainty. J. Wiley, New York, 5-25.

Rasiowa, H. (1994) Axiomatization and completeness of uncountably-valued approximation logic. Studia Logica 53, No 1, 137-160.

Rasiowa, H. and Epstein, G. (1987) Approximation reasoning and Scott's information systems. Proceedings of the 2nd International Symposium on Methodologies for Intelligent Systems, North Holland, 33-42.

Rosenbloom, P. C. (1942) Post algebras, I. Postulates and general theory. American Journal of Mathematics 64, 167-188.

Rousseau, G. (1969) Logical systems with finitely truth values. Bulletin of the Polish Academy of Sciences, Mathematics, vol. 17, 189-194.

Rousseau, G. (1970) Post algebras and pseudo-Post algebras. Fundamenta Mathematicae 67, 133-145.

Saloni, Z. (1972) Gentzen rules for the m-valued logic. Bulletin of the Polish Academy of Sciences, Mathematics, vol. 20, 819-826.

Traczyk, T. (1963) Some theorems on independence in Post algebras. Bulletin of the Polish Academy of Sciences, Mathematics, vol. 10, 3-8.

Traczyk, T. (1964) An equational definition of a class of Post algebras. Bulletin of the Polish Academy of Sciences, Mathematics, vol. 12, 147-149.

Traczyk, T. (1967) On Post algebras with uncountable chain of constants. Algebras and homomorphisms. Bulletin of the Polish Academy of Sciences, Mathematics, vol. 15, 673-680.

Traczyk, T. (1968) Prime ideals in generalized Post algebras. Bulletin of the Polish Academy of Sciences, Mathematics, vol. 16, 369-373.

Urquhart, A. (1973) An interpretation of many-valued logic. Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik 19, 111-114.

Vakarelov, D. (1977) Lattices related to Post algebras and their applications to some logical systems. Studia Logica 36, 89-107.

Wade, L. I. (1960) Post algebras and rings. Duke Mathematical Journal 12, 389-395.

Zabel, N. (1993) New techniques for automated deduction in many-valued first order, finite and infinite logics. PhD thesis, Institut National Polytechnique de Grenoble.