Search Results for ""

The small dodecicosidodecahedron is the uniform polyhedron with Maeder index 33 (Maeder 1997), Wenninger index 72 (Wenninger 1989), Coxeter index 42 (Coxeter et al. 1954), ...

The snub dodecadodecahedron, not to be confused with the Archimdean snub dodecahedron, is the uniform polyhedron is the uniform polyhedron with Maeder index 40 (Maeder 1997), ...

The stellated truncated hexahedron (Maeder 1997), also called the quasitruncated hexahedron (Wenninger 1989, p. 144), is the uniform polyhedron with Maeder index 19 (Maeder ...

Tarski's theorem says that the first-order theory of reals with +, *, =, and > allows quantifier elimination. Algorithmic quantifier elimination implies decidability assuming ...

The truncated great dodecahedron is the uniform polyhedron with Maeder index 37 (Maeder 1997), Wenninger index 75 (Wenninger 1989), Coxeter index 47 (Coxeter et al. 1954), ...

The use of the principle of mathematical induction in a proof. Induction used in mathematics is often called mathematical induction.

Also called Chvátal's art gallery theorem. If the walls of an art gallery are made up of n straight line segments, then the entire gallery can always be supervised by |_n/3_| ...

Bonato et al. (2014, 2015) defined the burning number of a simple graph as follows. Consider a process called burning involving are discrete time steps. Each node is either ...

The Church-Turing thesis (formerly commonly known simply as Church's thesis) says that any real-world computation can be translated into an equivalent computation involving a ...

The terms of equational logic are built up from variables and constants using function symbols (or operations). Identities (equalities) of the form s=t, (1) where s and t are ...