June 23, 1949 article Definability and decision problems in arithmetic Journal of Symbolic Logic DOI: 10.2307/2266510 OpenAlex Authors 0 Author list not loaded yet. Cited by 5 stored of 325 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access A Survey of Local–Global Methods for Hilbert’s Tenth Problem 2024 Association for Women in Mathematics series book-chapter Mathematics Algebraic Geometry and Number Theory 1 citations Termination of triangular polynomial loops 2023 Formal Methods in System Design article Computer Science Logic, programming, and type systems Open access 8 citations Relatively complete verification of probabilistic programs: an expressive language for expectation-based reasoning 2021 Proceedings of the ACM on Programming Languages article Computer Science Logic, programming, and type systems Open access 33 citations Relatively Complete Verification of Probabilistic Programs 2020 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access 0 citations Termination of Polynomial Loops 2020 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems 12 citations 5 results References 0