reducible
51Reductionism — Descartes held that non human animals could be reductively explained as automata De homine, 1662. Reductionism can mean either (a) an approach to understanding the nature of complex things by reducing them to the interactions of their parts, or… …
52Dualism (philosophy of mind) — René Descartes s illustration of dualism. Inputs are passed on by the sensory organs to the epiphysis in the brain and from there to the immaterial spirit. In philosophy of mind, dualism is a set of views about the relationship between mind and… …
53Holonomy — Parallel transport on a sphere depends on the path. Transporting from A → N → B → A yields a vector different from the initial vector. This failure to return to the initial vector is measured by the holonomy of the connection. In differential… …
54Post's theorem — In computability theory Post s theorem, named after Emil Post, describes the connection between the arithmetical hierarchy and the Turing degrees. Background The statement of Post s theorem requires several concepts relating to definability and… …
55Philosophy of mind — A phrenological mapping[1] of the brain. Phrenology was among the first attempts to correlate mental functions with specific parts of the brain. Philosophy of mind is a branch of philosophy that studies the nature of the mind, mental even …
56logic, history of — Introduction the history of the discipline from its origins among the ancient Greeks to the present time. Origins of logic in the West Precursors of ancient logic There was a medieval tradition according to which the Greek philosopher …
57n-ary group — In mathematics, an n ary group (also n group, polyadic group or multiary group) is a generalization of a group to a set G with a n ary operation instead of a binary operation.[1] The axioms for an n ary group are defined in such a way as to… …
58Noether identities — In mathematics, Noether identities characterize the degeneracy of a Lagrangian system. Given a Lagrangian system and its Lagrangian L, Noether identities can be defined as a differential operator whose kernel contains a range of the… …
59Turing degree — Post s problem redirects here. For the other Post s problem , see Post s correspondence problem. In computer science and mathematical logic the Turing degree or degree of unsolvability of a set of natural numbers measures the level of algorithmic …
60Gauss's lemma (polynomial) — This article is about Gauss s lemma for polynomials. See also Gauss s lemma. In algebra, in the theory of polynomials, Gauss s lemma, named after Carl Friedrich Gauss, is either of two related statements about polynomials with integral… …
