ShopSpell

Mathematical Logic and Its Applications [Paperback]

$42.99     $54.99    22% Off      (Free Shipping)
100 available
  • Category: Books (Gardening)
  • ISBN-10:  1461282349
  • ISBN-10:  1461282349
  • ISBN-13:  9781461282341
  • ISBN-13:  9781461282341
  • Publisher:  Springer
  • Publisher:  Springer
  • Pages:  386
  • Pages:  386
  • Binding:  Paperback
  • Binding:  Paperback
  • Pub Date:  01-Feb-2011
  • Pub Date:  01-Feb-2011
  • SKU:  1461282349-11-SPRI
  • SKU:  1461282349-11-SPRI
  • Item ID: 100827789
  • List Price: $54.99
  • Seller: ShopSpell
  • Ships in: 5 business days
  • Transit time: Up to 5 business days
  • Delivery by: Jul 05 to Jul 07
  • Notes: Brand New Book. Order Now.
G?del Session (Invited Papers).- Remarks Concerning Kurt G?dels 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.Springer Book Archives
Add Review