<電子ブック>
Logic from Computer Science : Proceedings of a Workshop held November 13–17, 1989 / edited by Yiannis N. Moschovakis
(Mathematical Sciences Research Institute Publications ; 21)
版 | 1st ed. 1992. |
---|---|
出版者 | New York, NY : Springer New York : Imprint: Springer |
出版年 | 1992 |
本文言語 | 英語 |
大きさ | XI, 608 p : online resource |
著者標目 | Moschovakis, Yiannis N editor SpringerLink (Online service) |
件 名 | LCSH:Mathematical logic LCSH:Machine theory FREE:Mathematical Logic and Foundations FREE:Formal Languages and Automata Theory |
一般注記 | Preface -- The Imperative Future: Past Successes Future Actions -- A Logical Operational Semantics of Full Prolog: Part III. Built-in Predicates for Files, Terms, Arithmetic and Input-Output -- Computability and Complexity of Higher Type Functions -- Constructively Equivalent Propositions and Isomorphisms of Objects, or Terms as Natural Transfomrations -- Logics for Termination and Correctness of Functional Programs -- Transparent Grammars -- Designing Unification Procedures Using Transformations: A survey -- NormaL Forms and Cut-Free Proofs as Natural Transformations -- Computer Implementation and Applications of Kleene’s S-M-N and Recursion Theorems -- 0–1 Laws for Fragments of Second-Order Logic: an Overview -- No Counter-Example Interpretation and Interactive Computation -- Semantic Characterizations of Number Theories -- Constructive Kripke Semantics and Realizability -- Splitting and Density for the Recursive Sets of a Fixed Time Complexity -- Reals and Forcing with an Elementary Topos -- Completeness Theorems for Logics of Feature Structures -- Concurrent Programs as Strategies in Games -- Finite and Infinite Dialogues -- Some Relations Between Subsystems of Arithmetic and Complexity of Computations -- Logics for Negation as Failure -- Normal Varieties of Combinators -- Complexity of Proofs in Classical Propositional Logic The volume is the outgrowth of a workshop with the same title held at MSRI in the week of November 13-17, 1989, and for those who did not get it, Logic from Computer Science is the converse of Logic in Computer Science, the full name of the highly successful annual LICS conferences. We meant to have a conference which would bring together the LICS commu nity with some of the more traditional "mathematical logicians" and where the emphasis would be on the flow of ideas from computer science to logic rather than the other way around. In a LICS talk, sometimes, the speaker presents a perfectly good theorem about (say) the A-calculus or finite model theory in terms of its potential applications rather than its (often more ob vious) intrinsic, foundational interest and intricate proof. This is not meant to be a criticism; the LICS meetings are, after all, organized by the IEEE Computer Society. We thought, for once, it would be fun to see what we would get if we asked the speakers to emphasize the relevance of their work for logic rather than computer science and to point out what is involved in the proofs. I think, mostly, it worked. In any case, the group of people represented as broad a selection of logicians as I have seen in recent years, and the quality of the talks was (in my view) exceptionally, unusually high. I learned a lot and (I think) others did too HTTP:URL=https://doi.org/10.1007/978-1-4612-2822-6 |
目次/あらすじ
所蔵情報を非表示
電子ブック | 配架場所 | 資料種別 | 巻 次 | 請求記号 | 状 態 | 予約 | コメント | ISBN | 刷 年 | 利用注記 | 指定図書 | 登録番号 |
---|---|---|---|---|---|---|---|---|---|---|---|---|
電子ブック | オンライン | 電子ブック |
|
|
Springer eBooks | 9781461228226 |
|
電子リソース |
|
EB00227334 |
書誌詳細を非表示
データ種別 | 電子ブック |
---|---|
分 類 | LCC:QA8.9-10.3 DC23:511.3 |
書誌ID | 4000105552 |
ISBN | 9781461228226 |
類似資料
この資料の利用統計
このページへのアクセス回数:8回
※2017年9月4日以降