279:
188:
104:
233:
136:
320:
339:
71:. (This is the non-deterministic part of the algorithm, as there may be more than one valid prenex normal form for the given formula.)
354:
264:
256:
349:
344:
313:
29:
149:
194:
306:
37:
155:
77:
52:
41:
17:
200:
109:
286:
245:
68:
21:
63:
The Tarski–Kuratowski algorithm for the arithmetical hierarchy consists of the following steps:
260:
252:
290:
333:
48:
33:
278:
141:
Otherwise, count the number of alternations of quantifiers; call this
249:
The Theory of
Recursive Functions and Effective Computability
294:
203:
158:
112:
80:
227:
182:
130:
98:
314:
36:for the complexity of a given formula in the
8:
74:If the formula is quantifier-free, it is in
321:
307:
219:
208:
202:
174:
163:
157:
122:
117:
111:
90:
85:
79:
7:
275:
273:
205:
160:
114:
82:
14:
183:{\displaystyle \Sigma _{k+1}^{0}}
277:
99:{\displaystyle \Sigma _{0}^{0}}
340:Mathematical logic hierarchies
228:{\displaystyle \Pi _{k+1}^{0}}
1:
47:The algorithm is named after
293:. You can help Knowledge by
131:{\displaystyle \Pi _{0}^{0}}
193:If the first quantifier is
148:If the first quantifier is
30:non-deterministic algorithm
26:Tarski–Kuratowski algorithm
371:
272:
355:Mathematical logic stubs
67:Convert the formula to
289:-related article is a
229:
184:
132:
100:
38:arithmetical hierarchy
350:Theory of computation
230:
185:
133:
101:
345:Computability theory
201:
197:, the formula is in
156:
152:, the formula is in
110:
78:
53:Kazimierz Kuratowski
42:analytical hierarchy
18:computability theory
224:
179:
127:
95:
287:mathematical logic
225:
204:
180:
159:
128:
113:
96:
81:
69:prenex normal form
22:mathematical logic
302:
301:
32:that produces an
362:
323:
316:
309:
281:
274:
234:
232:
231:
226:
223:
218:
189:
187:
186:
181:
178:
173:
137:
135:
134:
129:
126:
121:
105:
103:
102:
97:
94:
89:
370:
369:
365:
364:
363:
361:
360:
359:
330:
329:
328:
327:
270:
246:Rogers, Hartley
242:
199:
198:
154:
153:
108:
107:
76:
75:
61:
12:
11:
5:
368:
366:
358:
357:
352:
347:
342:
332:
331:
326:
325:
318:
311:
303:
300:
299:
282:
268:
267:
241:
238:
237:
236:
222:
217:
214:
211:
207:
191:
177:
172:
169:
166:
162:
146:
139:
125:
120:
116:
93:
88:
84:
72:
60:
57:
13:
10:
9:
6:
4:
3:
2:
367:
356:
353:
351:
348:
346:
343:
341:
338:
337:
335:
324:
319:
317:
312:
310:
305:
304:
298:
296:
292:
288:
283:
280:
276:
271:
266:
265:0-07-053522-1
262:
258:
257:0-262-68052-1
254:
251:, MIT Press.
250:
247:
244:
243:
239:
220:
215:
212:
209:
196:
192:
175:
170:
167:
164:
151:
147:
144:
140:
123:
118:
91:
86:
73:
70:
66:
65:
64:
58:
56:
54:
50:
49:Alfred Tarski
45:
43:
39:
35:
31:
27:
23:
19:
295:expanding it
284:
269:
248:
142:
62:
46:
25:
15:
34:upper bound
334:Categories
240:References
206:Π
161:Σ
115:Π
83:Σ
59:Algorithm
263:
255:
285:This
28:is a
291:stub
261:ISBN
253:ISBN
106:and
51:and
40:and
24:the
20:and
16:In
336::
259:;
55:.
44:.
322:e
315:t
308:v
297:.
235:.
221:0
216:1
213:+
210:k
195:∀
190:.
176:0
171:1
168:+
165:k
150:∃
145:.
143:k
138:.
124:0
119:0
92:0
87:0
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
