Geodesic

Studies in constructive mathematics and mathematical logic. Part III

Sommaire

From the authors
A~computer algorithm for establishing deducibility, based on the inverse method
p. 8-19
On constructive pseudofunctions
p. 20-27
Nets of marks and deducibility in intuitionistic propositional calculus
p. 28-43
Some ways simplifying the constructing of the nets of marks
p. 44-53
On a~class of strategies for the resolution method
p. 54-64
On Shannon's pseudofunctions
p. 65-76
On estimations of the complexity of bounded halting problem
p. 77-80
On an estimation of the complexity of some algorithmic problems of analysis
p. 81-90
Nesessary and sufficient conditions for a~probability space to have Specker properties
p. 91-96
Intergrable $FR$-constructs over a~probability space
p. 97-104
The laws of large numbers in constructive probability theory
p. 105-113
On the set of zeroes of constructive power series in a~real variable
p. 114-125
Deduction search tactics based on a~specialization of the order of members in favourable sets
p. 126-136
A connection between tactics of the inverse method and the resolution method
p. 137-146
On semantics of modal logic
p. 147-151
On non-lengthening applications of equality rules
p. 152-156
Some properties of homeomorphisms of constructive metric spaces
p. 157-164
Two theorems on the complexity of algorithms and computations
p. 165-174
Elimination of cut-type rules in axiomatic systems with equality
p. 175-184
Corrections to the volume ``Studies in constructive mathematics and mathematical logic.~II''. 1968
p. 185-187