The following pages link to (Q4332419):
Displaying 18 items.
- Programming and automating mathematics in the Tarski-Kleene hierarchy (Q406433) (← links)
- Dealing with negative conditions in automated proving: tools and challenges. The unexpected consequences of Rabinowitsch's trick (Q783254) (← links)
- The Ackermann constant theorem: A computer-assisted investigation (Q1181706) (← links)
- Automated deduction with associative-commutative operators (Q1340508) (← links)
- Autarkic computations in formal proofs (Q1610674) (← links)
- Algorithmic structural completeness and a retrieval system for proving theorems in algorithmic theories (Q2757280) (← links)
- Automated Reasoning in Higher-Order Regular Algebra (Q2915136) (← links)
- Automating Change of Representation for Proofs in Discrete Mathematics (Q3453117) (← links)
- Automating Proofs in Category Theory (Q3613422) (← links)
- Automated Synthesis of Combinational Logic Using Theorem-Proving Techniques (Q3682397) (← links)
- (Q4429034) (← links)
- Factor Varieties and Symbolic Computation (Q4635937) (← links)
- (Q4816538) (← links)
- Automated Algebraic Reasoning for Collections and Local Variables with Lenses (Q5098716) (← links)
- (Q5186757) (← links)
- Computer Science Logic (Q5311280) (← links)
- The Alf proof editor and its proof engine (Q6083695) (← links)
- Automating algebraic proof systems is NP-hard (Q6086995) (← links)