A note on assumptions about Skolem functions (Q1904405): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: FLOTTER / rank | |||
Normal rank |
Revision as of 15:39, 29 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on assumptions about Skolem functions |
scientific article |
Statements
A note on assumptions about Skolem functions (English)
0 references
20 December 1995
0 references
The paper presents a sharpened Skolem theorem for first-order logic. This optimized skolemization technique does not produce an equivalent proposition, but it preserves satisfiability, which is enough for its use in refutational automated theorem-proving . This optimized skolemization can be decomposed into a transformation of the proposition to be refuted, followed by a standard skolemization. It generalizes optimized skolemization techniques known in special fields such as many-sorted first-order logic and modal logic.
0 references
preservation of satisfiability
0 references
sharpened Skolem theorem
0 references
first-order logic
0 references
refutational automated theorem-proving
0 references
skolemization
0 references