- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors W. S. Brown Wed 03 June 2020
- Hilbert's program Stanford Encyclopedia of Philosophy Wed 03 June 2020
- On the complexity of the Lickteig-Roy subresultant algorithm Grégoire Lecerf Tue 02 June 2020
- Subresultants and Reduced Polynomial Remainder Sequences George E. Collins Tue 02 June 2020
- Improved Polynomial Remainder Sequences for Ore Polynomials Maximilian Jaroschek Tue 02 June 2020
- Preservation of normality by unambiguous transducers Olivier Carton Tue 02 June 2020
- Classical versus intuitionistic logic Dag Prawitz Mon 01 June 2020
- Theorems on Deducibility C. H. Langford Sun 31 May 2020
- Second-order and Higher-order Logic Stanford Encyclopedia of Philosophy Sat 30 May 2020
- Efficient Analysis of VASS Termination Complexity Antonín Kučera Jérôme Leroux Dominik Velan Sat 30 May 2020
- When Reachability Meets Grzegorczyk Jérôme Leroux Sat 30 May 2020
- An Approach to Regular Separability in Vector Addition Systems Wojciech Czerwiński Georg Zetzsche Sat 30 May 2020
- Testing Membership for Timed Automata Richard Lassaigne Michel de Rougemont Fri 29 May 2020
- Formalising perfectoid spaces Kevin Buzzard Johan Commelin Patrick Massot Fri 29 May 2020
- Deciding Polynomial-Exponential Problems Melanie Achatz Fri 29 May 2020
- Solving One and Two-Dimensional Exponential Polynomial Systems Aude Maignan Wed 27 May 2020
- Exponential Polynomials E. T. Bell Wed 27 May 2020
- Complexity results for classes of quantificational formulas Harry R. Lewis Mon 25 May 2020
- Gødel's Incompleteness Theorems Stanford Encyclopedia of Philosophy Sun 24 May 2020
- Kurt Gødel Stanford Encyclopedia of Philosophy Sun 24 May 2020
Library Size: 13G (12979 entries),
Last Updated: Apr 21, 2026, 11:39:05,
Build Time: N/A
