Explore a concise preview of the Logic & Decidability II session at POPL 2023, presented by Caleb Stanford. Dive into the world of logic and its applications in programming language research, addressing the challenge of undecidability. Gain insights into various logical theories, including arithmetic, linear real rings, and monadic shallow linear (MSL) clauses. Discover how logic translates to state machines and learn about new minimization algorithms. This 11-minute video, part of ACM SIGPLAN's innovative session preview track, aims to make POPL talks more accessible to the broader community by providing essential background information and specific paper overviews.