His main research concerns Discrete mathematics, Combinatorics, Upper and lower bounds, Bounded function and Polynomial. Particularly relevant to True arithmetic is his body of work in Discrete mathematics. Pavel Pudlák has researched True arithmetic in several fields, including Arithmetic, Metamathematics and Second-order arithmetic.
His research integrates issues of Computational complexity theory, Algorithm and Field in his study of Combinatorics. His Upper and lower bounds research is multidisciplinary, incorporating elements of Prime, Pigeonhole principle, Exponential function, Randomized algorithm and Conjunctive normal form. His work in Bounded function addresses subjects such as Probabilistic logic, which are connected to disciplines such as Class, Connectivity and Random variable.
His primary scientific interests are in Discrete mathematics, Combinatorics, Upper and lower bounds, Mathematical proof and Bounded function. Pavel Pudlák works in the field of Discrete mathematics, namely Boolean function. His research in Combinatorics intersects with topics in Matrix and Algebraic number.
His studies in Upper and lower bounds integrate themes in fields like Function, Modulo and Prime. His work carried out in the field of Mathematical proof brings together such families of science as Calculus and Resolution. Pavel Pudlák has included themes like Probabilistic logic and Constant in his Bounded function study.
Pavel Pudlák spends much of his time researching Discrete mathematics, Combinatorics, Upper and lower bounds, Boolean function and Proof complexity. His Discrete mathematics research includes themes of Lexicographical order and Interpolation. His Combinatorics research is multidisciplinary, incorporating perspectives in Ordinal number, Mirsky's theorem, Random variable and Finitary.
His Upper and lower bounds research incorporates themes from Linear system, Resolution and Pigeonhole principle. As part of the same scientific family, Pavel Pudlák usually focuses on Boolean function, concentrating on Binary number and intersecting with Joint entropy, Pairwise comparison, Variables and Entropy. The concepts of his Proof complexity study are interwoven with issues in Sentence and Theoretical computer science.
Pavel Pudlák mainly investigates Discrete mathematics, Combinatorics, Upper and lower bounds, Unary operation and Binary number. His study in Discrete mathematics is interdisciplinary in nature, drawing from both Quotient and Pure mathematics. His Upper and lower bounds research includes elements of Random variable, Resolution and Pigeonhole principle.
His research integrates issues of Mathematical proof, Polynomial and Equivalence in his study of Resolution. His study looks at the relationship between Unary operation and topics such as Open problem, which overlap with Boolean function. Pavel Pudlák interconnects Entropy, Joint entropy and Pairwise comparison in the investigation of issues within Binary number.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Metamathematics of First-Order Arithmetic
Petr Hájek;Pavel Pudlák.
Lower Bounds for Resolution and Cutting Plane Proofs and Monotone Computations
Journal of Symbolic Logic (1997)
Threshold circuits of bounded depth
András Hajnal;András Hajnal;Wolfgang Maass;Wolfgang Maass;Pavel Pudlák;Pavel Pudlák;György Turán;György Turán.
Journal of Computer and System Sciences (1993)
Threshold circuits of bounded depth
Andras Hajnal;Wolfgang Maass;Pavel Pudlak;Mario Szegedy.
foundations of computer science (1987)
An improved exponential-time algorithm for k-SAT
Ramamohan Paturi;Pavel Pudlák;Michael E. Saks;Francis Zane.
Journal of the ACM (2005)
Satisfiability Coding Lemma.
Ramamohan Paturi;Pavel Pudlák;Francis Zane.
Chicago Journal of Theoretical Computer Science (1999)
Propositional Proof Systems, the Consistency of First Order Theories and the Complexity of Computations
Jan Krajíček;Pavel Pudlák.
Journal of Symbolic Logic (1989)
An exponential lower bound to the size of bounded depth Frege proofs of the Pigeonhole Principle
Jan Krajíček;Pavel Pudlák;Alan Woods.
Random Structures and Algorithms (1995)
Bounded arithmetic and the polynomial hierarchy
Jan Krajíček;Pavel Pudlák;Gaisi Takeuti.
Annals of Pure and Applied Logic (1991)
Chapter VIII - The Lengths of Proofs
Studies in logic and the foundations of mathematics (1998)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: