Mathematical LogicPetio P. Petkov Springer US, 31 ago 1990 - 412 páginas |
Índice
On the Early History of Intuitionistic Logic | 3 |
Heyting and Intuitionistic Geometry | 19 |
Provability Logics for Relative Interpretability | 31 |
Página de créditos | |
Otras 22 secciones no se muestran.
Otras ediciones - Ver todo
Términos y frases comunes
A₁ algebra algorithm atomic axiom axiomatized basic Boolean Bounded Arithmetic Brouwer C-critical called complete Computer Science constructive mathematics corresponding countable Curry-Howard isomorphism definability by means definition denote domain Edited by P. P. elements embedding equivalence exists EXPTIME extension finite set formula frames functor hence Heyting Heyting arithmetic IA+EXP induction interpretation intuitionistic linear intuitionistic logic isomorphic Kripke lambda calculus language Lemma logic programs Martin-Löf's type theory Math Mathematical Logic Mathematical Logic Edited means of logic modal logic natural numbers normal enumeration notion Nuprl obtained P. P. Petkov Plenum P₁ partial recursive PR(A predicate logic predicate symbol presheaf proof properties propositional logic provable prove PSPACE recursive function relation rules satisfying semantics sequence sharply bounded Sofia space strictly positive subset Suppose term theorem type theory unary V-weak admissible variables X₁ Y₁
Referencias a este libro
Handbook of Logic in Computer Science: Volume 4. Semantic Modelling Samson Abramsky,Dov M. Gabbay,T. S. E. Maibaum No hay ninguna vista previa disponible - 1992 |