Page 17 of 17
Re: The impact of democracy on the nuclear family
Posted: Mon Jun 02, 2025 12:46 am
by promethean75
Now look, if i am indeed wrong and you can't explain to me how i am in laymen's terms, don't come at me with no Godel shit because i don't speak advanced mathematics and logic, bro. Save that stuff for your homeboy, Skep. I'm'a just chill over here and read my book.
Re: The impact of democracy on the nuclear family
Posted: Mon Jun 02, 2025 3:49 am
by godelian
promethean75 wrote: ↑Sun Jun 01, 2025 10:29 pm
"Irrefutable claims only exist in mathematics."
I say, sir... if this claim is true, it may be false because the claim is not mathematical and, therefore, may not be irrefutable.
Godel's completeness theorem expresses "Irrefutable claims only exist in mathematics":
== Godel's completeness theorem ==
If a sentence is true in all its models/interpretations then it is provable from its theory.
If a sentence is false in at least one of its models/interpretations, then it is not provable from its theory.
A sentence is mathematical if it has mathematical theory as context.
So, it certainly is a mathematical theorem that there are no irrefutable ("provable") claims unless the claim has a mathematical context. That is not a sufficient condition but certainly a necessary one.
DeepSeek: Godel's completeness theorem
Gödel's **completeness theorem** is a fundamental result in mathematical logic, proved by Kurt Gödel in 1929. It establishes a crucial connection between syntax (formal provability) and semantics (logical truth) in first-order logic.
### **Statement of the Theorem:**
> **Gödel's Completeness Theorem (First-Order Logic):**
> A first-order logical theory is **consistent** (no contradictions can be derived) if and only if it has a **model** (an interpretation in which all its statements are true).
In other words:
- **If** a set of sentences is consistent (no contradiction can be derived using the rules of deduction), **then** there exists some mathematical structure (a model) in which all those sentences are true.
- Conversely, if a set of sentences has a model, then it must be consistent.
### **Key Implications:**
1. **Provability ⇨ Truth:** If a statement is provable from a set of axioms, then it is true in every model of those axioms.
2. **Truth ⇨ Provability (Completeness):** If a statement is true in every model of a set of axioms, then it must be provable from those axioms.
This means that first-order logic is **complete**: every valid statement (true in all models) can be formally derived using the rules of the logical system.
### **Significance:**
- The completeness theorem justifies the use of formal proof systems in mathematics: if a statement is universally true, there exists a formal proof of it.
- It is foundational for model theory, which studies the relationship between formal theories and their interpretations (models).
- It does not, however, provide an effective method for finding proofs—it only guarantees their existence.
Without axiomatic context, no proof and therefore no irrefutability.