The increasing popularity in the late 1970s of affordable, general-purpose, microprocessor-based personal computers in the US, generated a widespread interest around the world in t...
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...
Let k be an integer and M be a closed 2-manifold with Euler characteristic (M) 0. We prove that each polyhedral map G on M with minimum degree and large number of vertices conta...