Geodesic

Volume 23 (1983)

Table of contents

Predicate calculus of arbitrarily high finite order.
p. 1-10
Bases of ZF...-models.
p. 11-20
...-definable functionals and ... Conversion.
p. 21-26
A lower bound for the complexity of Craig's interpolants in sentinential logic.
p. 27-36
Natural limitations of decisions procedures for arithmetic with bounded quantifiers.
p. 37-54
A note on a proof of Sherpherdson.
p. 55-60
Variants of Robinson's essentially undecidable theory R.
p. 61-64
A well-ordering proof for Feferman's theory To.
p. 65-78
R.E. degrees of continuous functionals.
p. 79-98
A one axiom set theory based on higher order predicate calculus.
p. 99-108
Set theory in predicate calculus with equality
p. 109-114
Definable Ramsey and definable Erdös ordinals.
p. 115-128
Die Unentscheidbarkeit der einstelligen unendlichwertigen Prädikatenlogik.
p. 129-140
Die Nichtaxiomatisierbarkeit der unendlichwertigen Mengenlehre.
p. 141-146
A Note on tight stable theories.
p. 147-152
On a weakening of Markov's principle.
p. 153-160
A classification of the one-argument primitive recursive functions.
p. 161-174
A classification of an iterative hierarchy.
p. 175-186