**11**

votes

**1**answer

397 views

### Is the class of additive groups of rings axiomatizable?

I know that it is impossible to axiomatize the multiplicative structures of rings, called $R$-semigroups. Is anything known about the first-order axiomatizability of the class of abelian groups which ...

**2**

votes

**1**answer

125 views

### A question on the name of a property

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

**1**

vote

**0**answers

62 views

### Oracle queries asked in parallel

Definition: Assume that $\phi(q)$ is of the form $\exists y \leq 2^{p(n)} \varphi(q,y)$, where $p$ is a polynomial and $n = |q|$ (i.e. $n$ is the length of the binary representation of $q$). Then a ...

**14**

votes

**1**answer

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

**11**

votes

**1**answer

492 views

### Does “cardinal arithmetic is well-defined” imply axiom of choice?

Let me quickly explain what I mean with my question.
Let $(\kappa_i)_{i\in I}$ be a collection of cardinal numbers, indexed by elements of some set $I$. We can try to define $\sum\limits_{i\in ...

**3**

votes

**1**answer

182 views

### History of unstable formulas [on hold]

There are many equivalent definitions for stability, one of them being that being unstable is equivalent to the existence of a formula having the order property.
While intuitively it makes sense that ...

**8**

votes

**4**answers

2k views

### intuitionistic interpretation of classical logic

Basically intuitionistic logic is classical logic minus the law of the excluded middle, i.e. $\neg A\vee A$ is not necessarily valid for all formulas. So I would take this to mean that classical logic ...

**25**

votes

**4**answers

1k views

### Does every set of reals contain a measure-zero set of the same cardinality? Does it contain a meager set of the same cardinality?

This question arises from an issue in my post on Ashutosh's excellent question on Restrictions of the null/meager ideal.
Question 1. Does every set of reals contain a measure-zero subset
of the same ...

**7**

votes

**1**answer

147 views

### Consistency strength of being strong cardinal and indestructible under collapses

What is the consistency strength of the following statement:
$\kappa$ is a strong cardinals and it is indestructible under $Col(\kappa, <\theta),$ where $\theta> \kappa$ is some fixed ...

**10**

votes

**1**answer

219 views

### Does stationary reflection imply Mahloness?

Suppose $\kappa$ is strongly inaccessible and every stationary subset of $\kappa$ reflects. Must $\kappa$ be Mahlo?
Remarks:
It is possible for every stationary subset of $\kappa$ to reflect, but ...

**4**

votes

**1**answer

135 views

### Can we always add sets without collapsing cardinals or adding [very] bounded sets?

Given a model of $\sf ZFC$, and an infinite ordinal $\alpha$. Can we prove that there is always a cardinal $\kappa$, and a forcing $\Bbb P$, such that:
$\Bbb P$ does not add sets of rank ...

**6**

votes

**2**answers

380 views

### Collapsing the cardinals between two singular cardinals

Question 1: Is it consistent that there is a forcing notion collapsing $\aleph_{\omega\cdot 2}$ to $\aleph_\omega$ without collapsing $\aleph_\omega$ or $\aleph_{\omega\cdot 2 + 1}$?
If the ...

**-1**

votes

**3**answers

225 views

### A question about sentences undecidable in Peano's Arithmetic

Many examples are now known of sentences undecidable in Peano's Arithmetic (PA) assuming that PA is consistent. Are some or all of these sentences also undecidable in Second Order Arithmetic (SOA) if ...

**6**

votes

**0**answers

160 views

### $\alpha$-minimal degrees for singular $\alpha$

An important question in $\alpha$-recursion theory is whether there is a minimal $\alpha$-degree at $\alpha=\aleph_\omega.$
Question 1. Who first introduced the above question, and where can I find ...

**13**

votes

**4**answers

1k views

### Notation in Frege's Grundgesetze der Arithmetik: The U with a flourish

In the Grundgesetze der Arithmetik, Frege used a number of strange characters for notation. I would be most interested to know anything about the typography (origin, usage and so on) of the strange U ...

**3**

votes

**1**answer

168 views

### Löwenheim-Skolem for many-sorted theories

Let $L$ be a many-sorted first order language, and let $\kappa$ be an infinite cardinal which is greater than or equal to the number of function and relation symbols in $L$. Let $T$ be a complete ...

**9**

votes

**1**answer

519 views

### Are there discontinuities in the large cardinal hierarchy?

Suppose that $\Phi(x,y)$ is a formula in the language of set theory so that for each natural number $n$, the axiom $\exists x\Phi(n,x)$ is a large cardinal axiom (for example consider $n$-huge ...

**2**

votes

**1**answer

95 views

### Classification of commutative ring ideal closure operators?

First, some setup:
So: given a commutative ring $R$, let $Ideals(R)$ be set of ideals of $R$ and let $IdealClosure(R)$ be the set of closure operations $cl: \mathcal{P}(R) \rightarrow Ideals(R)$. In ...

**0**

votes

**0**answers

111 views

### Minimum regular open set containing a given set in a T0 Alexandrov topological space

What is known about the minimum regular open set containing a given set in a T$_0$ Alexandrov topological space? I'm particularly interested in the condition for the minimum set happening to be ...

**10**

votes

**1**answer

310 views

### Constructing an $\omega_1$-sequence of functions that almost extend all previous functions

I want to construct a sequence of functions $$f_\alpha: \alpha \rightarrow \omega,\ \alpha < \omega_1$$
such that for all $\alpha < \omega_1$ the following holds:
$f_\alpha$ is injective.
...

**15**

votes

**0**answers

363 views

### What sort of cardinal number is the Löwenheim-Skolem number for second-order logic?

In their paper "On Löwenheim-Skolem-Tarski numbers for extensions of first order logic", Magidor and Väänänen make the following statement:
"For second order logic, $LS(L^{2})$ ...

**7**

votes

**1**answer

266 views

### A question related to Woodin's $HOD$ conjecture

Recall that an $\kappa$ is $\omega$-strongly measurable in $\text{HOD}$ if there exists
$\lambda < \kappa$ such that $(2^{\lambda})^{\text{HOD}} < \kappa$ and such that
there is no partition of ...

**5**

votes

**1**answer

261 views

### Diagonalizing against a non stationary set of functions

Suppose $\kappa$ is regular uncountable (assume $2^{< \kappa} = \kappa$ and $\kappa$ is weakly Mahlo if needed). Is the following true?
For every sequence $\langle f_i: i \to 2 \mid i \in A ...

**7**

votes

**2**answers

331 views

### Vopenka's Principle for non-first-order logics

(For simplicity, the background theory for this post is NBG, a set theory directly treating proper classes which is a conservative extension of ZFC.)
Vopenka's Principle ($VP$) states that, given any ...

**0**

votes

**0**answers

77 views

### A question on two modal formulas

I want to find out the correspondences for the following two formulas or whether they are already derivable in the modal logic $KD4.2$, i.e. whether the formulas are valid in serial, transitive and ...

**3**

votes

**5**answers

851 views

### Set theories that do require the existence of urelements?

I am looking for an axiomatic set theory that not only admits the existence of urelements/atoms (via two-sortedness or an additional unary predicate) but requires it, e.g. by an axiom like "for each ...

**5**

votes

**0**answers

216 views

### Proving that a subgroup is normal

This question is partly inspired by the recent question on measurability and the axiom of choice.
Suppose I come up with a way to define a subgroup of a group, in a way that involves "no arbitrary ...

**0**

votes

**2**answers

198 views

### Propositional logic without negation

As part of a bigger project I am researching a propositional logic, without a negation. And I would like to know, whether this already exists, to avoid double work and have proper references.
In this ...

**1**

vote

**0**answers

127 views

### A question regarding extendible cardinals and a result of M. Magidor

The following definitions and Theorems come from M. Magidor's paper "On the Role of Supercompact and Extendible Cardinals in Logic" (Israel J. Math., Vol. 10, 1971):
"Definition: Logic is called ...

**-1**

votes

**1**answer

93 views

### recursively enumerable sets [closed]

A set $S$ said to be recursively enumerable if There is an algorithm that enumerates the members of $S$. That means that its output is simply a list of the members of $S$: $s_1$, $s_2$, $s_3$, ... . ...

**7**

votes

**1**answer

390 views

### Why is the set-theoretic principle $\diamondsuit$ called $\diamondsuit$?

A shallow answer would just point to theorem 6.2 in Jensen's 1972 paper "The fine structure of the constructible hierarchy", where Jensen introduces this property. Or was this symbol used already ...

**23**

votes

**5**answers

3k views

### Nonstandard analysis in probability theory

I am quite new at nonstandard analysis, and recently I became aware of its use in probability theory mainly through the following two books:
Nelson (1987). Radically Elementary Probability Theory
...

**2**

votes

**1**answer

167 views

### Classification Theory

It is often said that unsuperstable theories do not admit a classification in the sense of Shelah. Why exactly is this so? And also what exactly does in the sense of Shelah mean? It is hand waved in a ...

**17**

votes

**1**answer

817 views

### the true reason of the incompleteness of formal systems

A 3/4 year ago, I read Gödel's beautiful paper "Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme 1". There is one thing, I never understood.
In a footnote, Gödel ...

**-2**

votes

**1**answer

69 views

### Reconciling undecidability of FOL with Soundness and Completeness of Hilbert Proof Systems [closed]

I am reading Logic and Declarative Languages by Michael Downward, where he describes Hilbert's Proof System for First Order Logic and states that it is both sound and complete, he then adds that:
...

**5**

votes

**1**answer

100 views

### On an automatic translation of typed lambda calculus in untyped lambda calculus

I have a question regarding the "compilation" of typed lambda calculus in untyped lambda calculus.
Take for example the inductive definition of lists, with introduction rules:
and:
We can ...

**23**

votes

**4**answers

2k views

### What axioms are used to prove Godel's Incompleteness Theorems?

I understand Godel's Incompleteness Theorems to be statements about effectively generated formal systems, which basically makes them theorems about algorithms. This is cool, because despite being ...

**2**

votes

**1**answer

209 views

### Algebras admitting quantifier elimination

I apologize if this question is meaningless or trivial:
What are examples of Algebras admitting quantifier elimination? Especially are there Groups admitting quantifier elimination?
I need to say ...

**3**

votes

**1**answer

166 views

### Number of non-isomorphic models

I had this question up on Math stackexchange: http://math.stackexchange.com/questions/1349247/number-of-non-isomorphic-models/1350763#1350763 . While it was answered partially there, I'm posting here ...

**0**

votes

**0**answers

296 views

### Set as a (strict) infinite-category?

First, let me say that I have no idea if such a post has its place here. However, I believe that the ideas I'm going to present are important. The goal of this thread is three fold:
1) trying to ...

**-1**

votes

**0**answers

21 views

### Freedom of speech in scientific discussions - An invitation to more tolerance in Scientific debates [migrated]

I hope this post enjoys some tolerance, and don't get closed or put on hold immediately.
I believe that freedom of speech in scientific discussions is one of the key values which enriches the debates ...

**8**

votes

**0**answers

254 views

### preserving saturated ideals

A reliable source made the following claim:
Suppose CH there is an $\omega_2$-saturated ideal on $\omega_1$. Then this is preserved by $\mathrm{Add}(\omega_1,\omega_2)$.
Question 1: How do you ...

**11**

votes

**1**answer

508 views

### Can there be a global linear ordering of the universe without a global well-ordering of the universe?

This question arose in the answers to Asaf Karagila's
question Does ZFC prove that the universe is linearly orderable?. The answer there was that one can have a ZFC model with no global linear ...

**29**

votes

**3**answers

2k views

### What is the reverse mathematical strength of the fundamental theorem of algebra?

Reverse mathematics (RM) is that area that tries to pin down exactly which axioms are necessary to prove theorems, given some weak base theory. Harvey Friedman has pointed out several times (on the ...

**16**

votes

**1**answer

663 views

### Goodstein's theorem without transfinite induction

Goodstein's theorem is an example of a theorem that is not provable from first order arithmetic. All proofs of the theorem seem to deploy transfinite induction and I've wondered if one could prove the ...

**1**

vote

**2**answers

159 views

### Are monoids with zero and partial homomorphisms related?

Context: Let $\Sigma=\{U,C,A,G\}$ and $L\subset\Sigma^*$, i.e. $L$ is a language over the alphabet $\Sigma$. Let $\Sigma'=\{0,1\}$ and define a homomorphism $f:\Sigma^*\to\Sigma'^*$ by extending $U ...

**1**

vote

**0**answers

68 views

### Type theory: can multiple elimination rules be defined, in principle?

I'd like to ask a question on type theory:
Consider the usual type theoretical definition of the natural numbers. We could give an elimination rule in the form:
or in the form:
I called the ...

**2**

votes

**2**answers

154 views

### Pseudo-decision procedures for first order arithmetic

I was reading this paper http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.117.2911&rep=rep1&type=pdf in which the author describes an algorithm, based on Groebner basis, ...

**5**

votes

**0**answers

84 views

### Lascar strong types in fragments of arithmetic

Are Lascar strong types (definition below) in models of fragments of arithmetic always type definable? (They trivially are, in models of full induction.)
Definition Given a saturated model ${\cal M}$ ...

**4**

votes

**2**answers

766 views

### What lets the Square of Opposition fail in Intuitionistic Logic?

See moderator's note in the comments.
I just came across the following. In intuitionistic logic
and classical logic we have the following consequences:
...