Oh no! Leontiskos has "inundated" the thread! More posts and words from him than any other poster! I better scold him for that right away! No, actually, unlike his hypocritical self, I don't begrudge anyone from posting as much as they want to post.
Note so that, hopefully, Leontiskos will desist from mischaracterizing my views: In all these posts: I am not claiming that classical logic is the only correct or useful logic. I am not claiming that classical logic accords with the many notions of logic and language in everyday discourse. And I do not claim that classical logic should not be critiqued. (Indeed, such critiques as from constructivism, predicativism, finitism, relevance logic, etc. are rich sources).) But when classical logic is being critiqued, it should not be mischaracterized, misrepresented or misconstrued, so explanations of how classical logic actually operates are productive. And giving explanations of classical logic does not imply advocacy for it or a presumption that it is the only formal logic that should be consulted. I admire the thought that goes into formal logic; I enjoy studying it; I appreciate its role in formalization of mathematics; I appreciate its use in such things as computing; I appreciate that it is the subject of much of philosophy of mathematics and that it generates rich questions in mathematics and philosophy. And, in my own limited way, I have studied other formal logics and have read and appreciated critiques of classical logic. I do not claim that anyone should even care about formal logic, but when people do talk about it, they should get it right, and it is eminently proper to remark when they don't.
you do not know what you mean by 'particular.' — Leontiskos
That is false. And it is said without basis. I know what I mean by the word. I use it in its everyday sense.
No one in this thread has been able to understand what that concept means — Leontiskos
What the concept of 'a particular contradiction' means? 'particular' is used in the everyday sense such as definition 1 at Merriam online.
to talk about a particular contradiction without a sense of a non-particular contradiction does not make sense. — Leontiskos
I don't use 'non-particular'. There are particular contradictions (such as "B & ~B") and there is a definition of 'is a contradiction'.
* A formula is a contradiction if and only if it is the conjunction of a formula and its negation.
* Sometimes 'contradiction' is also used in the sense that a formula is not necessarily a conjunction of a formula and its negation but is a formula that entails a conjunction of a formula and its negation. (For that sense, I usually use 'inconsistent'.)
* With natural deduction, we sometimes refer to a pair of lines such that one is the negation of the other. But notice, that is merely commentary, as the formal deduction does not depend on the use of the term 'contradiction' but only on specifying a rule by reference to there being one line with a formula and another line with its negation.
A contradiction is an assertion of Propositional Logic that is false in all situations; that is, it is false for all possible values of its variables. — Tautologies and Contradictions
That is the semantical side of the coin. 'contradiction' is usually defined syntactically (a formula and its negation) but it does follow that a sentence is a contradiction if and only if it is logically false.
The conclusion of a reductio is like, "This is an apple." — Leontiskos
No, the conclusion of a reductio is of the form "~P" from the assumption "P", or for the non-intuitionistic version, "P" from the assumption "~P".
G be a set of premises and a sentence P is not a member of G. And we want to show that G proves ~P. Then we may use any of the members of G in our argument. But, along with members of G, we also may suppose P to derive a contradiction, thus to show that G proves ~P.
— TonesInDeepFreeze
The fiction in the reductio for the formalist is that there is some formal difference between an assumption or premise and a supposition. I say that there is not. — Leontiskos
Leontiskos can say whatever he likes, but he is terribly confused and uninformed about the subject.
I explained how reductio works in natural deduction, as just quoted by Leontiskos.
And formulation of the rules for natural deduction do not need to mention 'premise', 'assumption' or 'suppostion'. We may mention those words for convenience, but the specification of a natural deduction system does not require such words. Leontiskos would learn what a natural deduction system actually is - not his nutty imagination of what he thinks it is - by just reading a reliable text or article that covers the subject.
There is a difference between P being a member of G and P not being a member of G. That is not a "formalist" fiction.
I'll take time and effort to give even greater detail, though Leontiskos will likely ignore it or mangle it in the dysfunctional, electrically shorting food processor that is his brain when it spews garbage about logic.
One elegant way to formulate sentential natural deduction is with these rules that permit:
Enter P on a line and charge that line to itself.
If P, along with possibly other lines, shows Q, then infer P -> Q and charge it with all lines charged to Q except the line for P.
From P and P -> Q, infer Q and charge it with all lines charged to P and to P -> Q.
If P, along with possibly other lines, shows a formula Q and a formula ~Q, then infer ~P and charge it with all the lines used to show Q and to show ~Q except the line for P.
If ~P, along with possibly other lines, shows a formula Q and a formula ~Q, then infer P and charge it with all lines used to show Q and used to show ~Q, except the line for ~P. [not intuitionistic]
From P and Q, infer P & Q and charge it with all lines charged to P and to Q.
From P & Q, infer P or infer Q and charge it with all lines charged to P & Q.
From P or from Q, infer P v Q and charge it with all lines charged to P.
From P v Q, P -> R and Q -> R, infer R and charge it with all lines charged to P v Q and to P -> R and to Q -> R.
There is no mention of 'premise', 'assumption' or 'supposition'.
Those rules are equivalent with:
{P} |- P
If Gu{P} |- Q, then G |- P -> Q
If G |- P and H |- P -> Q, then GuH |- Q
If Gu{P} |- Q and Gu{P} |- ~Q, then G |- ~P
If Gu{~P} |- Q and Gu{~P} |- ~Q, then G |- P [not intuitionistic]
If G |- P and H |- Q, then GuH |- P & Q
If G |- P & Q, then G |- P and G |- Q
If G |- P or H |- Q, then GuH |- P v Q
If G |- P v Q, and H |- P -> R and J |- Q -> R, then GuHuJ |- R
There is no mention of 'premise', 'assumption' or 'supposition' nor, for that matter, 'contradiction'.