Mathematical Logic and Its Applications
Editat de Dimiter G. Skordeven Limba Engleză Paperback – 5 noi 2011
Preț: 381.55 lei
Puncte Express: 572
Carte tipărită la comandă
Livrare economică 16-30 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9781461282341
ISBN-10: 1461282349
Pagini: 388
Ilustrații: 386 p.
Dimensiuni: 170 x 244 x 20 mm
Greutate: 0.62 kg
Ediția:1987
Editura: Springer Us
Colecția Springer
Locul publicării:New York, NY, United States
ISBN-10: 1461282349
Pagini: 388
Ilustrații: 386 p.
Dimensiuni: 170 x 244 x 20 mm
Greutate: 0.62 kg
Ediția:1987
Editura: Springer Us
Colecția Springer
Locul publicării:New York, NY, United States
Public țintă
ResearchCuprins
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.