Produktbild: Mathematical Logic and Its Applications

Mathematical Logic and Its Applications

74,99 €

inkl. gesetzl. MwSt., Versandkostenfrei


Beschreibung

Produktdetails

Einband

Gebundene Ausgabe

Herausgeber

Dimiter G. Skordev

Verlag

Kluwer Academic Publishers Group

Seitenzahl

386

Gewicht

880 g

Auflage

1987

Sprache

Englisch

ISBN

978-0-306-42599-8

Beschreibung

Produktdetails

Einband

Gebundene Ausgabe

Herausgeber

Dimiter G. Skordev

Verlag

Kluwer Academic Publishers Group

Seitenzahl

386

Gewicht

880 g

Auflage

1987

Sprache

Englisch

ISBN

978-0-306-42599-8

Herstelleradresse

Springer Heidelberg
Tiergartenstr. 17
69121 Heidelberg
DE
buchhandel-buch@springer.com

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)

  • Produktbild: Mathematical Logic and Its Applications
  • Gödel Session (Invited Papers).- Remarks Concerning Kurt Gödel's Life and Work.- Facets of Incompleteness.- Goder s Life and Work.- Summer School (Invited Papers).- Categorial Grammar Lambda Calculus.- A Constructive Morse Theory of Sets.- Differentiation of Constructive Functions of a Real Variable and Relative Computability.- A Completeness Theorem for Higher-Order Intuitionistic Logic: An Intuitionistic Proof.- Reasoning in Trees.- Non-Deterministic Program Schemata and their Relation to Dynamic Logic.- The Parallel Evaluation of Functional Programs.- Logic Approximating Sequences of Sets.- Intuitionistic Formal Spaces - A First Communication.- On the Logic of Small Changes in Theories, II.- On 'Logical Relations' in Program Semantics.- Conference (Contributed Papers).- Search Computabi1ity and Computabi1ity with Numberings Are Equivalent the Case of Finite Set of Objects.- Cut-Elimination Theorem for Higher-Order Classical Logic. An Intuitionistic Proof.- Modal Environment for Boolean Speculations.- Distributive Spaces.- Approximating the Projective Model.- Projection Complete Graph Problems Corresponding to a Branching-Program-Based Characterization of the Complexity Classes HC2, L and NL.- Constructive Theories with Abstract Data Types for Program Synthesis.- A First-Order Logic for Logic Programming.- The Relational Semantics for Branched Quantifiers.- Propositional Dynamic Logic in Two- and More Dimensions.- On a Non-Constructive Type Theory and Program Derivation.- Prime Computabi1ity on Partial Structures.- Complexity Bounded Martin-Löf Tests.- Participants and Contributors.