View source for Post production system

{{TEX|done}}
''Post normal system, Post normal calculus''

A particular case of a [[Post canonical system|Post canonical system]] when all derivation rules have the form

$$\frac{Gp}{pG}$$

and there is only one initial word (one axiom of the considered calculus). E. Post [[#References|[1]]] has established the equivalence in the wide sense between Post production systems and Post canonical systems. Post production systems were used by Post and A.A. Markov (1947) to construct the first examples of an [[Associative calculus|associative calculus]] with an unsolvable word problem (Thue's problem).

====References====
<table><TR><TD valign="top">[1]</TD> <TD valign="top">  E.L. Post,   "Formal reductions of the general combinatorial decision problem"  ''Amer. J. Math.'' , '''65''' :  2  (1943)  pp. 197–215</TD></TR><TR><TD valign="top">[2]</TD> <TD valign="top">  A.A. Markov,   "Theory of algorithms" , Israel Program Sci. Transl.  (1961)  (Translated from Russian)  (Also: Trudy Mat. Inst. Steklov. 42 (1954))</TD></TR></table>



====Comments====


====References====
<table><TR><TD valign="top">[a1]</TD> <TD valign="top">  H.B. Curry,   "Foundations of mathematical logic" , McGraw-Hill  (1963)</TD></TR></table>