↓ Skip to main content
Altmetric
What is this page?
Embed badge
Share
Share on Twitter
Share on Facebook
Share by email
Logic from Computer Science : Proceedings of a Workshop held November 13–17, 1989
Overview of attention for book
Table of Contents
Altmetric Badge
Book Overview
Altmetric Badge
Chapter 1
The Imperative Future: Past Successes ⇒ Future Actions
Altmetric Badge
Chapter 2
A Logical Operational Semantics of Full Prolog: Part III. Built-In Predicates for Files, Terms, Arithmetic and Input-Output
Altmetric Badge
Chapter 3
Computability and Complexity of Higher Type Functions
Altmetric Badge
Chapter 4
Constructively Equivalent Propositions and Isomorphisms of Objects, or Terms as Natural Transformations
Altmetric Badge
Chapter 5
Logics for Termination and Correctness of Functional Programs
Altmetric Badge
Chapter 6
Transparent Grammars
Altmetric Badge
Chapter 7
Designing Unification Procedures Using Transformations: A Survey
Altmetric Badge
Chapter 8
Normal Forms and Cut-Free Proofs as Natural Transformations
Altmetric Badge
Chapter 9
Computer Implementation and Applications of Kleene’s S-M-N and Recursion Theorems
Altmetric Badge
Chapter 10
0–1 Laws for Fragments of Second-Order Logic: An Overview
Altmetric Badge
Chapter 11
No Counter-Example Interpretation and Interactive Computation
Altmetric Badge
Chapter 12
Semantic Characterizations of Number Theories
Altmetric Badge
Chapter 13
Constructive Kripke Semantics and Realizability
Altmetric Badge
Chapter 14
Splitting and Density for the Recursive Sets of a Fixed Time Complexity
Altmetric Badge
Chapter 15
Reals and Forcing with an Elementary Topos
Altmetric Badge
Chapter 16
Completeness Theorems for Logics of Feature Structures
Altmetric Badge
Chapter 17
Concurrent Programs as Strategies in Games
Altmetric Badge
Chapter 18
Finite and Infinite Dialogues
Altmetric Badge
Chapter 19
Some Relations Between Subsystems of Arithmetic and Complexity of Computations
Altmetric Badge
Chapter 20
Logics for Negation as Failure
Altmetric Badge
Chapter 21
Normal Varieties of Combinators
Altmetric Badge
Chapter 22
Complexity of Proofs in Classical Propositional Logic
Overall attention for this book and its chapters
Altmetric Badge
Mentioned by
twitter
1
X user
syllabi
1
institution with syllabi
Citations
dimensions_citation
2
Dimensions
Book overview
1. The Imperative Future: Past Successes ⇒ Future Actions
2. A Logical Operational Semantics of Full Prolog: Part III. Built-In Predicates for Files, Terms, Arithmetic and Input-Output
3. Computability and Complexity of Higher Type Functions
4. Constructively Equivalent Propositions and Isomorphisms of Objects, or Terms as Natural Transformations
5. Logics for Termination and Correctness of Functional Programs
6. Transparent Grammars
7. Designing Unification Procedures Using Transformations: A Survey
8. Normal Forms and Cut-Free Proofs as Natural Transformations
9. Computer Implementation and Applications of Kleene’s S-M-N and Recursion Theorems
10. 0–1 Laws for Fragments of Second-Order Logic: An Overview
11. No Counter-Example Interpretation and Interactive Computation
12. Semantic Characterizations of Number Theories
13. Constructive Kripke Semantics and Realizability
14. Splitting and Density for the Recursive Sets of a Fixed Time Complexity
15. Reals and Forcing with an Elementary Topos
16. Completeness Theorems for Logics of Feature Structures
17. Concurrent Programs as Strategies in Games
18. Finite and Infinite Dialogues
19. Some Relations Between Subsystems of Arithmetic and Complexity of Computations
20. Logics for Negation as Failure
21. Normal Varieties of Combinators
22. Complexity of Proofs in Classical Propositional Logic
Summary
X
Syllabi
Dimensions citations
This data is correct as of December 2015 - for more up to date information, please visit
https://opensyllabus.org/
So far, Altmetric has seen this research output assigned in
2
syllabi from
1
institutions on Open Syllabus Project.
Institution
Syllabi count
Course subject areas covered
Unknown
2
Unknown