2002•Lecture notes in computer scienceRequires access
Proof Analysis by Resolution
Matthias Baaz
Open publisher page 0 citations
Abstract
This record does not include an abstract. Use the full-text link above if available.
Matthias Baaz
Abstract
An abstract is not available in the OpenAlex record for this paper.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Key concepts: Mathematical proof, Proof theory, Automated theorem proving, Proof complexity, Constructive proof, Constructive, Structural proof theory, Computer-assisted proof