Mathematical logic and its applications

Repository | Book

Mathematical logic and its applications

edited byDimiter G. Skordev

Details | Table of Contents

Remarks concerning Kurt Gödel's life and work Curt C. Christian

pp.3-7

https://doi.org/10.1007/978-1-4613-0897-3_1

Facets of incompleteness John Dawson

pp.9-21

https://doi.org/10.1007/978-1-4613-0897-3_2

Godel's life and work P. P. Petkov

pp.23-36

https://doi.org/10.1007/978-1-4613-0897-3_3

Categorial grammar and lambda calculus Johan van Benthem

pp.39-60

https://doi.org/10.1007/978-1-4613-0897-3_4

A constructive morse theory of sets Douglas Bridges

pp.61-79

https://doi.org/10.1007/978-1-4613-0897-3_5

Differentiation of constructive functions of a real variable and relative computability Osvald Demuth Pavel Filipec

pp.81-106

https://doi.org/10.1007/978-1-4613-0897-3_6

A completeness theorem for higher-order intuitionistic logic

an intuitionistic proof

A. G. Dragalin

pp.107-124

https://doi.org/10.1007/978-1-4613-0897-3_7

Reasoning in trees Herman Ruge Jervell

pp.125-135

https://doi.org/10.1007/978-1-4613-0897-3_8

Non-deterministic program schemata and their relation to dynamic logic V. A. Nepomniaschy N. V. Shilov

pp.137-147

https://doi.org/10.1007/978-1-4613-0897-3_9

The parallel evaluation of functional programs Alberto Pettorossi Andrzej Skowron

pp.149-165

https://doi.org/10.1007/978-1-4613-0897-3_10

Logic approximating sequences of sets Helena Rasiowa

pp.167-186

https://doi.org/10.1007/978-1-4613-0897-3_11

Intuitionistic formal spaces — a first communication Giovanni Sambin

pp.187-204

https://doi.org/10.1007/978-1-4613-0897-3_12

On the logic of small changes in theories II Krister Segerberg

pp.205-211

https://doi.org/10.1007/978-1-4613-0897-3_13

On "logical relations" in program semantics Boris A. Trakhtenbrot

pp.213-229

https://doi.org/10.1007/978-1-4613-0897-3_14

Search computability and computability with numberings are equivalent in the case of finite set of objects Angel V. Ditchev

pp.233-242

https://doi.org/10.1007/978-1-4613-0897-3_15

Cut-elimination theorem for higher-order classical logic

an intuitionistic proof

A. G. Dragalin

pp.243-251

https://doi.org/10.1007/978-1-4613-0897-3_16

Modal environment for boolean speculations George Gargov Solomon Passy Tinko Tinchev

pp.253-263

https://doi.org/10.1007/978-1-4613-0897-3_17

Distributive spaces Ljubomir L. Ivanov

pp.265-272

https://doi.org/10.1007/978-1-4613-0897-3_18

Approximating the projective model Evangelos Kranakis

pp.273-282

https://doi.org/10.1007/978-1-4613-0897-3_19

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

pp.283-292

https://doi.org/10.1007/978-1-4613-0897-3_20

Constructive theories with abstract data types for program synthesis Pierangelo Miglioli Ugo Moscato Mario Ornaghi

pp.293-302

https://doi.org/10.1007/978-1-4613-0897-3_21

A first order logic for logic programming J J Moreno Navarro M Rodriguez Artalejo

pp.303-314

https://doi.org/10.1007/978-1-4613-0897-3_22

The relational semantics for branched quantifiers Marcin Mostowski

pp.315-322

https://doi.org/10.1007/978-1-4613-0897-3_23

Propositional dynamic logic in two- and more dimensions Assen Petkov

pp.323-329

https://doi.org/10.1007/978-1-4613-0897-3_24

On a nonconstructive type theory and program derivation Jan M. Smith

pp.331-340

https://doi.org/10.1007/978-1-4613-0897-3_25

Prime computability on partial structures Ivan N. Soskov

pp.341-350

https://doi.org/10.1007/978-1-4613-0897-3_26

Complexity bounded Martin-Löf tests Marius Zimand

pp.351-359

https://doi.org/10.1007/978-1-4613-0897-3_27

Publication details

Publisher: Springer

Place: Dordrecht

Year: 1987

Pages: 371

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

ISBN (hardback): 978-1-4612-8234-1

ISBN (digital): 978-1-4613-0897-3

Full citation:

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