Titlebook: Revolutions and Revelations in Computability; 18th Conference on C Ulrich Berger,Johanna N. Y. Franklin,Arno Pauly Conference proceedings 2

AVANT

不出名

Enumerating Classes of Effective Quasi-Polish Spaces, of these classes, in analogy with the numberings of classes of algebraic structures popular in computability theory. We estimate the complexity of (effective) homeomorphism w.r.t. these numberings, and of some natural index sets. In particular, we give precise characterizations of the complexity of certain classes related to separation axioms.

评论者

,An Extension of the Equivalence Between Brouwer’s Fan Theorem and Weak König’s Lemma with a Uniquenis is equivalent to the decidable fan theorem for bounded spreads over the intuitionistic counterpart . of . in classical reverse mathematics. Then it follows that bounded König’s lemma with the uniqueness hypothesis is equivalent to weak König’s lemma with the uniqueness hypothesis over ..

手铐

,Strong Medvedev Reducibilities and the KL-Randomness Problem,that MLR is truth-table Medvedev reducible (.) to KLR. They did this by studying a natural class Either (MLR) and showing that .. We show that Degtev’s stronger reducibilities (positive and linear) do not suffice for the reduction of MLR to Either (MLR), and some related results.

消毒

,On the Compatibility Between the Minimalist Foundation and Constructive Set Theory,dation for constructive mathematics compatible with the main classical and intuitionistic, predicative and impredicative, foundational theories. Here we show that . is in fact compatible with Aczel’s constructive set theory .. We prove this by extending the extensional level of . with rules obtaining a system which turns out to be equivalent to ..

ELUDE

Weak Sequential Theories of Finite Full Binary Trees,ng a direct interpretation of Adjunctive Set Theory in a very weak finitely axiomatized subtheory. We show that weakening the latter theory by removal of an axiom which states that the subtree relation is transitive gives a theory that directly interprets Vaught’s weak set theory, a non-finitely axiomatizable fragment of Adjunctive Set Theory.

熄灭

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/r/image/829923.jpg

RACE

NAV

978-3-031-08739-4The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl

不容置疑