Geodesic

Studies in constructive mathematics and mathematical logic. Part II

Sommaire

Preface
Some notes on proof searching in predicate calculus
p. 8-20
Lebesgue integral and the notion of measurability of functions in constructive analysis
p. 21-28
A~connection between Riemann and Lebesgue integrability of constructive functions
p. 29-31
A~computability of primitive recursive terms of finite type and the primitive recursive realization
p. 32-45
Word operator algorithms
p. 46-52
A~constructive classification of arithmetical predicates and semantical bases for arithmetic
p. 53-65
On a~system of operators, simplifying the combination theory of $K$-algorithms
p. 66-79
A~construction of basic operators of the combination theory of $K$-algorithms, using operators of a~simple kind
p. 80-94
Some examples of quasidense, but not dense sets of duplexes
p. 95-102
A~note on domains of constructive functions
p. 103-106
Some properties of $F$-numbers
p. 107-120
On constructive analytical functions of one real variable
p. 121-131
A~connection between systems of words-and-lengths equations and Hilbert's tenth problem
p. 132-144
Two reductions of Hilbert's tenth problem
p. 145-158
Arithmetical representations of powers
p. 159-165
Cut-free calculi of the $S5$-type
p. 166-174
The implicative complexity of axiomatics
p. 175-181
A~disjunctive interpretation of the~$LJ$ calculus
p. 182-188
Permissible and derivable rules
p. 189-191
The independence of postulates of natural calculi
p. 192-195
Glivenko classes of sequents
p. 196-201
Two unsolvable classes of formulas of classical predicate calculus
p. 202-210
Kanger's variant of predicate calculus with not totally defined functions
p. 211-224
A~complexity characteristic of recursive predicates, which does not depend on standardization of the notion of algorithm
p. 225-233
On the complexity of proof in prepositional calculus
p. 234-259
On the disjunctive rank of formulas of constructive arithmetic
p. 260-271
Total constructive sets with equalities and some their properties
p. 272-280