*For Tarski's problem about the elementary theory of free groups see
*
*
*
*
Wikimedia Foundation. 2010.
Tarski's exponential function problem — In model theory, Tarski s exponential function problem asks whether the usual theory of the real numbers together with the exponential function is decidable. Tarski had previously shown that the theory of the real numbers (without the exponential … Wikipedia
Tarski's circle-squaring problem — is the challenge, posed by Alfred Tarski in 1925, to take a disc in the plane, cut it into finitely many pieces, and reassemble the pieces so as to get a square of equal area. This was proven to be possible by Miklós Laczkovich in 1990; the… … Wikipedia
Tarski's plank problem — In mathematics, Tarski s plank problem is a question about coverings of convex regions in n dimensional Euclidean space by planks : regions between two hyperplanes. Tarski asked if the sum of the widths of the planks must be at least the minimum… … Wikipedia
Tarski monster group — In mathematics, a Tarski monster group, named for Alfred Tarski, is an infinite group G , such that every proper subgroup H of G , other than the identity subgroup, is a cyclic group of order a fixed prime number p . A Tarski monster group is… … Wikipedia
Banach–Tarski paradox — The Banach–Tarski paradox is a theorem in set theoretic geometry which states that a solid ball in 3 dimensional space can be split into several non overlapping pieces, which can then be put back together in a different way to yield two identical … Wikipedia
Alfred Tarski — Infobox scientist name = Alfred Tarski caption = birth date = birth date|1901|01|14 birth place = Warsaw, Poland (under Russian rule at the time) death date = death date|1983|10|26 death place = Berkeley, California fields = Mathematics, logic,… … Wikipedia
Congruence lattice problem — In mathematics, the congruence lattice problem asks whether every algebraic distributive lattice is isomorphic to the congruence lattice of some other lattice. The problem was posed by Robert P. Dilworth, and for many years it was one of the most … Wikipedia
Paradoxe de Banach-Tarski — En mathématiques, et plus précisément en géométrie, le paradoxe de Banach Tarski est un théorème, démontré en 1924 par Stefan Banach et Alfred Tarski, qui affirme qu il est possible de couper une boule de l espace usuel en un nombre fini de… … Wikipédia en Français
Boolean satisfiability problem — For the concept in mathematical logic, see Satisfiability. 3SAT redirects here. For the Central European television network, see 3sat. In computer science, satisfiability (often written in all capitals or abbreviated SAT) is the problem of… … Wikipedia
Decision problem — A decision problem has only two possible outputs, yes or no (or alternately 1 or 0) on any input. In computability theory and computational complexity theory, a decision problem is a question in some formal system with a yes or no answer,… … Wikipedia
