32:
65:
169:
153:
42:
83:
51:
124:
112:
104:
61:
47:
57:
8:
19:
This article is about automated theorem proving. For the complexity class named EQP, see
108:
20:
120:
116:
147:
115:. It was one of the provers used for solving a longstanding problem posed by
163:
154:
Argonne
National Laboratory, Mathematics and Computer Science Division
141:
111:, developed by the Mathematics and Computer Science Division of the
31:
161:
46:, potentially preventing the article from being
66:reliable, independent, third-party sources
84:Learn how and when to remove this message
60:by replacing them with more appropriate
43:too closely associated with the subject
162:
25:
13:
14:
181:
135:
170:Theorem proving software systems
41:may rely excessively on sources
30:
1:
130:
148:Robbins Algebras Are Boolean
7:
113:Argonne National Laboratory
10:
186:
18:
105:automated theorem proving
119:, namely, whether all
101:Equational prover
94:
93:
86:
177:
125:Boolean algebras
121:Robbins algebras
109:equational logic
89:
82:
78:
75:
69:
34:
26:
21:EQP (complexity)
16:Software program
185:
184:
180:
179:
178:
176:
175:
174:
160:
159:
138:
133:
117:Herbert Robbins
90:
79:
73:
70:
55:
35:
24:
17:
12:
11:
5:
183:
173:
172:
158:
157:
151:
145:
137:
136:External links
134:
132:
129:
92:
91:
38:
36:
29:
15:
9:
6:
4:
3:
2:
182:
171:
168:
167:
165:
155:
152:
149:
146:
143:
140:
139:
128:
126:
122:
118:
114:
110:
106:
102:
98:
88:
85:
77:
67:
63:
59:
53:
49:
45:
44:
39:This article
37:
33:
28:
27:
22:
107:program for
100:
96:
95:
80:
71:
56:Please help
40:
142:EQP project
131:References
74:March 2024
58:improve it
48:verifiable
62:citations
164:Category
103:) is an
52:neutral
123:are
50:and
97:EQP
64:to
166::
127:.
156:.
150:.
144:.
99:(
87:)
81:(
76:)
72:(
68:.
54:.
23:.
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
