Mathematical LogicPetio P. Petkov Springer Science & Business Media, 6 de des. 2012 - 420 pàgines Heyting'88 Summer School and Conference on Mathematical Logic, held September 13 - 23, 1988 in Chaika, Bulgaria, was honourably dedicated to Arend Heyting's 90th anniversary. It was organized by Sofia University "Kliment Ohridski" on the occasion of its centenary and by the Bulgarian Academy of Sciences, with sponsorship of the Association for Symbolic Logic. The Meeting gathered some 115 participants from 19 countries. The present volume consists of invited and selected papers. Included are all the invited lectures submitted for publication and the 14 selected contributions, chosen out of 56 submissions by the Selection Committee. The selection was made on the basis of reports of PC members, an average of 4 per sLlbmission. All the papers are concentrated on the topics of the Meeting: Recursion Theory, Modal and Non-classical Logics, Intuitionism and Constructivism, Related Applications to Computer and Other Sciences, Life and Work of Arend Heyting. I am pleased to thank all persons and institutions that contributed to the success of the Meeting: sponsors, Programme Committee members and additional referees, the members of the Organizing Committee, our secretaries K. Lozanova and L. Nikolova, as well as K. Angelov, V. Bozhichkova, A. Ditchev, D. Dobrev, N. Dimitrov, R. Draganova, G. Gargov, N. Georgieva, M. Janchev, P. Marinov, S. Nikolova, S. Radev, I. Soskov, A. Soskova and v. Sotirov, who helped in the organization, Plenum Press and at last but not least all participants in the Meeting and contributors to this volume |
Continguts
| 3 | |
| 19 | |
Provability Logics for Relative Interpretability | 31 |
Constructive Mathematics and ComputerAssisted Reasoning Systems | 43 |
Normalization Theorems for the Intuitionistic Systems | 59 |
Formalizing the Notion of Total Information | 67 |
Structural Rules and a Logical Hierarchy | 95 |
Semantics of Nonclassical First Order Predicate Logics | 105 |
Order Isomorphisms a Constructive MeasureTheoretic View | 243 |
1Generic Enumeration Degrees Below Og | 257 |
Remarks on Denjoy Sets 267 | 266 |
Normal Modal Logic in Which the Heyting Proposotional Calculus | 281 |
Lattices Adequate for Intutionistic Predicate Logic | 293 |
Completeness and Incompleteness in the Bimodal Base LR R | 311 |
A Temporal Logic for Event Structures | 327 |
Completeness of Propositional Dynamic Logic | 339 |
On the Computational Power of the Logic Programs | 117 |
Some Relations among Systems for Bounded Arithmetic 139 | 138 |
A Survey of Intuitionistic Descriptive Set Theory | 155 |
Interpretability Logic | 175 |
Hierarchies of Frovably Computable Functions | 211 |
Sequent Calculus for Intuitionistic Linear Propositional Logic 223 | 222 |
Altres edicions - Mostra-ho tot
Frases i termes més freqüents
1-generic A₁ algebra algorithm atomic axiom axiomatized basic binary Boolean Bounded Arithmetic Brouwer BULGARIA calculus classical complete Computer Science condition consider constructive mathematics corresponding countable Curry-Howard isomorphism defined definition denote domain Edited by P. P. elements embedding equivalent event structure exists extension finite set formal formula frames functor hence Heyting Heyting arithmetic Heyting's holds IA+EXP induction infinite interpretation intuitionistic linear structure intuitionistic logic isomorphic Kripke lambda calculus language lattice Lemma logic programs Math Mathematical Logic Mathematical Logic Edited minimal modal logic natural numbers nodes normal enumeration notion Nuprl obtain operator P. P. Petkov Plenum paper Petkov Plenum Press PR(A predicate logic predicate symbol presheaf proof propositional logic provable prove recursive function relation result rules satisfying semantics sequence sequent calculus string subformula subset Suppose term theorem type theory unary valid variables