Mathematical Logic (eBook, PDF)

Redaktion: Petkov, Petio P.

• Format: PDF

Produktbeschreibung

Zur Zeit liegt uns keine Inhaltsangabe vor.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Springer US
• Seitenzahl: 420
• Erscheinungstermin: 6. Dezember 2012
• Englisch
• ISBN-13: 9781461306092
• Artikelnr.: 44063437

Inhaltsangabe

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.- Markov's 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 Markov's 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.