A note on assumptions about Skolem functions (Q1904405): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(6 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Hans Jürgen Ohlbach / rank | |||
Property / author | |||
Property / author: Hans Jürgen Ohlbach / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: FLOTTER / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: OTTER / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3867808 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4139711 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Semantics-Based Translation Methods for Modal Logics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Seventy-five problems for testing automatic theorem provers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computational aspects of an order-sorted logic with term declarations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3992821 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 08:57, 24 May 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