English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse
  1. View item / 
  2. Item Summary

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Structuring metatheory on inductive definitions

MPS-Authors
/persons/resource/persons44075

Basin,  David A.
Programming Logics, MPI for Informatics, Max Planck Society;

/persons/resource/persons45002

Matthews,  Seán
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource

https://rdcu.be/dtpNw
(Publisher version)

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Basin, D. A., & Matthews, S. (1996). Structuring metatheory on inductive definitions. In M. A. McRobbie, & J. K. Slaney (Eds.), Proceedings of the 13th International Conference on Automated Deduction (CADE-13) (pp. 171-185). Berlin, Germany: Springer.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AC17-2
Abstract
We examine a problem in formal metatheory: if theories are structured hierarchically, there are metatheorems which hold in only some extensions. We illustrate this using modal logics and the deduction theorem. We show how statements of metatheorems in such hierarchies can take account of possible theory extensions; i.e., a metatheorem formalizes not only the theory in which it holds, but also under what extensions, both to the language and proof system, it remains valid. We show that FS/sub 0/, a system for formal metamathematics, provides a basis for organizing theories this way, and we report on our practical experience.