Transcendentality
Transcendentality Tran`scen*den*tal"i*ty, n. The quality or state of being transcendental. [1913 Webster]

The Collaborative International Dictionary of English. 2000.

Look at other dictionaries:

  • transcendentality — noun The state or condition of being transcendental. Syn: transcendentalness …   Wiktionary

  • transcendentality — tran·scen·den·tal·i·ty …   English syllables

  • transcendentality — ˌ ̷ ̷(ˌ) ̷ ̷den.ˈtaləd.ē noun ( es) Etymology: transcendental (I) + ity : the quality or state of being transcendental …   Useful english dictionary

  • transcendental — transcendentality, n. transcendentally adv. /tran sen den tl, seuhn /, adj. 1. transcendent, surpassing, or superior. 2. being beyond ordinary or common experience, thought, or belief; supernatural. 3. abstract or metaphysical. 4. idealistic,… …   Universalium

  • Argument from morality — The argument from morality is one of many arguments for the existence of God. It comes in different forms, all aiming to support the claim that God exists with observations about morality. Its counterpoint is generally the Problem of evil.… …   Wikipedia

  • transcendentalitate — TRANSCENDENTALITÁTE s.f. (Rar) Caracter transcendental. – Din engl. transcendentality. Trimis de ionel bufu, 28.06.2004. Sursa: DEX 98  transcendentalitáte s. f. Trimis de siveco, 10.08.2004. Sursa: Dicţionar ortografic  TRANSCENDENTALITÁTE f.… …   Dicționar Român

  • 1882 — This article is about the year 1882. Millennium: 2nd millennium Centuries: 18th century – 19th century – 20th century Decades: 1850s  1860s  1870s  – 1880s –  1890s  190 …   Wikipedia

  • Jacques Derrida — Derrida redirects here. For the documentary film, see Derrida (film). For the physicist, see Bernard Derrida. Jacques Derrida Full name Jacques Derrida Born July 15, 1930(1930 07 15) El Biar ( …   Wikipedia

  • Queue machine — A queue machine or queue automaton is a finite state machine with the ability to store and retrieve data from an infinite memory queue. It is a model of computation equivalent to a Turing machine, and therefore it can process any formal language …   Wikipedia

  • Stability spectrum — In model theory, a branch of mathematical logic, a complete first order theory T is called stable in λ (an infinite cardinal number), if the Stone space of every model of T of size ≤ λ has itself size ≤ λ. T is called a stable theory if there is… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”