Proof compressions with circuit-structured substitutions (Q843604): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4399249 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Polynomial size proofs of the propositional pigeonhole principle / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4513125 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3007263 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On cut elimination in the presence of perice rule / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The intractability of resolution / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finite investigations of transfinite derivations / rank | |||
Normal rank |
Latest revision as of 09:51, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Proof compressions with circuit-structured substitutions |
scientific article |
Statements
Proof compressions with circuit-structured substitutions (English)
0 references
15 January 2010
0 references
proof size
0 references
automatic theorem proving
0 references
atomic-cuts proofs
0 references
cut-free proofs
0 references
circuit-structured deductions
0 references
unification
0 references