Remarks concerning Kurt Gödel's life and work

Curt C. Christian

3-7

Facets of incompleteness

John Dawson

9-21

Godel's life and work

Petkov

23-36

Categorial grammar and lambda calculus

Johan van Benthem

39-60

A constructive morse theory of sets

Douglas Bridges

61-79

Differentiation of constructive functions of a real variable and relative computability

Osvald Demuth, Pavel Filipec

81-106

A completeness theorem for higher-order intuitionistic logic

an intuitionistic proof

A. G. Dragalin

107-124

Reasoning in trees

Herman Ruge Jervell

125-135

Non-deterministic program schemata and their relation to dynamic logic

V. A. Nepomniaschy, N. V. Shilov

137-147

The parallel evaluation of functional programs

Alberto Pettorossi, Andrzej Skowron

149-165

Logic approximating sequences of sets

Helena Rasiowa

167-186

Intuitionistic formal spaces — a first communication

Giovanni Sambin

187-204

On the logic of small changes in theories II

Krister Segerberg

205-211

On "logical relations" in program semantics

Boris A. Trakhtenbrot

213-229

Search computability and computability with numberings are equivalent in the case of finite set of objects

Angel V. Ditchev

233-242

Cut-elimination theorem for higher-order classical logic

an intuitionistic proof

A. G. Dragalin

243-251

Modal environment for boolean speculations

George Gargov, Solomon Passy, Tinko Tinchev

253-263

Distributive spaces

Ivanov

265-272

Approximating the projective model

Evangelos Kranakis

273-282

Projection complete graph problems corresponding to a Branching-program-based characterization of the complexity classes nc1 ,land nl

Christoph Meinel

283-292

Constructive theories with abstract data types for program synthesis

Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi

293-302

A first order logic for logic programming

Moreno Navarro, M. Rodriguez Artalejo

303-314

The relational semantics for branched quantifiers

Marcin Mostowski

315-322

Propositional dynamic logic in two- and more dimensions

Assen Petkov

323-329

On a nonconstructive type theory and program derivation

Jan M. Smith

331-340

Prime computability on partial structures

Ivan N. Soskov

341-350

Complexity bounded Martin-Löf tests

Marius Zimand

351-359