Newsletter of Phenomenology

Keeping phenomenologists informed since May 2002

Repository | Book

COPR BookmarkLink
225577

Springer, Dordrecht

1987

371 Pages

ISBN 978-1-4612-8234-1

Mathematical logic and its applications

Edited by

Dimiter G. Skordev

Publication details

DOI: 10.1007/978-1-4613-0897-3

Full citation:

Skordev, D.G. (ed) (1987). Mathematical logic and its applications, Springer, Dordrecht.

Table of Contents

Remarks concerning Kurt Gödel's life and work

Christian Curt C.

3-7

Open Access Link
Facets of incompleteness

Dawson John

9-21

Open Access Link
Godel's life and work

Petkov P. P.

23-36

Open Access Link
Categorial grammar and lambda calculus

van Benthem Johan

39-60

Open Access Link
A constructive morse theory of sets

Bridges Douglas

61-79

Open Access Link
Differentiation of constructive functions of a real variable and relative computability

Demuth Osvald; Filipec Pavel

81-106

Open Access Link
A completeness theorem for higher-order intuitionistic logic

Dragalin A. G.

107-124

Open Access Link
Reasoning in trees

Ruge Jervell Herman

125-135

Open Access Link
Non-deterministic program schemata and their relation to dynamic logic

Nepomniaschy V. A.; Shilov N. V.

137-147

Open Access Link
The parallel evaluation of functional programs

Pettorossi Alberto; Skowron Andrzej

149-165

Open Access Link
Logic approximating sequences of sets

Rasiowa Helena

167-186

Open Access Link
Intuitionistic formal spaces — a first communication

Sambin Giovanni

187-204

Open Access Link
On the logic of small changes in theories II

Segerberg Krister

205-211

Open Access Link
On "logical relations" in program semantics

Trakhtenbrot Boris A.

213-229

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

Ditchev Angel V.

233-242

Open Access Link
Cut-elimination theorem for higher-order classical logic

Dragalin A. G.

243-251

Open Access Link
Modal environment for boolean speculations

Gargov George; Passy Solomon; Tinchev Tinko

253-263

Open Access Link
Distributive spaces

Ivanov Ljubomir L.

265-272

Open Access Link
Approximating the projective model

Kranakis Evangelos

273-282

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

Meinel Christoph

283-292

Open Access Link
Constructive theories with abstract data types for program synthesis

Miglioli Pierangelo; Moscato Ugo; Ornaghi Mario

293-302

Open Access Link
A first order logic for logic programming

Moreno Navarro J J; Rodriguez Artalejo M

303-314

Open Access Link
The relational semantics for branched quantifiers

Mostowski Marcin

315-322

Open Access Link
Propositional dynamic logic in two- and more dimensions

Petkov Assen

323-329

Open Access Link
On a nonconstructive type theory and program derivation

Smith Jan M.

331-340

Open Access Link
Prime computability on partial structures

Soskov Ivan N.

341-350

Open Access Link
Complexity bounded Martin-Löf tests

Zimand Marius

351-359

Open Access Link
Is this table of contents incomplete? Click here to add the missing references

This document is unfortunately not available for download at the moment.