锉屑
发表于 2025-4-1 05:07:03
http://reply.papertrans.cn/24/2327/232619/232619_61.png
轻打
发表于 2025-4-1 06:06:28
Reine Rechtslehre und Gesetzgebungstechnikw that .. is conservative over .. w.r.t. boolean combinations of .. sentences, for . ≥ 1. In particular, we give a positive answer to a question by R. Kaye, whether the provably recursive functions of .. are exactly the primitive recursive ones.
CLAIM
发表于 2025-4-1 13:45:31
http://reply.papertrans.cn/24/2327/232619/232619_63.png
华而不实
发表于 2025-4-1 17:36:05
Zur Manichäischen UrmenschlehreRice‘s Theorem says that every nontrivial semantic property of programs is undecidable. It this spirit we show the following: Every nontrivial absolute (gap, relative) counting property of circuits is UP-hard with respect to polynomial-time Turing reductions.
NUDGE
发表于 2025-4-1 19:07:29
https://doi.org/10.1007/978-3-663-05108-4We prove that the strong Markov‘s rule with only set parameters is admissible in the full set theory with intuitionistic logic mis|The work was supported by Reseach Scientific Foundation of Russian Ministry of Transport
CHECK
发表于 2025-4-2 00:06:22
Resolution, inverse method and the sequent calculus,We discuss the general scheme of building resolution calculi (also called the inverse method) originating from S. Maslov and G. Mints. A survey of resolution calculi for various nonclassical logic is presented, along with several common properties these calculi possess.