Differences between revisions 2 and 10 (spanning 8 versions)
⇤ ← Revision 2 as of 2003-09-16 18:13:50 →
Size: 160
Editor: yakko
Comment:
← Revision 10 as of 2020-01-26 23:01:28 → ⇥
Size: 955
Editor: scot
Comment:
Deletions are marked like this. Additions are marked like this.
Line 2: Line 2:

'''Propositional Logic:'''
Line 5: Line 7:
'''First Order Logic:'''

A '''model''' for a set $$X$$ of formulas is an interpretation $$M$$ for $$X$$ such that every formula of $$X$$ is true in $$M$$.

A ''domain'' $$D$$ is any nonempty set. An ''interpretation'' for a set of formulas $$X$$, is a domain $$D$$ together with a rule that

 * assigns to each $$n$$-place predicate symbol (that occurs in a formula) of $$X$$ an $$n$$-place predicate in $$D$$;
 * assigns to each $$n$$-place operation symbol of $$X$$ an $$n$$-place operation in $$D$$;
 * assigns to each constant symbol of $$X$$ an element of $$D$$; and
 * assigns to $$=$$ the identity predicate $$=$$ in $$D$$, defined by: $$a=b$$ iff $$a$$ and $$b$$ are the same.


See: First Order Mathematical Logic by Angelo Margaris p 145

Back to ComputerTerms

Propositional Logic:

In terms of a logic formula, a ["Model"] is some assignment of variables that causes the formula to be true.

First Order Logic:

A model for a set $$X$$ of formulas is an interpretation $$M$$ for $$X$$ such that every formula of $$X$$ is true in $$M$$.

A domain $$D$$ is any nonempty set. An interpretation for a set of formulas $$X$$, is a domain $$D$$ together with a rule that

  • assigns to each $$n$$-place predicate symbol (that occurs in a formula) of $$X$$ an $$n$$-place predicate in $$D$$;
  • assigns to each $$n$$-place operation symbol of $$X$$ an $$n$$-place operation in $$D$$;
  • assigns to each constant symbol of $$X$$ an element of $$D$$; and
  • assigns to $$=$$ the identity predicate $$=$$ in $$D$$, defined by: $$a=b$$ iff $$a$$ and $$b$$ are the same.

See: First Order Mathematical Logic by Angelo Margaris p 145

Back to ComputerTerms

Model (last edited 2020-01-26 23:01:28 by scot)