equal
deleted
inserted
replaced
1 (* Title: FOL/ex/int |
1 (* Title: FOL/ex/int |
2 ID: $Id$ |
2 ID: $Id$ |
3 Author: Lawrence C Paulson, Cambridge University Computer Laboratory |
3 Author: Lawrence C Paulson, Cambridge University Computer Laboratory |
4 Copyright 1991 University of Cambridge |
4 Copyright 1991 University of Cambridge |
5 |
5 |
6 Intuitionistic First-Order Logic |
6 Intuitionistic First-Order Logic |
7 |
7 |
8 Single-step commands: |
8 Single-step commands: |
287 \ --> (EX x. Q(x)&P(x))"; |
287 \ --> (EX x. Q(x)&P(x))"; |
288 by (Int.best_tac 1); |
288 by (Int.best_tac 1); |
289 result(); |
289 result(); |
290 |
290 |
291 writeln"Problem ~~26"; |
291 writeln"Problem ~~26"; |
292 goal IFOL.thy "(~~(EX x. p(x)) <-> ~~(EX x. q(x))) & \ |
292 goal IFOL.thy "(~~(EX x. p(x)) <-> ~~(EX x. q(x))) & \ |
293 \ (ALL x. ALL y. p(x) & q(y) --> (r(x) <-> s(y))) \ |
293 \ (ALL x. ALL y. p(x) & q(y) --> (r(x) <-> s(y))) \ |
294 \ --> ((ALL x. p(x)-->r(x)) <-> (ALL x. q(x)-->s(x)))"; |
294 \ --> ((ALL x. p(x)-->r(x)) <-> (ALL x. q(x)-->s(x)))"; |
295 (*NOT PROVED*) |
295 (*NOT PROVED*) |
296 |
296 |
297 writeln"Problem 27"; |
297 writeln"Problem 27"; |
298 goal IFOL.thy "(EX x. P(x) & ~Q(x)) & \ |
298 goal IFOL.thy "(EX x. P(x) & ~Q(x)) & \ |
376 \ ~(ALL x. EX y. ALL z. F(z,y) <-> ~ F(z,x))"; |
376 \ ~(ALL x. EX y. ALL z. F(z,y) <-> ~ F(z,x))"; |
377 by (Int.fast_tac 1); |
377 by (Int.fast_tac 1); |
378 result(); |
378 result(); |
379 |
379 |
380 writeln"Problem 44"; |
380 writeln"Problem 44"; |
381 goal IFOL.thy "(ALL x. f(x) --> \ |
381 goal IFOL.thy "(ALL x. f(x) --> \ |
382 \ (EX y. g(y) & h(x,y) & (EX y. g(y) & ~ h(x,y)))) & \ |
382 \ (EX y. g(y) & h(x,y) & (EX y. g(y) & ~ h(x,y)))) & \ |
383 \ (EX x. j(x) & (ALL y. g(y) --> h(x,y))) \ |
383 \ (EX x. j(x) & (ALL y. g(y) --> h(x,y))) \ |
384 \ --> (EX x. j(x) & ~f(x))"; |
384 \ --> (EX x. j(x) & ~f(x))"; |
385 by (Int.fast_tac 1); |
385 by (Int.fast_tac 1); |
386 result(); |
386 result(); |
387 |
387 |
388 writeln"Problem 48"; |
388 writeln"Problem 48"; |