In one view, we have a formal object-language, and an informal or formal meta-language that includes the formal object-language. — TonesInDeepFreeze
Kripke's system plays with consistency, creating a formal language that contains it's own truth predicate.Consistent systems capable of first order arithmetic can't contain their own truth predicate, so we don't put the predicate in. — fdrake
I'm not so sure of this, since Kripke's theory of truth contains it's own truth predicate, and there is considerable work around its relation to arithmetic, I don't think we can yet rule out a Kripke-style first order arithmetic. I might be mistaken.Consistent systems capable of first order arithmetic can't contain their own truth predicate — fdrake
...there is life... — Janus
Leon and Hanover are more of an inspiration for Tones. They bring forth his best work.Only if you agree to write the preface. — Srap Tasmaner
Propositional logic deals in propositions. Your piece has the form of a modus ponens, but doesn't deal in propositions. That makes it interesting in several ways. But "not-a" is pretty well defined in propositional logic, in various equivalent ways. And by that I mean that the things we can do with negation in propositional logic are set. There are not different senses of "not-A" in propositional calculus.I think it shows that 'not-A' has at least two different senses. — Janus
is not an example of 'not-A', nor of propositional logic, although it is a striking example of the creativity of language.1.Life therefore death
2.Life
Therefore
3.Death. — Janus
Yep.If you look at the argument in the OP, there can never be a case where both premises are true. — frank
Any argument with inconsistent premises is valid, according to Tones — Leontiskos
If A then not-A necessarily implies A and not-A, — Benkei
It's remarkable that you can't stand to be wrong to the degree that you don't heed even your own cites! — TonesInDeepFreeze
Spelled out here:Oh. So then any argument that has no true premises is valid. That's weird. — frank
If there is no interpretation in which all the premises are true, then there is no interpretation in which the premises are all true and the conclusion is false. — TonesInDeepFreeze
Perhaps I misunderstood you. I had taken "it" and "the inference" to be the argument in the OP. Hence it appeared you were saying the argument in the OP was invalid.It violates the LNC, which is foundational and introduced by Aristotle before modus ponens so he certainly didn't intend that the inference can work. — Benkei
In this case, for instance, it is suggested that we conclude ~A by modus ponens. — Srap Tasmaner
Exactly that. If you modify the substitution rule to remove substitution of the same variable on both sides of a function, can you demonstrate that the resulting calculus will be complete? Can you prove A→A, for example?1. Meaning what exactly? — Srap Tasmaner
That's entirely up to you. But you are on this thread, so forgive my presumption. Failing to see that the argument in the OP is valid is an indication of a lack of understanding of basic logic. Refusing to give an opinion says something else.Is the answer to (1) something I should care about? — Srap Tasmaner
Some folk think that pointing out an error os abusive. Odd, sad, but trueBut what do you mean by 'abusive'? — TonesInDeepFreeze
Yep.But (A->~A) & A is a contradiction. — Srap Tasmaner
Well for a start you would no longer be dealing with a complete version of propositional calculus...Would there be any harm in requiring that the conditional in a modus ponens have fresh variables on the right hand side? — Srap Tasmaner
Too often this is an excuse for poor logic.But around here we're more interested in the practical use of logic, — Srap Tasmaner
Only line 1 is not, ~A. It's A→~A.The contradiction is 1. ~A, 2. A. — Hanover
This is false. It corresponds to line two of the truth table given above.If the OP uses propositional logic, it doesn't use propositional logic. — Hanover
Allowing substitution of any well-formed formula is not a personal foible. It is how propositional logic works. (φ, φ →ψ ⊨ ψ ) for any well-formed formula φ and ψ. Nothing says they must be different....but you may insist that it is as it is. — Hanover
As Tones explained, it's not MP you have misunderstood, but substitution. MP is a rule of inference, saying that if you have φ and φ →ψ, then you also have ψ, where φ and ψ are whatever formulae or propositions or sentences you are discussing. That includes substituting the same formula for both, and the negation of φ for ψ.It makes as much sense to define MP as excluding instances where A and not A coexist. — Hanover