Skip to main content

Questions tagged [foundations]

Mathematical logic, Set theory, Peano arithmetic, Model theory, Proof theory, Recursion theory, Computability theory, Univalent foundations, Reverse mathematics, Frege foundation of arithmetic, Goedel's incompleteness and Mathematics, Structural set theory, Category theory, Type theory.

Filter by
Sorted by
Tagged with
16 votes
1 answer
828 views

Using Grothendieck universes as the foundations of (higher) category theory is problematic: The existence of Grothendieck universes relies on the existence of inaccessible cardinals. However, one can ...
Adelhart's user avatar
  • 397
4 votes
1 answer
657 views

While constructive logic is compatible with classical logic and is sufficient to develop almost all important theorems from classical complex analysis, constructive is also compatible with axioms that ...
saolof's user avatar
  • 2,069
8 votes
1 answer
333 views

In the paper "How connected is the intuitionistic continuum", D. van Dalen proves that in intuitionistic mathematics, the set $\mathbb{R} \setminus \mathbb{Q}$ is indecomposable, which means ...
Mohammad Tahmasbizadeh's user avatar
16 votes
2 answers
1k views

Is there a formula $\phi$ in the language of set theory such that $$ \text{ZFC proves } \exists x \in \mathbb{R}:\text{ the set }A_x​:=\{y\in\mathbb{R}:\phi(x,y)\} \text{ is not Lebesgue measurable?} $...
Alexander's user avatar
  • 237
4 votes
2 answers
447 views

Can we specify custom recursively-defined functions in the language of First-order Arithmetic? I know that we can define functions in Second-order Arithmetic ($Z_2$). For example, we could define ...
sligocki's user avatar
  • 183
33 votes
1 answer
2k views

Russell and Whitehead's Principia Mathematica is of mostly historical interest (e.g., in that Gödel's incompleteness theorem was originally formulated against it), and I must admit never having read ...
Gro-Tsen's user avatar
  • 38.8k
8 votes
1 answer
595 views

Let $\kappa$ be some measurable cardinal and let $j:V \rightarrow M \cong Ult_U(V)$ be the canonical embedding with critical point $\kappa$ for some $\kappa$-complete non principal normal ultrafilter ...
Niko Gruben's user avatar
13 votes
2 answers
809 views

I am certainly not an expert in foundations, although when I see some mathematics I usually feel like I would be able to formally write it down in theory in a formal system like ZFC or Lean's ...
Kevin Buzzard's user avatar
8 votes
1 answer
684 views

In Shulman's Stack semantics and the comparison of material and structural set theories, he defines the stack semantics for a Heyting pretopos. He notes that (1) the stack semantics validate the ...
Mark Saving's user avatar
-2 votes
1 answer
539 views

Language: mono-sorted ${\sf FOL}(=,\in,S)$, where $S$ is a unary predicate standing for ".. is a stage". Axioms: Extensionality: $\forall z \, (z \in x \leftrightarrow z \in y) \to x=y$ ...
Zuhair Al-Johar's user avatar
-4 votes
2 answers
374 views

I use the concept of structure in my physics research. In particular, I would say things like "We probe structure with functors into a local structured system as a category", or "the ...
Ben Sprott's user avatar
  • 1,289
8 votes
1 answer
556 views

