Questions tagged [foundations]

This tag is for questions about the foundations of mathematics, and the formalization of mathematical concepts in foundational theories (e.g. set theory, category theory, and type theory).

Foundations of mathematics is the study of the philosophical and logical and/or algorithmic basis of mathematics, or, in a broader sense, the mathematical investigation of what underlies the philosophical theories concerning the nature of mathematics. In this latter sense, the distinction between foundations of mathematics and philosophy of mathematics turns out to be quite vague.

Foundations of mathematics can be conceived as the study of the basic mathematical concepts (set, function, geometrical figure, number, etc.) and how they form hierarchies of more complex structures and concepts, especially the fundamentally important structures that form the language of mathematics (formulas, theories and their models giving a meaning to formulas, definitions, proofs, algorithms, etc.) also called metamathematical concepts, with an eye to the philosophical aspects and the unity of mathematics.

The search for foundations of mathematics is a central question of the philosophy of mathematics; the abstract nature of mathematical objects presents special philosophical challenges.

1261 questions
0
votes
1 answer

Is it necessary for a Mathematician to learn Maths foundations?

Is it necessary for a mathematician to learn Maths foundations/philosophy and Maths history?
user532487
0
votes
3 answers

A Small Proof in Number Theory

let us suppose that there are values $a_1, a_2, b_1, b_2 \in \mathbb{Z}^+$ such that $gcd(a_1,b_1) = 1$ and $gcd(a_2,b_2) = 1$ I have to prove $a_1b_2 = a_2b_1 => a_1 = a_2$ and $b_1 = b_2$.
0
votes
4 answers

Switch algebraic sign

I can't believe that I seriously ask this question as it is so simple. Given this $-x^3+4x$ I'd like to factor out -x, so I did $-x(x^2-4)$ which equals $-x(x^2-2^2)$ equals $-x(x-2)(x+2)$ Right? However, seems like the guys in the lecture script I…
0
votes
0 answers

References for the foundations of mathematics

I´m a physicist and I´d like to learn about deep questions on the foundations of mathematics. I´m looking for a acessible introduction written in a language a physicist could understand, and then build up from there until I have a relatively good…
dwfa
  • 257
-1
votes
1 answer

Sources for a standard hierarchical system of classification of mathematical objects.

In biology there exists a hierarchy of biological classifications into eight major taxonomic ranks along with rules to define new members of the taxonomy and provide the proper naming according to conventions. This system provides a framework that…
Phil P
  • 11
-1
votes
1 answer

Spivak chapet 7 problem 3. 4th edition, can someone help?

Prove that there is some number $x$ such that (i) $\displaystyle{x^{179} + \frac{163}{1 + x^2 + \sin^2 x} = 119}$ (ii) $\sin x = x - 1$ I am not sure what to do, can someone show me what to do?
-1
votes
1 answer

By W&R's type theory, has Russell abandoned his view in his Principles §7?

The Principles. §7 : Thus, for example, the proposition "x and y are numbers implies $(x+y)^2 = x^2 + 2xy + y^2$ " still holds equally if for x and y we substitute Socrates and Plato[2]: both hypothesis and consequent, in this case, will be…
George Chen
  • 1,541
  • 1
  • 11
  • 19
-2
votes
1 answer

Would there be any consequences in accepting conjectures that are essentially true?

There are many unproven conjectures that if you heuristically took a probability of it being true, it would basically be almost $100\%$ true. I can see why mathematics must be rigorous as many conjectures thought to be true were proven false, but…
-2
votes
1 answer

Alternative to ZFC and Completeness

While it is proven the ZFC is incomplete, and arithmetic foundations is also incomplete. I was looking for a foundation that would achieve Hilbert's dream. Premise 1 : Kurt Gödel incompleteness theorem uses self reference and based on the logic in…
panday
  • 17
-3
votes
1 answer

Prove that the set of equivalence classes generated by ~ is uncountable

I am very unsure on how to do this question though I have attempted it. I'm not sure that the statement "if there exists a bijection between a set A and an uncountable set B, then A is uncountable" is true. I would appreciate a few pointers or some…
1 2
3