**6**

votes

**1**answer

52 views

### Boolean-Valued Models: Why is $\| x=y \| \cdot \| \phi(x) \| \leq \| \phi(y) \|$?

Let $B$ be a complete Boolean algebra. Jech defines a Boolean-valued model $\mathfrak{A}$ of the language of set theory to consist of a Boolean universe $A$ and functions of two variables with values ...

**3**

votes

**0**answers

210 views

### How close to being well-orderable does this make my powerset?

Let's work in a set theory without assuming AC (for instance, but not necessarily, ZF). Fix a set $k$ satisfying $k\times k \simeq k$, and consider its powerset $X = 2^k$. I have a technical condition ...

**4**

votes

**0**answers

118 views

### Is this theory decidable?

It is well-known that both Presburger arithmetic (by contrast with Peano arithmetic) and Tarski geometry are decidable. I was in the shower this morning and wondered whether there exists an elegant ...

**3**

votes

**1**answer

144 views

### When can you canonically extend an ultrafilter after forcing?

Suppose that $V$ is a model of $\sf ZFC$, and fix some regular $\kappa$, say $\omega_1$ for practical purposes.
Let $\cal U$ be an ultrafilter on $\omega_1$ in $V$ which is non-principal and even ...

**2**

votes

**0**answers

131 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 ...

**0**

votes

**0**answers

106 views

### Is the positive existential theory undecidable?

Could you tell if the positive existential theory of $\mathbb{C}[e^{\mu x} \mid \mu \in \mathbb{C}]$ is undecidable in the language $\{+, \cdot , \frac{d}{dx} , 0, 1, e^x\}$ ?
How can we prove the ...

**6**

votes

**1**answer

134 views

### Minimal degrees of structures

For this question, a structure means a first-order structure in a computable language with domain $\omega$; a copy of a structure $\mathcal{A}$ is a structure $\mathcal{B}\cong\mathcal{A}$.
Given a ...

**19**

votes

**3**answers

558 views

### Is being rational decidable?

Given a real number uniquely defined by a finite system of equations and inequalities with rational coefficients involving the standard elementary functions only. Is it decidable whether this number ...

**4**

votes

**1**answer

50 views

### Proving moduli of uniform continuity in RCA_0

Simpson's Subsystems of Second Order Arithmetic (pp. 134ff.) uses RCA$_0$ to prove various theorems of analysis for all continuous functions with a suitable modulus of uniform continuity. And he ...

**10**

votes

**1**answer

182 views

### Joyal's construction of the spectrum of a commutative ring

I am trying to understand bits and pieces of Lawvere's article Continuously Variable Sets; Algebraic Geometry = Geometric Logic. I'm not doing very well.
I know this is a lot to ask, but basically, I ...

**8**

votes

**2**answers

504 views

### Did Bishop, Heyting or Brouwer take partial functions seriously?

