Shortcuts
Please wait while page loads.
SISSA Library . Default .
PageMenu- Main Menu-
Page content

Catalogue Display

Mathematical Logic and Its Applications

Mathematical Logic and Its Applications
Catalogue Information
Field name Details
Dewey Class 511.3
Title Mathematical Logic and Its Applications ([EBook] /) / edited by Dimiter G. Skordev.
Added Personal Name Skordev, Dimiter G. editor.
Other name(s) SpringerLink (Online service)
Publication Boston, MA : : Springer US, , 1987.
Physical Details 386 p. : online resource.
ISBN 9781461308973
Contents note 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.
System details note Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users)
Internet Site http://dx.doi.org/10.1007/978-1-4613-0897-3
Links to Related Works
Subject References:
Authors:
Corporate Authors:
Classification:
Catalogue Information 45019 Beginning of record . Catalogue Information 45019 Top of page .

Reviews


This item has not been rated.    Add a Review and/or Rating45019
Quick Search