Geodesic

Studies in constructive mathematics and mathematical logic. Part VII

Sommaire

An iterative description of the class $\varepsilon^1$ of Grzegorczyk's hierarchy
p. 3-14
Decidability of the universal theory of natural numbers with addition and divisibility
p. 15-28
Kolmogoroff algorithms are stronger than turing machines
p. 29-37
Application of separability and independence notions for proving lower bounds of circuit complexity
p. 38-48
On an approximative version of the notion of constructive analytic function
p. 49-58
On constructive distribution functions
p. 59-64
Absorption relation on regular sets
p. 65-74
A new proof of the theorem on exponential diophantine representation of enumerable sets
p. 75-92
What can be done with PRA?
p. 93-102
On the approximation of reduction classes of RPC by decidable classes
p. 103-108
Solvable classes of pseudoprenex formulas
p. 109-170
Approximability of operators in constructive metric spaces
p. 171-182
Hierarchies of operators in constructive metric spaces
p. 183-193
Continuity of operators in separable constructive metric spaces
p. 194-196
On the recognition of the tautological nature of propositional formulas
p. 197-206
Example of a constructive separable space with an inseparable completion
p. 207-208
On the quantifier of limiting realizability
p. 209-220