= 27d567bc2d48d9f40e9ccc20ea370b15)
StevenLandsburg comments on [LINK] Steven Landsburg "Accounting for Numbers" - response to EY's "Logical Pinpointing" - Less Wrong
You are viewing a comment permalink. View the original post to see all comments and the full post content.
= 783df68a0f980790206b9ea87794c5b6)
Loading…= b715d02e85f7b3b4ae65ca3d3e450868)
Subscribe to RSS Feed
Powered by Reddit
= f037147d6e6c911a85753b9abdedda8d)
Comments (46)
So, they were lucky. It could have been that that-which-Pythagoras-calls-number was not that-which-Fibonacci-calls-numbers.
Are there absolutely no examples of cases where mathematicians disagreed about some theorem about some not-yet-axiomatized subject, and then it turns out the disagreement was because they were actually talking about different things?
(I know of no such examples, but I would be surprised it none exist)
Plasmon:
<i>So, they were lucky. It could have been that that-which-Pythagoras-calls-number was not that-which-Fibonacci-calls-numbers.</i>
Why do you imagine that the introduction of an axiomatic system would address this problem?
To quote, just put a greater-than sign
>at the beginning of the first line.LessWrong uses Markdown for comment formatting. Click the button labelled "Show help" under the right-hand side of the comment box.
Well, that would've worked fine in standard Markdown.
What is "standard Markdown"?
Specified here - I think it is canonically produced by
Markdown.pl, downloadable there.Notably, Markdown allows inline html. Most implementations that work with client data, like that of Reddit/Lw, only allow a limited subset of Markdown functionality. (Most also add functionality).
Oh, I see -- a specification in the style of "only perl can parse perl."
But then these "most implementations" are not implementations of "standard Markdown," hence my confusion.
Note the qualifier - "most implementations that work with client data". Markdown is also used extensively to generate static content that is not user-generated.
There are still multiple implementations used in generating static content, no two of which really do the same thing, e.g., pandoc, multimarkdown, and etc. These are all still arguably "markdown" (at least, they call themselves that) but don't conform to standard markdown as you understand it.
All universal programming languages (assembler, C, CLIP, Lisp, Cobol, Python, Java) can parse perl as well.
Only if they implement Perl, perfectly mimicking the functionality of
perl(the only spec for Perl). Amongst other difficulties, Perl has available the full power of Perl at the preprocessing stage.That doesn't matter, kind of like non-paperclips.
Because then the problem is not "Does this non-axiomatized stuff obey that theorem ?" but "Does that theorem follow from these axioms ?". One is a pure logic problem, and proofs may be checked by automated proof-checkers. The other directly or indirectly relies on the mathematician's intuition of the non-axiomatized subject in question, and can't be checked by automated proof-checkers.
Except insofar as the mathematicians, unknown to each other, have different ideas of what constitutes a valid rule of inference.
A logical system is a mathematical obect. If the problem is that different mathematicians might think they're talking about the same object when they're really talking about different ones, then I don't see why logical systems, out of all mathematical objects, should be particularly exempt from this problem.
Also, of course, to put this in the context of the original post, if we're talking about second order logic, then of course there can be no automated proof-checkers.
You appear to be confused here. The rest of your post is good.
I should have said this more carefully. If one allows enough rules of inference so that all the logical consequences of the axioms can be proved, then there are no automated proof checkers. So you can have proof checkers, but only at the cost of restricting the system so that not all logical consequences (i.e. implications that are true in every model) can be proved.
I think there's a definitional issue here. Eugine is using "proof checker" to mean an algorithm that given a sequence of statements in an axiomatic system verifies that the proof is formally valid. You seem to mean by proof checker something like a process that goes through listing all valid statements in the system along with a proof of the statement.
JoshuaZ: No, I mean the former. The problem is that you have enough rules of inference to allow you to extract all logical consequences of your axioms, then that set of rules of inference is going to be too complicated to explain to any computer. (i.e. the rules of inference are non-recursive.)
Isn't that more a consequence of the stronger statement that you just can't write down all valid inferences in the second-order system?
Do you mean that there can be no automated proof-checkers which are sound and complete (and terminating)? Surely there can be useful sound checkers (which terminate)? The existence of Coq and other Dependently typed languages suggests that's true.