Geodesic

Studies in constructive mathematics and mathematical logic. Part I

Preface
A~proof method for the classical predicate calculus
p. 8-17
On correction of unprovable formulae
p. 18-29
Lebesgue integral in constructive analysis
p. 30-43
Sufficient conditions for incompleteness of formalized parts of arithmetic
p. 44-57
The normal form for deductions in the predicate calculus with equality and functional symbols
p. 58-64
Some reduction classes and undecidable theories
p. 65-68
Deductive validity and reduction classes
p. 69-77
The decision problem for some constructive theories of equality
p. 78-85
On constructive groups
p. 86-95
Invertible sequential variant of intuitibnistic predicate calculus
p. 96-111
Choice of terms in quantifier rules of the intuitionistic pridicate calculus
p. 112-122
Analog of the Herbrand's theorem for the intuitionistic predicate calculus
p. 123-133
Varying of proof search tactics in sequenzen-calculi
p. 134-151
Embedding operations related to the S.~Kripke's ``semantics"
p. 152-159
On embedding operations
p. 160-167
Unsolvability in the modal predicate calculus of the class of formulas containing only one monadic predicate variable
p. 168-173
A~sequential calculus of the constructive logic for the normal formulae without structural rules of inference
p. 174-188
On sequential variants of applied predicate calculi
p. 189-200
On maximal regulators of continuity for constructive functions
p. 201-208
Representation of recursive predicates by Rabin's machines
p. 209-218