Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Complexity of equivalence relations and preorders from computability theory
We study the relative complexity of equivalence relations and preorders from computability
theory and complexity theory. Given binary relations R, S, a componentwise reducibility is …
theory and complexity theory. Given binary relations R, S, a componentwise reducibility is …
Computable embeddability for algebraic structures
In computability theory, the standard tool to classify preorders is provided by the computable
reducibility. If R and S are preorders with domain ω, then R is computably reducible to S if …
reducibility. If R and S are preorders with domain ω, then R is computably reducible to S if …
Logic Blog 2015f
A Nies - arxiv preprint arxiv:1602.04432, 2016 - arxiv.org
arxiv:1602.04432v1 [math.LO] 14 Feb 2016 Page 1 arxiv:1602.04432v1 [math.LO] 14 Feb
2016 LOGIC BLOG 2015 EDITOR: ANDRÉ NIES The Logic Blog is for • rapidly announcing …
2016 LOGIC BLOG 2015 EDITOR: ANDRÉ NIES The Logic Blog is for • rapidly announcing …