ShopSpell

Mathematical Logic [Paperback]

$42.99     $54.99    22% Off      (Free Shipping)
100 available
  • Category: Books (Mathematics)
  • ISBN-10:  1461278902
  • ISBN-10:  1461278902
  • ISBN-13:  9781461278900
  • ISBN-13:  9781461278900
  • Publisher:  Springer
  • Publisher:  Springer
  • Pages:  420
  • Pages:  420
  • Binding:  Paperback
  • Binding:  Paperback
  • Pub Date:  01-Mar-2011
  • Pub Date:  01-Mar-2011
  • SKU:  1461278902-11-SPRI
  • SKU:  1461278902-11-SPRI
  • Item ID: 100827785
  • List Price: $54.99
  • Seller: ShopSpell
  • Ships in: 5 business days
  • Transit time: Up to 5 business days
  • Delivery by: Jul 04 to Jul 06
  • Notes: Brand New Book. Order Now.
Heyting Session (Invited Papers).- On the Early History of Intuitionistic Logic.- Heyting and Intuitionistic Geometry.- Summer School (Invited Lectures).- Provability Logics for Relative Interpretability.- Constructive Mathematics and Computer-Assisted Reasoning Systems.- Markovs Constructive Mathematical Analysis: the Expextations and Results.- Normalization Theorems for the Intuitionistic Systems with Choice Principles.- Formalizing the Notion of Total Information.- Structural Rules and a Logical Hierarchy.- Semantics of Non-classical First Order Predicate Logics.- On the Computational Power of the Logic Programs.- Some Relations among Systems for Bounded Arithmetic.- A Survey of Intuitionistic Descriptive Set Theory.- Interpretability Logic.- Hierarchies of Provably Computable Functions.- Conference (Contributed Papers).- Sequent Calculus for Intuitionistic Linear Propositional Logic.- Order Isomorphisms  a Constructive Measure-Theoretic View.- 1-Generic Enumeration Degrees Below Oe.- Remarks on Denjoy Sets.- Normal Modal Logic in Which the Heyting Proposotional Calculus Can be Embedded.- Lattices Adequate for Intutionistic Predicate Logic.- A Note on Boolean Modal Logic.- Completeness and Incompleteness in the Bimodal Base L(R,?R).- A Temporal Logic for Event Structures.- Completeness of Propositional Dynamic Logic with Infinite Repeating.- An Equivalence between Polinomial Constructivity of Markovs Principle and Equality P=NP.- Effective Enumerations of Abstract Structures.- Modal Characterization of the Classes of Finite and Infinite Quasi-Ordered Sets.- Least Fixed Points in Preassociative Combinatory Algebras.- Participants, Contributors and Programme Committee Members.Springer Book Archives
Add Review