A type-theoretic version of replacement says that given a set $A$ in a universe $U$, and another set $B$ with no universe constraints, the image of any function $A \to B$ is essentially in $U$. (Let ...
Trebor's user avatar
  • 2,166
20 votes
3 answers
2k views

Encouraged by some users on MO, I'm going to ask this question that I have had for years. I have always felt that the iterative conception of sets makes some sense for justifying BZFC (i.e. ZFC with ...
user21820's user avatar
  • 3,174
2 votes
0 answers
155 views

The famous Hilbert's Axioms of Geometry include the Axiom I.7: If two planes have a common point, then they have another common point. Question 1. Was David Hilbert the first mathematician who ...
Taras Banakh's user avatar
  • 44.5k
2 votes
0 answers
105 views

This is an endeavor to salvage the approach presented at earlier posting. Is there a clear inconsistency with this axiom schema? Cyclic Stratified Comprehension: if $\varphi$ is a stratified formula ...
Zuhair Al-Johar's user avatar
6 votes
1 answer
616 views

Does anyone know of any texts where reverse mathematics is developed using hereditarily finite sets and subsets of $V_\omega$? Reverse mathematics is typically carried out in the framework of second-...
Henkimaailmaan Eksynyt's user avatar
1 vote
1 answer
530 views

By $\sf HT^\psi$ I mean the Hierarchy Theory of $\psi$ height. This is a set theory written in mono-sorted first order logic with equality and membership, with the following axioms: Specification: $\...
Zuhair Al-Johar's user avatar
3 votes
0 answers
255 views

What property should an extension of $\sf ZC$ have in order for it to evade having distinct yet bi-interpretable extensions. Which might be seen as a merit by some, foundationally speaking. Is ...
Zuhair Al-Johar's user avatar
12 votes
0 answers
342 views

This is my first question on MathOverflow, so it is possible it is poorly composed. My interests lie in the field of the type theory and (higher) category theory, specifically I am interested in the ...
Nicolas's user avatar
  • 121
0 votes
0 answers
179 views

I was playing with ideas around Gödel’s first incompleteness theorem which, roughly speaking, says that for every ($\omega$-)consistent, recursively axiomatizable formal system $F$ that is ...
Pooya Farshim's user avatar
0 votes
0 answers
320 views

When I attended my first Category Theory class, I asked the professor the following question. "It seems you are giving a presentation of the theory of categories IN set. Can you elaborate on ...
Ben Sprott's user avatar
  • 1,289
0 votes
0 answers
95 views

Let "$ \phi \text { is one-to-one between } \pi, \psi $", stands for meeting both of: $$ \forall x \pi(x) \exists!y \psi(y): \phi(x,y) \\ \forall y \psi(y) \exists!x \pi(x): \phi(x,y) $...
Zuhair Al-Johar's user avatar
14 votes
2 answers
2k views

Quotients in constructive type theory are a bit of a pain. My understanding is that the first type theory that supported them well was cubical type theory, and in previous type theories the ...
Christopher King's user avatar
10 votes
2 answers
773 views

The working mathematician and layperson's reasons for caring about constructive foundations are well-documented. Topos theory, in particular, gives an abundance of examples in nature of settings where ...
Garrett Figueroa's user avatar
9 votes
1 answer
415 views

Section 1.5 of [1] describes "Cantorian finitism" (CF) as the "rule of thumb" that "infinite sets are like finite ones". My questions are the following: Is it possible ...
user76284's user avatar
  • 2,440
2 votes
0 answers
127 views

Consider a theory $T$ with a binary relation $\in$ and the following axiom schemas: $\exists u \forall x (x \in u \leftrightarrow x \in a \land \phi)$ where $u$ is not free in $\phi$. This is the ...
user76284's user avatar
  • 2,440
15 votes
0 answers
470 views

This 2007 paper presents a 5-quantifier $(\in, =)$-expression that is ZF-equivalent to the axiom of choice, but leaves open the 4-quantifier case: Thus the gap is reduced to the undecided case of a 4 ...
user76284's user avatar
  • 2,440
12 votes
1 answer
321 views

This is a follow-up to this question. Let $\text{ZFC}^-$ be ZFC without powerset and with collection rather than replacement, as described here. Is there a $\Pi_2$ (or perhaps $\Sigma_2$) sentence $A$ ...
user76284's user avatar
  • 2,440
7 votes
2 answers
525 views

A modern approach to derived functors, that has been shown to be useful in a number of different circumstances, is that of a derived category (see the book by Yakutieli, for example, here). However, ...
jg1896's user avatar
  • 3,756
16 votes
2 answers
1k views

I asked this question on stack exchange and got little attention, barring a nice example I intend to look into. The original post can be found here: https://math.stackexchange.com/q/4941233/1053681 I ...
Joseph_Kopp's user avatar
14 votes
1 answer
1k views

What is the consistency strength of Homotopy type theory (HoTT) relative to various set theories (e.g., are there any known set theories that it can interpret)? Does this question even make sense?
Jesse Elliott's user avatar
9 votes
0 answers
209 views

In constructive mathematics without choice, we have three different versions of the real numbers (each embedding into the next). Regular Cauchy reals (functions $f : \mathbb N \to \mathbb Q$ such ...
Christopher King's user avatar
25 votes
2 answers
3k views

Preface: I am not an expert in the work of Scholze, or anything for that matter. Question Has Scholze stated what axioms he is using to develop his theory of motives and analytic geometry. In the ...
Rilem's user avatar
  • 485
3 votes
1 answer
325 views

A formula of the form $\forall \vec{p}\, \exists x \, \forall y\, (y \in x \leftrightarrow \phi(y,\vec{p}))$ is to be named a "set-building" formula. Now, when $\vec{p}$ includes a predicate ...
Zuhair Al-Johar's user avatar
15 votes
2 answers
2k views

In the modern mathematical arena, the two primary contenders for the ‘correct’ foundation of mathematics are set and type theory. Set theory, very roughly, captures the intuition that we frequently ...
Alec Rhea's user avatar
  • 10.4k
10 votes
2 answers
495 views

In what follows we work in the usual formulation of Martin-Löf Type Theory including Axiom K [1]. Boldface numbers $\mathbf{n}$ denote the usual finite type with $n$ elements. Motivation Postulating ...
Z. A. K.'s user avatar
  • 783
5 votes
3 answers
862 views

It is commonplace to consider standard axiomatic systems (e.g. $ZF$) with one of the 'less essential' axioms negated, like infinity, 'less essential' here having some ambiguous definition related to ...
Alec Rhea's user avatar
  • 10.4k
8 votes
2 answers
691 views

The goal of the Hilbert program was to find a complete and consistent formalization of mathematics. Gödel's first incompleteness theorem establishes that completeness is impossible with first-order ...
Christopher King's user avatar
31 votes
3 answers
3k views

In category theory, there are different ways to approach the "size issues" that crop up when we try to formalise the subject in axiomatic set theory. As far as I can tell, there are two main ...
Joe Lamond's user avatar
  • 1,538
4 votes
0 answers
237 views

On December 13--20 2009 at Bristol, there was a meeting devoted to thorough dissection of Harvey Friedman's work on the foundations of mathematics and his statements claimed to be equivalent to ...
C7X's user avatar
  • 2,884
2 votes
0 answers
254 views

This theory about structures, defined as abstractions over isomorphic graphs, can interpret Set Theory in a rather creepy manner. Though the theory is largely technical, yet it is not far from being ...
Zuhair Al-Johar's user avatar
12 votes
3 answers
3k views

Here, I want to delve into what do we exactly feel about what constitutes a platonic existence of a set? Or what makes us think or actually a kind of feel or sense the existence of a set in the ...
Zuhair Al-Johar's user avatar
5 votes
1 answer
760 views

$\newcommand\ZFC{\mathrm{ZFC}}\DeclareMathOperator\Con{Con}$It is often interesting to look at the theory of all first-order statements that are true in some second-order theory, giving us things like ...
Mike Battaglia's user avatar
4 votes
1 answer
774 views

Why not $\sf ZFC+[V=HOD]$ as the standard set theory? It implies the existence of a definable global choice and well-order, and it is compatible with all large cardinal axioms extending $\sf ZFC$, so ...
Zuhair Al-Johar's user avatar
2 votes
1 answer
253 views

In page 4 of Gödel's book The Consistency Of The Axiom Of Choice and Of The Generalized Continuum Hypothesis With The Axioms Of Set Theory, Gödel defined the $n$-tuple as $\langle x \rangle = x$; $\...
Wenchuan Zhao's user avatar
-4 votes
1 answer
251 views

Working in the first order language of set theory. Let $\varphi^{*B}$ be the formula obtained from $\varphi$ by merely bounding all open quantifiers in $\varphi$ by the symbol "$B$". Here a ...
Zuhair Al-Johar's user avatar
4 votes
1 answer
407 views

Let Anterior Reflection be the following principle: $$\forall \vec{v}~ \exists X: \operatorname {transitive} (X) \land \, (\varphi \to \varphi^{X"}) $$ where $\varphi$ is a formula in $\sf FOL(=,\in)$ ...
Zuhair Al-Johar's user avatar
-3 votes
1 answer
354 views

Is this form of reflection consistent? First I'll begin by clarifying the notation I'm using here: By a quantifier being relativized or bounded it means that the first occurrence of the quantified ...
Zuhair Al-Johar's user avatar
3 votes
1 answer
129 views

The following scheme can be understood as a form of replacement. Axiomatizing $\sf ZF$ with it instead of the usual replacement schema renders it immune to removal of extensionality; see here. In an ...
Zuhair Al-Johar's user avatar
18 votes
3 answers
3k views

Although mathematicians usually do not work in constructive mathematics per se, their results often are constructively valid (even if the original proof isn't). An obvious counter-example is the law ...
Christopher King's user avatar

1
2 3 4 5
8