A compact representation of proofs (Q1102282): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 03:12, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A compact representation of proofs |
scientific article |
Statements
A compact representation of proofs (English)
0 references
1987
0 references
To save information that could be extracted from automatically generated proofs, structures called expansion trees are introduced. These trees provide a computationally useful representation of proofs in classical first-order logic and some of its extensions. Moreover, they can be easily manipulated and transformed. Explicit transformations are presented between expansion tree proofs and cut-free proofs in the sequential calculus. Similar transformations are possible also into Craig style linear proofs giving interpolants whenever they exist. A fragment of simple type theory is used as underlying logic. A stronger form of first-order interpolation theorem is proved and a correct description of Skolem functions and the Herbrand universe is provided.
0 references
proof trees
0 references
sequent calculus
0 references
automatically generated proofs
0 references
expansion trees
0 references
linear proofs
0 references
fragment of simple type theory
0 references
first-order interpolation theorem
0 references
Skolem functions
0 references
Herbrand universe
0 references