Existential Ex`is*ten"tial, a. 1. Having existence. [Archaic] --Bp. Barlow. [1913 Webster]

2. of or pertaining to, or having the character of, existentialism. [PJC]

3. (Logic) specifying actual existence, rather than only possibility; as, the existential operator. [PJC] --{Ex`is*ten"tial*ly}, adv. [Archaic] [1913 Webster]

Existentially as well as essentially intelligent. --Colerige. [1913 Webster]

The Collaborative International Dictionary of English. 2000.

Look at other dictionaries:

  • existentially — existential ► ADJECTIVE 1) relating to existence. 2) Philosophy concerned with existentialism. DERIVATIVES existentially adverb …   English terms dictionary

  • existentially — adverb see existential …   New Collegiate Dictionary

  • existentially — See existential. * * * …   Universalium

  • existentially — adverb In an existential manner …   Wiktionary

  • existentially — ex·is·ten·tial·ly …   English syllables

  • existentially — adverb see existential * * * existenˈtially adverb • • • Main Entry: ↑exist …   Useful english dictionary

  • Existentially closed model — In model theory, a branch of mathematical logic, the notion of an existentially closed model of a theory generalizes the notions of algebraically closed fields (for the theory of fields), real closed fields (for the theory of ordered fields),… …   Wikipedia

  • existential — existentially, adv. /eg zi sten sheuhl, ek si /, adj. 1. pertaining to existence. 2. of, pertaining to, or characteristic of existentialism: an existential hero. [1685 95; < LL existentialis relating to existing. See EXISTENCE, AL1] * * * …   Universalium

  • Skolem normal form — A formula of first order logic is in Skolem normal form (named after Thoralf Skolem) if it is in conjunctive prenex normal form with only universal first order quantifiers. Every first order formula can be converted into Skolem normal form while… …   Wikipedia

  • Alternating Turing machine — In computational complexity theory, an alternating Turing machine (ATM) is a non deterministic Turing machine (NTM) with a rule for accepting computations that generalizes the rules used in the definition of the complexity classes NP and co NP.… …   Wikipedia

Share the article and excerpts

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