One convention sometimes named for this man is dealt with by an algorithm that begins by converting to prenex normal form, then counting the number of quantifier alternations; that algorithm is named for Tarski and Kuratowski and that convention is connected to Turing degrees by Post's theorem, the arithmetical hierarchy of sets. This man sometimes names a logic with an "unknown" value as well as an s-m-n theorem. He also names a unary operation on a set of strings that returns the smallest superset that returns the empty string and is closed under concatenation, known as his namesake star. He is best known, along with the man who proved that the nth prime is greater than n ln n, for a function f that, given x, returns not x of x, and so applying it to itself, say f of f returns not f of f, a paradox that some resolved by introducing types to the lambda calculus. FTP, name this mathematician who names a paradox with Rosser.
One convention sometimes named for this man is dealt with by an algorithm that begins by converting to prenex normal form, then counting the number of quantifier alternations; that algorithm is named for Tarski and Kuratowski and that convention is connected to Turing degrees by Post's theorem, the arithmetical hierarchy of sets. This man sometimes names a logic with an "unknown" value as well as an s-m-n theorem. He also names a unary operation on a set of strings that returns the smallest superset that returns the empty string and is closed under concatenation, known as his namesake star. He is best known, along with the man who proved that the nth prime is greater than n ln n, for a function f that, given x, returns not x of x, and so applying it to itself, say f of f returns not f of f, a paradox that some resolved by introducing types to the lambda calculus. FTP, name this mathematician who names a paradox with Rosser.
One convention sometimes named for this man is dealt with by an algorithm that begins by converting to prenex normal form, then counting the number of quantifier alternations; that algorithm is named for Tarski and Kuratowski and that convention is connected to Turing degrees by Post's theorem, the arithmetical hierarchy of sets.
Stephen Cole {Kleene}