Thread / opened 2 February 2018
A description of the refutation procedure for a finite set of formulas
Opened on 2 February 2018 by mauxdivers, this thread drew no replies.
It is one of 607 threads in the archive that received no comment.
Opened in February 2018, when 129 threads were started on the forum.
0
Comments
no replies
0
Members commenting
221
Words written
221 in the opening post
See also
Threads on similar ground
Threads that share the most distinctive vocabulary with this one.
- Can a tautology break the law of non-contradiction?9 comments, 2019
- Do you think you can prove that 1+1=2?65 comments, 2019
- Godels Incompleteness therom and Q11 comments, 2020
See also
More threads opened by mauxdivers
mauxdivers opened 2 threads in all; these drew the most comments.
- Abbreviated linear form (Beginner's Modal Logic)3 comments, 2018
Record
At a glance
- Opened
- 2 February 2018 (February 2018)
- Opened by
- mauxdivers
- Comments
- 0
- Words written
- 221 (221 in the opening post)
- Original thread
- Read it in the forum archive
About these figures. Thread titles are quoted from the archive. Everything on this page is computed from the public archive of The Philosophy Forum; quoted passages are removed before anyone's words are counted, and no post text is reproduced. See the methodology for definitions and caveats.