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.
330 questions
0
votes
1
answer
308
views
Good set theory in which to study ordinal-indexed sequences?
I'd like to "model" the absolute complement of a set $X$ as the ordinal-indexed sequence $\alpha \mapsto V_\alpha \setminus X$ where $V_\alpha$ is the $\alpha$ stage of the cumulative hierarchy. My ...
3
votes
1
answer
422
views
Should functions be assumed to behave like the identity function when evaluated outside their domain?
Suppose we have a set $f$ of ordered pairs (so not a triple $(X,Y,f)$ but just the $f$) and suppose that $f$ has the appropriate property such that we can view $f$ as a function. Formally, we wish to ...
3
votes
2
answers
558
views
Dealing with undefined expressions in predicate logic
Suppose we're working in the first-order language of the real numbers, and we write
$$\forall x (x > 0 \;\rightarrow\; 1/x > 0)$$
We want this to be true, however I feel like it doesn't quite ...
7
votes
11
answers
2k
views
A function that is defined everywhere but has unknown values [closed]
For pedagogical purposes I am looking for a function $\mathbb{N}\to\mathbb{N}$ that is defined everywhere but has most of its values unknown. Although such a function cannot be simple by definition, ...
1
vote
4
answers
901
views
Why can't an explicit well-ordering of the reals be ruled out in ZF?
The statement A = "There exists a well-ordering of the reals" is independent of ZF. My understanding is that the statement B = "There exists an explicit well-ordering of the reals" is also ...
5
votes
2
answers
1k
views
Large cardinals without the ambient set theory?
In an attempt to understand a bit better large cardinals, I have been thinking along the following lines, which could be summarized under the slogan
Talk about cardinals without the
(ambient) ...
1
vote
1
answer
535
views
Tarski-Grothendieck set theory, the axiom of pairing and the axiom of specification
I am building upon MO question 102846 concerning the Tarski-Grothendieck set theory (TG).
I have two questions;
1/ I think that it is possible that the axiom of pairing (axiom 4 of the TG theory ...
3
votes
1
answer
405
views
Godel 's Ladder: Undecidable PI_N sentences for N =2, 3, ......
After Godel's groundbreaking results, a plethora of $\Pi_1^0$ undecidable arithmetical sentences have been found by many authors.
But what about $\Pi_n^0$ for $n=2,3,.....$ ?
There are, to my ...
12
votes
1
answer
1k
views
Elementary Equivalence =? Homotopy Equivalence
One of the most interesting novelties in recent foundational studies is Voevodsky's Homotopical Type Theory project (see here).
Finally homotopy theory ideas have entered in a royal fashion the ...
9
votes
1
answer
798
views
Ultimate Maximality Principle
I wonder if it's possible to formulate an "ultimate" maximality principle (UMP) and prove its consistency. I envision UMP to express the idea that no matter how we enlarge the universe of set theory V ...
2
votes
1
answer
275
views
comprehension and ideal elements
A not uncommon thought in philosophy is that we should distinguish (in philosophy, anyway) between "sparse" ("real", "serious") and "abundant" ("ideal", "superficial") properties/classes and relations....
6
votes
1
answer
1k
views
Some questions about Ackermann set theory
In a comment on this site Andreas Blass stated:
"To fit this situation into my philosophical point of view, I'd say that what Ackermann's theory
calls proper classes are really certain sets. That ...
5
votes
5
answers
3k
views
Easy and Hard problems in Mathematics [closed]
Modified question:
I would like to know some examples of problems in Mathematics, for pedagogical purposes, which do not involve difficult techiques to solve the problem but with a change of context ...
15
votes
5
answers
6k
views
getting rid of existential quantifiers
It seems to me that for most of the twentieth century, axiomatic foundations for mathematical theories were constructed with the (mostly allied) goals of minimizing the number of primitive notions and ...
5
votes
4
answers
2k
views
Subsystems of Peano arithmetic and incompleteness theorem
I think everyone is familiar with Goedel's incompleteness theorems. In particular they imply that PA (Peano arithmetic) can not prove its own consistency. Now my question is what is the largest ...
1
vote
0
answers
418
views
a priori grounds of mathematics [closed]
Hi,
from the title of the question you may guess I'm new to the site, and I am. Even though I've read the FAQ and I know that this isn't the place for such open questions (I believe it is open, but ...
12
votes
1
answer
3k
views
Up-to-date version of Principia Mathematica?
Background: I found this interesting translation of Godel's On formally undecidable propositions of Principia Mathematica and related systems I that, along with translating it into English, uses more ...
7
votes
0
answers
1k
views
Is there a finite-dimensional vector space whose dimension cannot be found? [closed]
Is there a finite-dimensional vector space whose dimension cannot be found? Assume, we have somehow constructed a vector space whose dimension is finite, but yet unknown. Is there always an algorithm ...
8
votes
1
answer
3k
views
Foundations: Existence of uncountable ordinals.
This isn't really a research question, but at least it's research-level mathematics. I'm talking with some other people about the first uncountable ordinal, and I want some facts to inform this ...
4
votes
2
answers
1k
views
products in a category without reference to objects or sources and targets
Hi,
I was thinking about presenting categories with nothing but equations over morphisms. I wondered about products. The definition of a product has its genesis in the following diagram shape
A->B
...
4
votes
1
answer
605
views
linear logic, diagrammatic calculus and foundations
Hi,
I have been interested in foundations for a while, especially categories as foundations. I am of the opinion that, as long as we present the theory of categories in SET, we will not be able to ...
2
votes
4
answers
1k
views
Are inference laws consistent?
Please forgive me if this question sounds too naive... Well, in mathematics a formal theory consists of a collection of axioms $T$ (such as Peano arithmetics, or Group Theory, or ZFC), which ...
11
votes
3
answers
2k
views
Kunen's use of Countable Transitive Models
Hi,
I have a doubt concerning Kunen's exposition of forcing in his classical book (arguably $the$ book on forcing). When dealing with Countable Transitive Models to set up the forcing machinery, ...
1
vote
1
answer
332
views
continuous maps between categories that are not functors
Hey,
Is it possible to define a map between two categories which preserves all products and binary equalizers and yet is not a functor, ie it does not satisfy one or more axioms of a functor? ...
7
votes
2
answers
736
views
Sets as Combinatorial Games
Just a few days ago my seemingly eternal and recurrent fascination for Conway's combinatorial game theory (CGT) & surreal numbers had a recrudescence, so I grabbed this excellent survey, and began ...
7
votes
3
answers
3k
views
incompleteness in real analysis
Godel's theorem tells us that any sufficiently powerful consistent formal theory of the integers is incomplete; but what about formal theories of the real numbers? More precisely, what about theories ...
8
votes
2
answers
863
views
Consistent hierarchy of axiomatic systems
First of all, I am not an expert in model theory. I just want to get my personal view on the foundations of mathematics straight.
I just learned in Sergey Melikhov's answer to another question ...
5
votes
5
answers
1k
views
Concrete models of abstract structures
Most mathematicians seem to be contented with the fact, that abstract structures cannot be directly modelled as such in a set theory without ur-elements. What seems to me the standard stance: Set ...
26
votes
1
answer
2k
views
Nontrivial circular arguments?
There is a famous circular argument for the Prime Number Theorem (PNT). It turns
out that there exists an infinite sequence of elementary-to-prove Chebyshev-type estimates
that taken together imply ...
2
votes
0
answers
167
views
Multitype approaches to choice?
I wonder if anyone has developed a set theory which approaches the issue of the non-emptiness of products of non-empty sets via a hierarchy of types (comparable to how Von Neumann–Bernays–Gödel set ...