Recent content by SSequence

  1. S

    High School Finite number divided by infinity

    I have nothing to add to specific discussion, but I would briefly mention a further comment on what you just mentioned. To what extent what can or can't do mathematics [for example, to what extent some of the well-known/standard theorems have to be changed or even abandoned] in weaker axiomatic...
  2. S

    Graduate Skolem's Paradox (First Order Logic)

    What I was trying to describe in post#25 seems to be described better in this image. Also if you just read the paragraph just below the image (in previous sentence) in the link it seems to be fairly instructive (and readable) ..... the other stuff though is a bit advanced for me.
  3. S

    Graduate Skolem's Paradox (First Order Logic)

    Are you sure about incompleteness theorems also applying to SoL in all/most cases? The reason I am asking is that, as far as I know, the incompleteness theorems apply to first-order-theories of certain kind [that are "expressive" enough and whose axioms are r.e. ..... but I don't know whether...
  4. S

    Graduate Skolem's Paradox (First Order Logic)

    Here is how I look at it (in a very simplified way). This is not exactly LS I think but it is somewhat related to it. First I would add that there are quite a few elements that make things difficult. I would like to mention a few things that I am aware of (in an informal sense): (a) The first...
  5. S

    Undergrad The countability paradox of computable numbers

    Here is the answer to your specific question. With each partial computable function ##f:\mathbb{N} \rightarrow \{0,1\}## we first need a way to associate with it a real number (in decimal form) in the interval [0,1]. Suppose we denote the set ##A## as the set of all partial computable functions...
  6. S

    Undergrad The countability paradox of computable numbers

    Let me specifically focus on functions from ##\mathbb{N}## to ##\{0,1\}## [instead of computable number] and different reditions of a method similar to what you described in the OP. I will describe the various conclusions we can draw from them. (1) Firstly, we have an (easily understandable)...
  7. S

    How to show R*S(U+TR*S)* is equivalent to (R+SU*T)SU*?

    I think this multiple use of ##+## is very common. Now I don't know whether the newer texts use this or not, but at least in the older texts that was the case. For example, if the alphabet is ##\Sigma=\{a,b\}##, an expression like ##(a+b).a^{+}## would mean the following language...
  8. S

    How to show R*S(U+TR*S)* is equivalent to (R+SU*T)SU*?

    I don't know, but I am having difficulty seeing how ##(R+SU^*T)SU^*## can really be a correct expression? I mean consider any string accepted by the automaton you posted such that it contains at least 2 or more ##R##'s. For example, consider the string ##RRS##. It is accepted by the automaton...
  9. S

    Undergrad Does Artemov's "S-consistency" really revive the Hilbert Program?

    Yeah well if we just want to look at it in a very high level way, it seems that "perhaps" it can be summarized into what we can call "part vs. whole" or "internal vs. external" issue. What we have is a predicate ##F(i)## which can be expressed as a ##PA## formula. So, we will have ##F(0)##...
  10. S

    Undergrad Does Artemov's "S-consistency" really revive the Hilbert Program?

    So having spent some time (looking at various resources too), this is that partial understanding of it that I can manage. Note that this is just my (incomplete) understanding/interpretation of it (as it currently stands) and I don't know to what extent it does or doesn't represent the actual...
  11. S

    Undergrad The reason for lambda calculus being universal

    I was looking at stevendaryl's informative posts related to this from few years back. It occurs to me that there is at least one way to think of associating a collections of sets [each set being subset of ##\mathbb{N}##] with ##PA##. One way is to look at all predicates of form ##P(x)## where...
  12. S

    Graduate Second-order arithmetic

    I don't know anything about second-order, so I can't comment much on points related to that. However, it is worth mentioning that "second-order-arithmetic" can also often refer to a first order theory (often written as ##\mathrm{Z}_2##).
  13. S

    Undergrad The reason for lambda calculus being universal

    I don't know, for example, how closely the version of "untyped" lambda calculus [as, for example, described in notes linked in post#8] corresponds to the original one. Nevertheless, years ago I remember reading an interview. I don't remember it exactly, but this is what I re-call. Kleene...
  14. S

    High School Ratio of radii for 8 coins around a central coin

    I think I would add one point here. It seems useful to describe it since it has not been mentioned directly in the thread yet. Consider two circles ##C_1## and ##C_2## of radii ##r_1## and ##r_2## with their centers at points ##(x_1,y_1)## and ##(x_2,y_2)## respectively. Then the following...
  15. S

    Is the sequence (0,0,1,0,0,0,0,1,1,1,..) a valid subsequence?

    Yeah you are right about that. This is the natural precise definition when one is using semi-formal prose as commonly used in math texts. Post#10 also mentioned this definition. I was just thinking about extra restriction of not using a sequence such as ##\{n_k\}## directly and then only relying...