Pages that link to "Item:Q1762353"
From MaRDI portal
The following pages link to The computational content of arithmetical proofs (Q1762353):
Displaying 18 items.
- Formal and efficient primality proofs by use of computer algebra oracles (Q597112) (← links)
- The computational content of Walras' existence theorem (Q632841) (← links)
- On the computational complexity of cut-reduction (Q636310) (← links)
- On computer-assisted proofs in ordinal number theory (Q1284712) (← links)
- Extended normal form theorems for logical proofs from axioms (Q1575930) (← links)
- Randomized proofs in arithmetic (Q1807460) (← links)
- Interaction with the Boyer-Moore theorem prover: A tutorial study using the arithmetic-geometric mean theorem (Q1915139) (← links)
- The Robbins problem: computer proofs and human proofs (Q2746807) (← links)
- Producing proofs from an arithmetic decision procedure in elliptical LF (Q2844808) (← links)
- (Q3081652) (← links)
- On the non-confluence of cut-elimination (Q3083141) (← links)
- (Q3136460) (← links)
- A Complete Axiomatization of Computer Arithmetic (Q3694696) (← links)
- (Q4012886) (← links)
- On Gödel's theorems on lengths of proofs I: Number of lines and speedup for arithmetics (Q4314669) (← links)
- (Q4489486) (← links)
- (Q4513965) (← links)
- Expansion trees with cut (Q5236547) (← links)