**8**

votes

**0**answers

550 views

### Has anyone pursued Frege's idea of numbers as second-order concepts?

Gottlob Frege was a pivotal figure in the history of mathematical logic. He gave an analysis of numbers that proceeded along roughly the following lines, in his books "The Foundations of Arithmetic" ...

**8**

votes

**0**answers

2k views

### Group Theory, Game Theory, a bit of Philosophy and a post in Tao's blog

I've decided to write this post after reading the incredibly beautiful and highly recomended post by Terence Tao ...

**4**

votes

**0**answers

445 views

### sine and Archimedes' derivation of the area of the circle

The elementary "opposite over hypotenuse" definition of the sine function defines the sine of an angle, not a real number. As discussed in the article "A Circular Argument" [Fred Richman, The College ...

**4**

votes

**0**answers

634 views

### BGG category everywhere implies generalized Kazhdan-Lusztig formula?

Maybe this question is vague. I am not an expert on what I asked, if I made mistake, please point out.
BGG category was discoverd in Lie algebra setting. One has Verma module $M(\lambda)$, ...

**3**

votes

**0**answers

295 views

### A Question Regarding Boolean-valued Models

What were the intuitions motivating the creation (or discovery, if you will) of Boolean-valued models? I have searched for the Scott-Solovay paper on the subject, but to no avail. There also seems to ...

**2**

votes

**0**answers

137 views

### Was “arithmetical translation” (coding in the Goedel sense) ever a part of Hilbert's Program?

Was "arithmetical translation" (that is, coding in the Goedel sense) ever a part of Hilbert's Program? I ask this question for several reasons:
i) it gives the numerals |, ||, |||,.... an ersatz ...

**2**

votes

**0**answers

100 views

### A question regarding an analogue of the Kleene $T$-predicate for Koepke's ordinal computability

Does Koepke's notion of ordinal computability admit an analogue of the Kleene $T$-predicate? If so, is the existence of such a $T$-predicate independent of $ZFC$? Also, if one assumes the existence ...

**2**

votes

**0**answers

72 views

### Which self-reference restrictions can be weakened in probabilstic logic?

This work suggests that there is some generalization of Truth in terms of probability, which can be definable within the logic itself.
Is where any other thorems on self-reference restrictions, which ...

**2**

votes

**0**answers

200 views

### Interpretation of Shannon Entropy Application

Consider a collection of increasing positive integers $\{a_i\}_{i=1}^m$ and the distribution $p_i=\frac{a_i}{\sum_{i=1}^ma_i}$. Let entropy of $\mathcal{A}=\{a_i\}_{i=1}^m$ be given
by ...

**2**

votes

**0**answers

126 views

### Is there an universal (dis)similarity measure between two structures?

I'm always wondering is there an universal (dis)similarity measure
between two structures (let's say between two undirected simple
graphs)? I mean, not "the measure with universal parameter that we
...

**2**

votes

**0**answers

446 views

### Single logic foundation vs. multi-logic foundation

Dear all,
I have always wondered why I have never read anything about this topic. My question is, are there are any books or articles covering this subject?
With this topic I mean the philosophical ...

**1**

vote

**0**answers

108 views

### A Question Regarding Productive Sets in the Koepke-Koerwien System SO (Sets of Ordinals)

In their paper "The Theory of Sets of Ordinals" (arXiv), Koepke and Koerwien propose a theory SO axiomatizing the class of sets of ordinals in a model of ZFC and show that SO and ZFC are ...

**1**

vote

**0**answers

181 views

### A question regarding Koepke' s Ordinal Computability in HOD

Consider the following theorem of Koepke-Koerwien-Siders:
"A set x of ordinals is ordinal computable [either by ordinal Turing machines or ordinal register machines--my comment] if and only if it is ...

**0**

votes

**0**answers

104 views

### Geometric interpretation of table with permutations and inversions

Let $T(n,k)$ is the number of permutations of numbers $1, ..., n$ and each of the permutations has $k$ inversions. We can consider a table for $T(n,k)$ for some $n$ and $k$. For eg.
$n=1,...,6$, ...