SEARCH...:


recently watched....:
  • Mer loße de Pöppcher danze [ksh]
  • Atomic formula [en]
  • Sdaffrika [ksh]
  • Figura:Lage der kreisfreien Stadt Lbeck in Deutschland.png [pms]
  • पुचः:१६५५ [new]
  • MMM (音楽番組) [ja]
  • Vuoverie [bat-smg]
  • Image:Sonnets-Titelblatt 1609.png [nrm]
  • पुचः:८७४य् मदुगु [new]
  • Émâge:Blason73.PNG [frp]
  • Image:NewspaperStand NathanRd HK.jpg [zh-yue]

  • jetzt mitverdienen


    Der freche Erotikshop!
    02 Logo 120x60

    Party Explosion - Click here!
    Final Fantasy III DS game

    Miller Brothers, Click here!
    www.easycar.com
    Estate
    Win a Supercar of your dreams........make Summer special this year

    00003 ORION - Logo
    Fancy a hot adventure? More fun for HIM and HER – Shopping at PABO.com!

    LANGUAGE: ar | id | bg | ca | ceb | cs | da | de | et | en / / | es | eo | fr | gr | he | hr it | ko | lt | hu | nl | ja | no | pl | pt | ru | ro | sk | sl | sr | fi | sv | te | tr | uk | zh

    Atomic formula

    From Wikipedia, the free encyclopedia

    Jump to: navigation, search

    In mathematical logic, an atomic formula (also known simply as an atom) is a formula with no deeper propositional structure, that is, a formula that contains no logical connectives or equivalently a formula that has no strict subformulas. Atoms are thus the simplest well-formed formulas of the logic. Compound formulas are formed by combining the atomic formulas using the logical connectives.

    The precise form of atomic formulas depends on the logic under consideration; for propositional logic, for example, the atomic formulas are the propositional variables. For predicate logic, the atoms are predicate symbols together with their arguments, each argument being a term.

    [edit] Atomic formula in first-order logic

    The well-formed terms and propositions of ordinary first-order logic have the following syntax:

    Terms:

    • t ::= c | x | f (t1, …, tn),

    that is, a term is recursively defined to be a constant c (a named object from the domain of discourse), or a variable x (ranging over the objects in the domain of discourse), or an n-ary function f whose arguments are terms tk. Functions map tuples of objects to objects.

    Propositions:

    • A, B, …  ::= P (t1, …, tn) | AB | ⊤ | AB | ⊥ | AB | ∀x. A | ∃x. A,

    that is, a proposition is recursively defined to be an n-ary predicate P whose arguments are terms tk, or an expression composed of logical connectives (and, or) and quantifiers (for-all, there-exists) used with other propositions.

    An atomic formula or atom is simply a predicate applied to a tuple of terms; that is, an atomic formula is a formula of the form P (t1, …, tn) for P a predicate, and the tk terms.

    All other well-formed formulae are obtained by composing atoms with logical connectives and quantifiers.

    For example, the formula ∀x. P (x) ∧ ∃y. Q (y, f (x)) ∨ ∃z. R (z) contains the atoms

    • P (x)
    • Q (y, f (x))
    • R (z)

    When all of the terms in an atom are ground terms, then the atom is called a ground atom or ground predicate.

    [edit] See also

    [edit] References

    • Hinman, P. (2005). Fundamentals of Mathematical Logic. A K Peters. ISBN 1-568-81262-0. 
    Change language: All | الرربية | Bahasa Indonesia | Български | Català | Cebuano | Ħesky | Dansk | Deutsch | Eesti | English | Español | Esperanto | Français | עברית | Hrvatski | Italiano | 핶국어 | Lietuvių | Magyar | Nederlands | 旡涬語 | Norsk (bokmál) | Polski | Português | Русскиб | Română | Slovenčina | Slovenščina | Српски / Srpski | Suomi | Svenska | తెలుగు | Türkçe | УкраїнсѦка | 中文

    Autorem skryptu AdWiki v0.8 (2007) jest husky83
    Wikipedia jest zarejestrowanym znakiem towarowym Wikimedia Foundation
    Wszystkie materiały pochodzą z Wikipedii, obięte są licencją GNU Free Documentation License