Arno Pauly

1. Overt choice
   2019/02/14 by Matthew de Brecht, de Brecht, Matthew, Arno Pauly +3 · 2 citations
   Computer Science · Mathematics · #03D80 #54D55 #54H99 #Advanced Banach Space Theory #Advanced Topology and Set Theory #Computability, Logic, AI Algorithms #FOS: Computer and information sciences #FOS: Mathematics #General Topology (math.GN) #Logic (math.LO) #Logic in Computer Science (cs.LO)
2. Enumeration degrees and non-metrizable topology
   2019/04/08 by Takayuki Kihara, Kihara, Takayuki, Keng Meng Ng +3 · 2 citations
   Computer Science · Mathematics · #03D28 #54A05 #54D10 #54G20 #54H05 #Advanced Topology and Set Theory #Computability, Logic, AI Algorithms #FOS: Computer and information sciences #FOS: Mathematics #General Topology (math.GN) #Logic (math.LO) #Logic in Computer Science (cs.LO) #semigroups and automata theory
3. The descriptive theory of represented spaces
   2014/08/22 by Arno Pauly, Pauly, Arno · 1 citation
   Computer Science · Mathematics · #03E15 #18B25 #26A21 #54H05 #Advanced Topology and Set Theory #Computability, Logic, AI Algorithms #F.4.1 #FOS: Computer and information sciences #FOS: Mathematics #General Topology (math.GN) #Logic (math.LO) #Logic in Computer Science (cs.LO) #Mathematical and Theoretical Analysis
4. More on the indivisibility of ℚ
   2024/07/04 by Arno Pauly, Pauly, Arno · 1 citation
   Computer Science · Mathematics · #03D30 #05C55 #Algebraic Geometry and Number Theory #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO) #Polynomial and algebraic computation