21 citations · 116 across the 21 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.LO2026
Non-Derivability Results in Polymorphic Dependent Type Theory
Herman Geuvers
In the pure Calculus of Constructions (CC) one can define data types and function over these, and there is a powerful higher order logic to reason over these functions and data typ…
cs.FL2026
Cellular Automaton Reducibility as a Measure of Complexity for Infinite Words
Markel Zubia, Herman Geuvers
Infinite words, also known as streams, hold significant interest in computer science and mathematics, raising the natural question of how their complexity should be measured. We in…