Quantifier Elimination in Second-Order Predicate Logic

Gabbay, Dov M.; Ohlbach, Hans Jürgen

アイテム詳細

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

一時保存へ追加

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

公開

学術論文

Quantifier Elimination in Second-Order Predicate Logic

MPS-Authors

Gabbay, Dov M.
Max Planck Society;

/persons/resource/persons45140

Ohlbach, Hans Jürgen
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

引用

Gabbay, D. M., & Ohlbach, H. J. (1992). Quantifier Elimination in Second-Order Predicate Logic. South African Computer Journal, 7, 35-43.

引用: https://hdl.handle.net/11858/00-001M-0000-0014-AE1B-8

要旨

An algorithm is presented which eliminates second-order quantifiers over predicate variables in formulae of type $\exists P_1, \ldots, P_n \psi$ where $\psi$ is an arbitrary formula of first-order predicate logic. The resulting formula is equivalent to the original formula - if the algorithm terminates. The algorithm can for example be applied to do interpolation, to eliminate the second-order quantifiers in circumscription, to compute the correlations between structures and power structures, to compute semantic properties corresponding to Hilbert axioms in non classical logics and to compute model theoretic semantics for new logics.