ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Diamond formulas: a fragment of dynamic logic with recursively enumerable validity problem
Source Information and Control archive
Volume 61 ,  Issue 2  (May 1984) table of contents
Pages: 147 - 158  
Year of Publication: 1984
ISSN:0019-9958
Author
Peter H. Schmitt  Univ. Heidelberg, West Germany
Publisher
Academic Press Professional, Inc.  San Diego, CA, USA
Bibliometrics
Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 1
Additional Information:

cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: 10.1016/S0019-9958(84)80055-8

CITED BY
Daniel Leivant, Inductive Completeness of Logics of Programs, Electronic Notes in Theoretical Computer Science (ENTCS), 228, p.101-112, January, 2009

INDEX TERMS

Classification:
  F. Theory of Computation
  F.4 MATHEMATICAL LOGIC AND FORMAL LANGUAGES
      F.4.1 Mathematical Logic
          Subjects: Mechanical theorem proving; Recursive function theory


General Terms:
Theory

Collaborative Colleagues:
Peter H. Schmitt: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player