Recent content by PhiloLearner
-
P
Graduate The hardest logical puzzle according to George Boolos
The answer is ... :smile: http://hcs.harvard.edu/~hrp/issues/1996/Boolos.pdf- PhiloLearner
- Post #10
- Forum: General Math
-
P
Graduate The hardest logical puzzle according to George Boolos
Similar subject titles but different contents :smile:- PhiloLearner
- Post #5
- Forum: General Math
-
P
Graduate The hardest logical puzzle according to George Boolos
According to the late philosopher and logician George Boolos, who was a professor at MIT, the hardest logical puzzle is one that was invented by the logician and puzzle-master Raymond Smullyan, and modified slightly by the computer scientist John McCarthy. Here is the puzzle : :cool:- PhiloLearner
- Thread
- Puzzle
- Replies: 26
- Forum: General Math
-
P
Falsifiability - has it been fully discredited?
Nope. He only got a PH.D in history of science.- PhiloLearner
- Post #19
- Forum: General Discussion
-
P
Graduate Seeks Guidance on Proving Peirce's Law
A more elegant way to use SD Derivation system SD is more elegant than other systems of natural deduction such as that of Copi's, thanks to F.B.Fitch. :smile: Now there is a trend of using SD system in logic books as the only system of natural deduction. To make the system more elegant...- PhiloLearner
- Post #18
- Forum: General Math
-
P
Graduate Seeks Guidance on Proving Peirce's Law
The fastest proof of Peirce's Law is to prove the contrapositive ¬P→¬((P→Q)→P) :smile:- PhiloLearner
- Post #12
- Forum: General Math
-
P
Graduate Seeks Guidance on Proving Peirce's Law
Truth-table method is a decision procedure, not a method of proof.- PhiloLearner
- Post #11
- Forum: General Math