The partial μ-recursive functions which may or may not be provably total seem to have some direct relation to the initial motivations for intuitionistic mathematics. (Following Kronecker, one ...

**1**

vote

**0**answers

34 views

### Fully residually free groups and completion

Let $G$ be a fully residually free group with a finitely generated profinite completion. Is $G$ necessarily finitely generated?

**3**

votes

**1**answer

188 views

### Is there an easy decision algorithm for the inhabitation problem for simple types?

Consider the basic system of simple types usually known as $TA_\lambda$. One can prove that (as a consequence of the Subject Reduction Property and the fact that any typable term is strongly ...

**4**

votes

**2**answers

262 views

### A property of uncountable almost disjoint families

Let $\mathcal{A}$ be an uncountable almost disjoint family (not necessarily maximal) of infinite subsets of $\mathbb{N}$. Denote by $\mathcal{A}_{\subseteq}=\{ B\subseteq\mathbb{N}:|B|=\omega \wedge ...

**35**

votes

**5**answers

3k views

### Has decidability got something to do with primes?

Note: I have modified the question to make it clearer and more relevant. That makes some of references to the old version no longer hold. I hope the victims won't be furious over this.
Motivation:
...

**5**

votes

**0**answers

157 views

### Theories introduced by a class of forcing notions

The following notion is introduced by Mohammad Golshani. Let $V$ be a model of set theory and let $\mathcal{P}$ be a class consisting of non-trivial forcing notions in $V$. Let
$$Th(V, ...

**-4**

votes

**1**answer

113 views

### New hilbert system and theorem [closed]

Let we have following axioms and modus ponens :
$$(A1):(B ⇒ (C ⇒B ))$$
$$(A2):((B ⇒ (C ⇒D )) ⇒ ((B ⇒C ) ⇒ (B ⇒D )))$$
$$(A3):( ( B ⇒C) ⇒(¬C ) ⇒ (¬B ))$$
now can we prove following theorem ?
$\vdash ...

**4**

votes

**1**answer

273 views

### Show that the positive existential theory is undecidable

To show that the positive existential theory of $\mathbb{C}[t, e^{\lambda t} \mid \lambda \in \mathbb{C}]$ in the language $\{+, \cdot , ' , 0 , 1, t\}$ is undecidable we have to prove the following: ...

**17**

votes

**21**answers

11k views

### Textbook recommendations for undergraduate proof-writing class

I am teaching the proof-writing class (for the 3rd time) in the Fall and plan to buck the party line and use a different text than the default Bond and Keane. My parameters are as follows:
Logic, ...

**11**

votes

**4**answers

3k views

### Bourbaki's epsilon-calculus notation

Bourbaki used a very very strange notation for the epsilon-calculus consisting of $\tau$s and $\blacksquare$. In fact, that box should not be filled in, but for some reason, I can't produce a \Box.
...

**15**

votes

**36**answers

3k views

### Basic results with three or more hypotheses

Consider the following statement of the Arzela-Ascoli theorem.
Theorem. Let K be a compact topological space and let S be a subset of C(K). Then S is relatively compact if and only if S is uniformly ...

**13**

votes

**7**answers

1k views

### Can we disallow finite choice?

When people work with infinite sets, there are some who (with good reason) don't like to use the Axiom of Choice. This is defensible, since the axiom is independent of the other axioms of ZF set ...

**6**

votes

**0**answers

83 views

### Finitely presented algebras with isomorphic semilattices of congruences

Let $\mathbb{T}$ be a finitary algebraic theory. For each $\mathbb{T}$-algebra $A$, let $Q (A)$ be the join semilattice of finitely generated congruences on $A$. There is an evident pushforward ...

**3**

votes

**1**answer

207 views

### How can the critical point of an elementary embedding be omega_1?

I've seen an example of an elementary embedding such that $\omega_1$ is the critical point.
I was wondering what's wrong with the following proof that this cannot be:
Let $\phi(x_1,x_2)$ be the ...

**2**

votes

**2**answers

154 views

### On the Combinatorial Classification of Modal Kripke Frames

We have that S5 modal logic is characterized by the modal axioms $K$, $M$ (reflexive), $4$ (transitive), and $B$ (symmetric). That is, an equivalence relation on a set of possible world (which can be ...

**2**

votes

**0**answers

100 views

### Is a finitely generated residually free group “almost LERF”?

Let $G$ be a finitely generated residually free group.
(i.e. for each $1 \neq g \in G$ there exists a homomorphism $\tau \colon G \to F$ such that $F$ is a free group, and $\tau(g) \neq 1$.)
...

**15**

votes

**1**answer

307 views

### Removing large cardinals from an uncountable transitive model

The usual way of removing large cardinals from a given model of set theory is to cut off the model below the least large cardinal of interest. But this method may have dramatic effects on the external ...

**3**

votes

**3**answers

210 views

### Semantic reflection

Let $\ulcorner \cdot \urcorner$ be a fixed encoding of formulas by numbers, e.g.
let $\ulcorner \varphi \urcorner$ denote the Godel number of $\varphi$.
Let $T$ be a first-order arithmetic theory, ...

**15**

votes

**1**answer

737 views

### Does every Aronszajn tree has a Suslin or a Special subtree?

Question: Does every $\omega_1$-Aronszajn tree contains a Suslin sub-tree or a special Aronszajn sub-tree?
Recall that Suslin trees are $\omega_1$-trees (trees of height $\omega_1$, and countable ...

**2**

votes

**0**answers

60 views

### A Question on Provability Logic and Co-Necessitation

The provability logic $GL$ has the characteristic axioms:
$K\hspace{15pt}\Box(\alpha\rightarrow \beta)\rightarrow(\Box\alpha\rightarrow\Box\beta)$
$L\hspace{15pt}\Box(\Box \alpha\rightarrow ...

**2**

votes

**1**answer

195 views

### A question on the name of a property

What is the name of the following property of a system $T$?
If $\vdash_{T}\exists x F(x)$ then
there is a term $a$ such that $\vdash_{T} F(a)$
If I recall correctly Heyting Arithmetics has ...

**4**

votes

**0**answers

122 views

### Proving Richardson's theorem for constants

(I asked this a little over 3 months ago on math.SE, and when I initially re-asked here, no one had responded there. $\:$ After I re-asked here, Eric Towers responded there, since I had forgotten to ...

**6**

votes

**2**answers

233 views

### The role of the index set in the product of uncountably many topological spaces

Let $\langle X_i,\mathcal{T}_i \rangle_{i\in I}$ be a family of topological spaces. Consider $X=\prod_{i\in I} X_i$ with product topology.
Question. Is there a topological property that holds in ...

**4**

votes

**1**answer

159 views

### What is the right notion of generalized element of a category?

I've been working out how the internal language of a category C extends to taking the category itself as a type.
The most obvious way to interpret $X : \mathbf{C}$ is, of course, that $X$ is an ...

**5**

votes

**1**answer

109 views

### Proof-theoretic ordinals after liberalizing induction to $RCA_0$

This is kind of a follow-up to this question.
For a class $\Gamma$ of second-order formulas (here either $\Sigma_n^0$ or $\Sigma_n^1$), let $X\Gamma$ be a formal theory consisting of $RCA_0$ together ...

**3**

votes

**2**answers

218 views

### Do limit groups satisfy Howson's theorem?

Let $G$ be a limit group, and let $A,B \leq G$ be finitely generated
subgroups generating $G$ (i.e. $\langle A \cup B \rangle = G$). Must
$A \cap B$ be finitely generated?
Recall that a limit ...

**2**

votes

**1**answer

182 views

### Effectively non-recursiveness of some sets

A set $A$ is completely productive if there exists a computable function $f$ such that for every $e$, $f(e)\in (A-W_e)\cup (W_e-A)$. A set is effectively non-recursive if it is r.e. and its ...

**10**

votes

**1**answer

178 views

### Is there a (first-order) sentence which admits $(\aleph_2,\aleph_0)$ iff a Kurepa tree exists?

In Chang and Keisler's Model Theory I came across the following theorem (Theorem 7.2.13):
Theorem There exists a (first-order) sentence $\sigma$ such that for all infinite cardinals $\alpha$, ...

**4**

votes

**1**answer

134 views

### How to extend Morley's omitting type theorem to uncountable languages?

In his 1965 paper Omitting Classes of Elements (found in The Theory of Models: Proceedings of the 1963 International Symposium at Berkeley, published by North-Holland Publ. Co., Amsterdam (1965)), ...

**8**

votes

**2**answers

1k views

### How quickly did Gödel's Incompleteness Theorem become known and heeded throughout mathematics

Does anyone know how news of Gödel's incompleteness theorem spread? Did it do so little by little, or was it shouted in dramatic headlines throughout mathematical literature? If anyone can point me to ...

**7**

votes

**1**answer

125 views

### Consistency Strength of “HC is elementary in V[G]”

Let $P$ be the Levy-collapse of the ordinals, so $P$ is a class forcing notion that makes every ordinal countable.
Note that since $P$ is weakly homogeneous, for any formula $\phi(\overline{a})$ ...

**4**

votes

**0**answers

120 views

### Sacks minimality without choice

The usual argument for the minimality result for Sacks forcing uses choice.
Theorem (Sacks): Let $s \subseteq \mathbb S_\kappa$ be generic for the forcing to add a Sacks subset to $\kappa$, where ...

**10**

votes

**0**answers

274 views

### Is it consistent with ZFC that no nontrivial forcing notion has automatic mutual genericity?

A nontrivial forcing notion $\newcommand\Q{\mathbb{Q}}\Q$ exhibits
automatic mutual genericity, if whenever $G,H\subseteq\Q$ are
distinct $V$-generic filters (existing, say, in some forcing
extension ...

**7**

votes

**0**answers

135 views

### $V$ as a $HOD$ of its class generic extension

By an old result of Roguski, The theory of the class $HOD$, any model $V$ of $ZFC$ has a class generic extension $V[G]$ such that $HOD$ of $V[G]$ equals $V$.
This result is also stated and generalized ...

**16**

votes

**1**answer

908 views

### Analogues of Primitive Recursive Functions

Let $\mathbf{A}$ be an admissible set (possibly with urelements). I am wondering if there is some good notion of "primitive recursive arithmetic" relative to $\mathbf{A}$. More precisely, I would like ...

**7**

votes

**0**answers

183 views

### (A little bit) Beyond the E-recursive

The E-recursive functions are a particular generalization of classical recursion theory to the entire set-theoretic universe, $V$. They are defined via a schemes: see ...

**10**

votes

**1**answer

337 views

### Extending an infinite simple group

Maybe the question does not fit here.
Yesterday in my logic course, I presented a nice example about an application of model theory to group theory. The example is due to Hodges and as following: For ...

**7**

votes

**0**answers

187 views

### A strengthening of Chang's conjectures

In the Handbook of Set Theory, Foreman has (essentially) the following proposition (3.9):
Suppose $\kappa_n>...>\kappa_0$ and $\lambda_n>...>\lambda_0$ are regular cardinals and ...

**2**

votes

**1**answer

136 views

### Is Extensionality needed for the incompleteness of very weak set theories?

$ST$ is the weak set theory built upon identity theory and containing
the axiom for empty set,
the axiom for adjunction and
the axiom for extensionality.
It is known that $ST$ interprets ...

**81**

votes

**11**answers

8k views

### Checkmate in $\omega$ moves?

Is there a chess position with a finite number of pieces on the infinite chess board $\mathbb{Z}^2$ such that White to move has a forced win, but Black can stave off mate for at least $n$ moves for ...