A Note on Assumptions about Skolem Functions

Ohlbach, Hans Jürgen; Weidenbach, Christoph

doi:10.1007/BF00881919

アイテム詳細

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

一時保存へ追加

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

公開

学術論文

A Note on Assumptions about Skolem Functions

MPS-Authors

/persons/resource/persons45140

Ohlbach, Hans Jürgen
Programming Logics, MPI for Informatics, Max Planck Society;

/persons/resource/persons45719

Weidenbach, Christoph
Automation of Logic, MPI for Informatics, Max Planck Society;
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource

https://rdcu.be/dtTFg
(出版社版)

Fulltext (restricted access)

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

フルテキスト (公開)

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

付随資料 (公開)

There is no public supplementary material available

引用

Ohlbach, H. J., & Weidenbach, C. (1995). A Note on Assumptions about Skolem Functions. Journal of Automated Reasoning, 15(2), 267-275. doi:10.1007/BF00881919.

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

要旨

Skolemization is not an equivalence preserving transformation. For the
purposes of refutational theorem proving it is sufficient that
Skolemization preserves satisfiability and unsatisfiability. Therefore
there is sometimes some freedom in interpreting Skolem functions in a
particular way. We show that in certain cases it is possible to
exploit this freedom for simplifying formulae considerably. Examples for cases
where
this occurs systematically are the relational translation from modal
logics to predicate logic and the relativization of first-order logics with
sorts.