Dr August
@ModalMetamodel
In logic, there are no morals.
Unterlogiker: ‘In logic, there are morals.’ Überlogiker: ‘Hail Gödelian immoralism!’
Arithmetisation of syntax is usually realised through Gödel-encoding with prime factorisation, but it’s more complicated within PA. Try to think of a way to express ‘the exponent of prime p in factorisation of n is k’ as a predicate with three variables (p,n,k) in PA’s language.
Constructivist L of the day: the statement ‘¬∃φ(¬φ ∧ ¬¬φ)’ is constructively provable, which means that there actually can’t exist an explicit example of LEM’s failure in standard constructive mathematics. It can only fail with respect to uniformity (ie: ¬∀φ(φ ∨ ¬φ)).
(Kunen outta here) Whoa, whoa (0♯ Mafia), whoa (whoa), whoa (whoa), crit point (HOD), Reinhardt cardinal on that ZF deck, Reinhardt cardinal, whoa-whoa (whoa), Reinhardt cardinal on that ZF deck (kappa, kappa), Reinhardt cardinal, whoa (kappy, whoa-whoa). soundcloud.com/playboicarti/c…
PLAYBOI CARTI’S “MUSIC” SOLD 1,000,000 UNITS IN JUST 4 MONTHS WTFFF
PLAYBOI CARTI’S “MUSIC” SOLD 1,000,000 UNITS IN JUST 4 MONTHS WTFFF
The £1,000,000 question: is the Riemann hypothesis non-trivially connected to neo-Riemannian music theory in some way?
I suspect that Broughan conflates two notions of decidability here. If every zero is simple, then yes, I’ll grant that the set S of indices of zeroes off the critical line is decidable, but this does NOT mean that verifying whether S is empty is decidable in Peano Arithmetic.
