- Serial Properties, Selector Proofs, and the Provability of Consistency
2024/03/18 by Artemov, Sergei · 3 citations
#03A05 #03B30 #03F03 #03F07 #03F30 #03F40 #F.3.0 #F.4.0 #F.4.1 #FOS: Mathematics #I.2.0 #I.2.3 #Logic (math.LO)
- Incompleteness of boundedly axiomatizable theories
2023/11/23 by Enayat, Ali, Visser, Albert · 1 citation
#03F40 #FOS: Mathematics #Logic (math.LO)
- A proof complexity conjecture and the Incompleteness theorem
2023/03/19 by Jan Krajı́ček, Krajicek, Jan · 1 citation
Computer Science · #03F20 #03F40 #68Q15 #Advanced Algebra and Logic #F.1.3 #F.4.1 #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems
- There are no minimal essentially undecidable Theories
2022/07/17 by Fedor Pakhomov, Pakhomov, Fedor, Murwanashyaka, Juvenal +1 · 1 citation
Arts and Humanities · Computer Science · #03F2 #03F30 #03F40 #FOS: Mathematics #Logic (math.LO) #Logic, Reasoning, and Knowledge #Philosophy and History of Science
- An incompleteness theorem via ordinal analysis
2021/09/20 by Walsh, James · 1 citation
#03F15 #03F40 #FOS: Mathematics #Logic (math.LO)
- A mathematical commitment without computational strength
2020/04/15 by Freund, Anton · 1 citation
#03A05 #03F30 #03F40 #68R10 #FOS: Mathematics #Logic (math.LO)
- The Small-Is-Very-Small Principle
2018/05/03 by Visser, Albert · 3 citations
#03C62 #03F30 #03F40 #03H15 #FOS: Mathematics #Logic (math.LO)
- Slow and Ordinary Provability for Peano Arithmetic
2016/02/04 by Paula Henk, Henk, Paula, Fedor Pakhomov +1 · 2 citations
Computer Science · Mathematics · #03F15 #03F30 #03F40 #03F45 #03H15 #Advanced Topology and Set Theory #Computability, Logic, AI Algorithms #FOS: Mathematics #Logic (math.LO) #Logic, Reasoning, and Knowledge