The study of subshifts of finite type involves combinatorics, graph theory, and linear algebra. The goal of project is the computation of invariants such as the entropy and dimension group of a ...

The finite mathematics of sets is comprehensible and usable on its own terms, without appeal to any form of the infinite. That makes it possible to, without circularity, obtain the axioms of full ...

Fraenkel-Mostowski set theory represents an alternative set theory with multiple applications in mathematics and computer science. It deals with ‘finitely supported sets’ instead of ‘sets’. The ...