Geodesic

Studies in constructive mathematics and mathematical logic. Part IV

Sommaire

Editors' preface
On a~class of realizable propositional formulas
p. 8-23
A~synthesis of the resolution method and the inverse method
p. 24-35
Yet another constructive version of Cauchy theorem
p. 36-39
On realizations of predicate formulas
p. 40-48
On Diophantine representations of the sequence of solutions of Pell's equation
p. 49-59
On algorithmical sequences belonging to the initial class of Grzegorczyk hierarchy
p. 60-66
On investigation of constructive functions by the fillings method
p. 67-79
An extension of the inverse method to the predicate calculus with equality
p. 80-96
A~sufficient condition for the recursive convergence of a~monotone sequence
p. 97-103
On real-time recognition of the relation of occurrence
p. 104-114
Quantifier-free and one-quantifier systems
p. 115-133
Exact estimates for provability of the rule of transfinite induction in initial parts of arithmetic
p. 134-144
The equivalence of the two definitions of recursive continuity
p. 145-159
On the continuity of constructive functionals
p. 160-169
On biconjunctive reduction classes
p. 170-174
On a~specialization of processing of axions in proof procedures for axiomatic theories with equality
p. 175-185
On elimination of cut-type rules from Robinson and Presburger axiomatic systems
p. 186-199
A~property of recursively enumerable sets containing ``hardly deducible'' formulas
p. 200-207
On some weakening of intuitionistic logic
p. 208-219
Regular approximations to the recursive predicates
p. 220-233
A~reduced form of normal algorithms and a~linear speed-up theorem
p. 234-242
The lower estimate of number of steps for reversing normal algorithms and other similar algorithms
p. 243-262
A~pseudo-rundamental sequence not equivalent to any monotone sequence
p. 263-271
Some aspects of graphic regularity
p. 272-281