Name
Abstract | ||
|---|---|---|
The purpose of a logical framework such as LF is to provide a language for defining logical systems suitable for use in a logic-independent proof development environment. All inferential activity in an object logic (in particular, proof search) is to be conducted in the logical framework via the representation of that logic in the framework. An important tool for controlling search in an object logic, the need for which is motivated by the difficulty of reasoning about large and complex systems, is the use of structured theory presentations. In this paper a rudimentary language of structured theory presentations is presented, and the use of this structure in proof search for an arbitrary object logic is explored. The behaviour of structured theory presentations under representation in a logical framework is studied, focusing on the problem of “lifting” presentations from the object logic to the metalogic of the framework. The topic of imposing structure on logic presentations, so that logical systems may themselves be defined in a modular fashion, is also briefly considered. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1016/0168-0072(94)90009-4 | Annals of Pure and Applied Logic |
Keywords | Field | DocType |
development environment,logical framework | Discrete mathematics,Computational logic,Programming language,Metalogic,Non-classical logic,Computer science,Proof theory,Algorithm,Bunched logic,First-order logic,Logical framework,Dynamic logic (modal logic) | Journal |
Volume | Issue | ISSN |
67 | 1-3 | 0168-0072 |
Citations | PageRank | References |
27 | 1.30 | 35 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Robert Harper | 1 | 2213 | 225.81 |
| Donald Sannella | 2 | 27 | 1.64 |
| Andrzej Tarlecki | 3 | 1514 | 124.61 |