Structuring Metatheory on Inductive Definitions

Matthews, Seán; Basin, David A.

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

学術論文

Structuring Metatheory on Inductive Definitions

MPS-Authors

/persons/resource/persons45002

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

/persons/resource/persons44075

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

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Matthews, S., & Basin, D. A. (2000). Structuring Metatheory on Inductive Definitions. Information and Computation, 162(1/2), 80-95.

引用: https://hdl.handle.net/11858/00-001M-0000-000F-346F-B

要旨

We examine a problem for machine supported metatheory. There are statements true about a theory that are true of some (but only some) extensions; however standard theory-structuring facilities do not support selective inheritance. We use the example of the deduction theorem for modal logic and show how a statement about a theory can explicitly formalize the closure conditions extensions should satisfy for it to remain true. We show how metatheories based on inductive definitions allow theories and general metatheorems to be organized hierarchically this way, and report on a case study using the theory FS0.