A compact representation of proofs (Q1102282): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Resolution in type theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3343471 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A formulation of the simple theory of types / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear reasoning. A new form of the Herbrand-Gentzen theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3338232 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Complete Mechanization of Second-Order Type Theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5559220 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hauptsatz for higher order logic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5636315 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5560258 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A proof of cut-elimination theorem in simple type-theory / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf00370646 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2084443499 / rank | |||
Normal rank |
Latest revision as of 09:26, 30 July 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