Logic of Effective Definitions

Article type: Research Article

Authors: Tiuryn, Jerzy^{; *}

Affiliations: RWTH Aachen, Lehrstuhl für Informatik II

Note: [*] The author’s permanent address is: Institute of Mathematics, Warsaw University.

Abstract: A new logic to deal with properties of algorithmic processes in an abstract structure is proposed. This logic is based on the class of (deterministic) effective definitional schemes. A complete (infinitary) proof system is given. The paper contains among the other results, a “computation” of Hanf number of the above-mentioned logic, which turns out to he unexpectedly high.

Keywords: Logic, program schemes, axiomatization

DOI: 10.3233/FI-1981-4308

Journal: Fundamenta Informaticae, vol. 4, no. 3, pp. 629-659, 1981