A Note on Assumptions about Skolem Functions

Ohlbach, Hans Jürgen; Weidenbach, Christoph

doi:10.1007/BF00881919

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

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
(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

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.

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

Abstract

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.