Mathematical logic and its applications
Contents
Differentiation of constructive functions of a real variable and relative computability
Osvald Demuth, Pavel Filipec
81-106
A completeness theorem for higher-order intuitionistic logic
an intuitionistic proof
A. G. Dragalin
107-124
Non-deterministic program schemata and their relation to dynamic logic
V. A. Nepomniaschy, N. V. Shilov
137-147
Search computability and computability with numberings are equivalent in the case of finite set of objects
Angel V. Ditchev
233-242
Cut-elimination theorem for higher-order classical logic
an intuitionistic proof
A. G. Dragalin
243-251
Projection complete graph problems corresponding to a Branching-program-based characterization of the complexity classes nc1 ,land nl
Christoph Meinel
283-292