Algorithms of the recognition of the tabularity and pretabularity in the extensions of the intuitionistic calculus

In the given work the algorithms allowing to carry out automatic recognition of tabular and pretabular properties at superintuitionistic and positive propositional logics and programs realizing these algorithms are described.