| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10329188 | Electronic Notes in Theoretical Computer Science | 2005 | 14 Pages |
Abstract
We prove that the particularly narrow subset of the duration calculus which is defined by the BNFÏ::=â¥|âSâ|A|ÏâÏ|(Ï;Ï) is not recursively axiomatisable or, in other words, incomplete.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Dimitar P. Guelev,