APC: The Algorithmic Predicate Calculus

Article type: Research Article

Authors: Przyłuski, Wojciech

Affiliations: Institute of Computing Machines – Warsaw

Abstract: The paper presents a logic which is an algorithmic extension of the classical predicate calculus and is based on the ideas given by F. Kröger. The programs and the effects of their execution are the formulas of this logic which are considered at any time scale. There are many interesting properties of the logic which are connected with the notion of time scale. These properties are examined in the paper. Moreover the problem of the formulas normalization is presented. Our logic is compared with the algorithmic logic introduced by A. Salwicki. Next, the usefulness of a new logic in the theory of programs is shown.

Keywords: thickness of formulas, algorithmic logic, algorithmic properties

DOI: 10.3233/FI-1981-4206

Journal: Fundamenta Informaticae, vol. 4, no. 2, pp. 343-367, 1981