Geodesic

Theoretical application of methods of mathematical logic. Part II

A maximal sequence of classes transformable by primitive recursion in a given class
p. 3-18
A lower bound for the computational complexity of a set of disjunctives in a monotone basis
p. 19-25
Problem of path connections in graphs
p. 26-29
A majorizing semantics for hyperarithmetic sentences
p. 30-37
An approach to the constructivization of Cantor's set theory
p. 38-50
Herbrand strategies and the “greater deducibility” relation
p. 51-61
Primes are nonnegative values of a polynomial in 10 variables
p. 62-82
Closed categories and the theory of proofs
p. 83-114
How to prove that two classes of simple primitive recursive functions are distinct
p. 115-122
A simplified proof of the real-time recognizability of palindromes on turing machines
p. 123-139
Equational calculi for Grzegorczyk's classes $\mathscr E^n$
p. 140-141