Definability of Truth in Probabilistic Logic - Christiano 2013
intelligence.org · 3,380 words · saved by 3 readers
N/A
Definability of Truth in Probabilistic Logic (Early draft) Paul Christiano∗ Eliezer Yudkowsky† Marcello Herreshoff‡ Mihaly Barasz§ June 10, 2013 1 Introduction A central notion in metamathematics is the truth of a sentence. To express this notion within a theory, we introduce a predicate True which acts on quoted sentences pϕq and returns their truth value True (pϕq) (where pϕq is a representation of ϕ within the theory, for example its…
saved by
related reading
- First-order logic - Wikipediaen.wikipedia.org
- Liar paradox - Wikipediaen.wikipedia.org
- Intuitionistic logic - Wikipediaen.wikipedia.org
- New riddle of induction - Wikipediaen.wikipedia.org
- A Theory That Proves Its Own Inconsistency · Yan Sheng's siteangyansheng.github.io
- Gödel's incompleteness theorems - Wikipediaen.wikipedia.org
- Interpretations of Probability (Stanford Encyclopedia of Philosophy)plato.stanford.edu
- Interpretations of Probability (Stanford Encyclopedia of Philosophy)plato.stanford.edu
- Proofs That Psubstack.com
- canon00-goedel.pdfhirzels.com
- Richard's paradoxen.wikipedia.org
- Language, Proof and Logichomepages.uc.edu