foreign
发表于 2025-3-30 10:13:59
Viacheslav V. Kozlov Beach, FL, USA, in January 2018..The 22 revised full papers were carefully reviewed and selected from 22 submissions. The scope of the Symposium is broad and includes constructive mathematics and type theory; homotopy type theory; logic, automata, and automatic structures; computability and randomn
责难
发表于 2025-3-30 16:07:01
http://reply.papertrans.cn/87/8688/868733/868733_52.png
nonsensical
发表于 2025-3-30 20:17:22
Anton A. Maraev,Gennady A. Shut,Alexander N. Timofeev,Sergey V. Mikheev,Artem Kh. Akhmerov,Liliana Sess, they provided the base for a meta-theoretic investigation of IEL, which was continued by Krupski with a proof of cut-elimination, and Su and Sano establishing semantic cut-elimination and the finite model property. However, to the best of our knowledge, no analysis of these results in a constru
Minatory
发表于 2025-3-30 20:51:48
Artem K. Akhmerov,Aleksandr S. Vasilev using quantifier-free comprehension. This extension is motivated by the fact that cut-elimination can be used as a tool to extract information from real mathematical proofs, and often a crucial part of such proofs is the definition of sets by formulas. This is expressed by the comprehension axiom s
不再流行
发表于 2025-3-31 03:39:30
Ruslan D. Khlynov,Victoria A. Ryzhova,Igor A. Konyakhin,Valery V. Korotaev This leads to logical systems like the sequent calculus or natural deduction modulo. Even if deduction modulo is logically equivalent to first-order logic, proofs in such systems are quite different and dramatically simpler with one cost: cut elimination may not hold anymore. We prove first that it