Commutative recursive word arithmetic in the alphabet of prime numbers.

Abstract

I(ΛΓ/, ΛΓy; 1, n) false for n> 1, \(xi, XJ; m, 1) false for m> i, \{x iy Xj; m + 1, n + l)OVv^n{x im + 1 = Xj v } A I(ΛΓ/, X" m, ra). §1. Word systems V(A), V(P). Firstly, we construct the formal commutative word system V( A ) introduced by Vuckovic.

Recursive models for three-valued propositional calculi with classical implication.

“…We note that (2.6) can be reduced to (2.5) (see f .i. [4]). We introduce (2.6) in order to simplify the exposition.…”