Pseudorandom Finite ModelsJan Dreierhttps://www.ac.tuwien.ac.at/people/dreier/meproceedings2023JuneLICS38th Annual Symposium on Logic in Computer Sciencehttps://lics.siglog.org/lics23//USAMABostonarXivhttps://arxiv.org/abs/2304.12109We study pseudorandomness and pseudorandom generators from the perspective of logical definability. Building on results from ordinary derandomization and finite model theory, we show that it is possible to deterministically construct, in polynomial time, graphs and relational structures that are statistically indistinguishable from random structures by any sentence of first order or least fixed point logics. This raises the question of whether such constructions can be implemented via logical transductions from simpler structures with less entropy. In other words, can logical formulas be pseudorandom generators? We provide a complete classification of when this is possible for first order logic, fixed point logic, and fixed point logic with parity, and provide partial results and conjectures for first order logic with parity.