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

Catalogue Display

Mathematical Logic

Mathematical Logic
Catalogue Information
Field name Details
Dewey Class 511.3
Title Mathematical Logic ([EBook] /) / edited by Petio Petrov Petkov.
Added Personal Name Petkov, Petio Petrov editor.
Other name(s) SpringerLink (Online service)
Publication Boston, MA : : Springer US, , 1990.
Physical Details 420 p. : online resource.
ISBN 9781461306092
Contents note 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.
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-0609-2
Links to Related Works
Subject References:
Authors:
Corporate Authors:
Classification:
Catalogue Information 43182 Beginning of record . Catalogue Information 43182 Top of page .

Reviews


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