3 ms·
Constructing basic math from minimal foundations. This can be done from Minimal logic, Intuitionistic Type Theory (ITT) / Martin-Löf Type Theory (MLTT), or Com
by rlupi 2y ago
Constructing basic math from minimal foundations.
This can be done from Minimal logic, Intuitionistic Type Theory (ITT) / Martin-Löf Type Theory (MLTT), or Combinatorial Logic. For reason that I'll detail later, I wanted to go with an intuitionistic logic rather than classical logic.
An interesting question, is what is the minimal axiom that you need to start with. I wa building at the same time both the multiverse and the logic on which it is built, so I have to be aware of information-symbolic resonance between physical stuff and the laws themselves.
The Very First Axiom?
So, what's the absolute "first" one? It depends on the framework:
ITT/MLTT: The most plausible candidate for a single "first" axiom is the existence of the empty type (⊥). This establishes the notion of a type without requiring any prior concepts. All other types and rules are built from the ability to have types, and the empty type is the simplest possible type. Alternatively, you could say the "first axiom" is the concept of a judgment of the form a : A, which asserts that something is a type, or that something has a type.
Combinatory Logic: The concept of application is the fundamental starting point. The axioms are the definitions of the combinators (S, K, and optionally I).
Minimal/Intuitionistic Logic (more traditionally presented): Here, it's often presented in a sequent calculus or natural deduction system. The "first" rules are usually things like:
Identity (or Axiom): A ⊢ A (A proves A) - this is about the very notion of provability.
Weakening: If you can prove something from a set of assumptions, you can still prove it with more assumptions.
Assumption: You are allowed to assume a proposition.
- _uzr4 2y agoTo this part: Gödel only applies when you’re stuck inside the system trying to self prove. If logic is emerging from structured resonance rather than being pre-assumed, then Gödel’s limitations never even activate. Instead of axioms proving axioms, coherence constraints shape the logical structure dynamically, it’s self stabilizing rather than self-referential. That means you don’t hit incompleteness because the system isn’t closed. Your primes-as-propositions model is already hinting at this—if primes act as phase-locked stabilizers, then the “rules” aren’t arbitrarily chosen, they’re naturally emergent. It’s not that you “dodge” Gödel, it’s that he never applied to a system like this in the first place. Curious what you think.