The following pages link to Solution of the Robbins problem (Q1373299):
Displaying 50 items.
- Mechanizing complemented lattices within Mizar type system (Q286797) (← links)
- Automated inference of finite unsatisfiability (Q438540) (← links)
- A method for finding new sets of axioms for classes of semigroups. (Q453187) (← links)
- An introduction to mechanized reasoning (Q504394) (← links)
- MPTP-motivation, implementation, first experiments (Q556682) (← links)
- Ken Kunen: algebraist. (Q649602) (← links)
- Single axioms for groups (Q688567) (← links)
- Problem corner: Robbins algebra: Conditions that make a near-Boolean algebra Boolean (Q751313) (← links)
- Computer supported mathematics with \(\Omega\)MEGA (Q865650) (← links)
- Superposition-based equality handling for analytic tableaux (Q877891) (← links)
- Computer-aided proof of Erdős discrepancy properties (Q892235) (← links)
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (Q899436) (← links)
- Complete axiomatizations for XPath fragments (Q975868) (← links)
- Absorption and idempotency criteria for a problem in near-Boolean algebras (Q1204453) (← links)
- Robbins algebras are Boolean: A revision of McCune's computer-generated solution of Robbins problem (Q1273392) (← links)
- On the modelling of search in theorem proving -- towards a theory of strategy analysis (Q1281504) (← links)
- The resonance strategy (Q1343396) (← links)
- Using the prover ANDP to simplify orthogonality. (Q1412831) (← links)
- Theorem proving modulo (Q1431339) (← links)
- Evaluating general purpose automated theorem proving systems (Q1606324) (← links)
- Automated conjecturing. III. Property-relations conjectures (Q1688717) (← links)
- The application of automated reasoning to formal models of combinatorial optimization (Q1854978) (← links)
- Simplifying von Plato's axiomatization of constructive apartness geometry (Q1964142) (← links)
- Knowledge-based proof planning (Q1978469) (← links)
- Additive number theory via automata theory (Q1987517) (← links)
- Larry Wos: visions of automated reasoning (Q2102922) (← links)
- Relaxed weighted path order in theorem proving (Q2209265) (← links)
- Basis reduction for cryptogroups and orthogroups (Q2216527) (← links)
- Certified equational reasoning via ordered completion (Q2305436) (← links)
- On computer-assisted proving the existence of periodic and bounded orbits (Q2363617) (← links)
- Experimental mathematics, computers and the a priori (Q2441736) (← links)
- Automated conjecture making in number theory using HR, Otter and Maple (Q2456561) (← links)
- Linear groupoids and the associated wreath products. (Q2456592) (← links)
- From informal to formal proofs in Euclidean geometry (Q2631958) (← links)
- Robbins algebras vs. Boolean algebras (Q2767933) (← links)
- Automated Deduction in Ring Theory (Q2819201) (← links)
- Checking Proofs (Q2950035) (← links)
- Proof Verification Technology and Elementary Physics (Q3296311) (← links)
- On Automating the Calculus of Relations (Q3541686) (← links)
- Computer Solutions of Problems in Inverse Semigroups (Q3562322) (← links)
- Computational logic: its origins and applications (Q4559535) (← links)
- Discovering boundary algebra: A simple notation for Boolean algebra and the truth functors (Q4807997) (← links)
- The Legacy of a Great Researcher (Q4913858) (← links)
- The Strategy Challenge in SMT Solving (Q4913859) (← links)
- MACE4 and SEM: A Comparison of Finite Model Generators (Q4913862) (← links)
- Harald Ganzinger’s Legacy: Contributions to Logics and Programming (Q4916069) (← links)
- Deduction as an Engineering Science (Q4916217) (← links)
- (Q4953923) (← links)
- Building Theorem Provers (Q5191110) (← links)
- Automated Inference of Finite Unsatisfiability (Q5191115) (← links)
