| 505 |
0# |
$a S. O. Aanderaa, On the decision problem for formulas in which all disjunctions are binary -- D. Belsnes, The immortality problem for non-erasing Turing machines -- W. W. Boone, D. J. Collins and Yu. V. Matijasevic, Embeddings into semigroups with only a few defining relations -- J. E. Fenstad, The axiom of determinateness -- J.-Y. Girard, Une extension de l'interprétation de Gödel à l'analyse, et son application à l'élimination des coupures dans l'analyse et la théorie des types -- H. R. Jervell, A normalform in first order arithmetic -- G. Kreisel, A survey of proof theory. II -- Yu. V. Matijasevic, Diophantine representation of recursively enumerable predicates -- P. Martin-Löf, Hauptsatz for the intuitionistic theory of iterated inductive definitions -- P. Martin-Löf, Hauptsatz for the theory of species -- D. Prawitz, Ideas and results in proof theory -- W. V. Quine, Predicate-functor logic -- A. Robinson, Infinite forcing in model theory -- K. Segerberg, Qualitative probability in a modal setting -- W. W. Tait, Normal form theorem for bar recursive functions of finite type -- A. S. Troelstra, Notions of realizability for intuitionistic arithmetic and intuitionistic arithmetic in all finite types. |
