„Elsőrendű logika” változatai közötti eltérés
| [ellenőrzött változat] | [ellenőrzött változat] |
Tartalom törölve Tartalom hozzáadva
a r2.7.3) (Bot: következő hozzáadása: ca:Lògica de predicats |
a DEFAULTSORT, replaced: → → → (4) AWB |
||
85. sor:
# Lowercase letters x, y, z,… which are (individual) variables.
# Lowercase letters f, g, h,… which are function variables.
# Symbols denoting logical operators: ¬ ([[logical not]]), <math>\wedge</math> ([[logical conjunction|logical and]]), <math>\vee</math> ([[logical disjunction|logical or]]),
# Symbols denoting quantifiers: <math>\forall</math> ([[universal quantification]]), <math>\exists</math> ([[existential quantification]]).
# Left and right parenthesis.
Some symbols may be omitted as primitive and taken as abbreviations instead; e.g. (P ↔ Q) is an abbreviation for (P
== Formation rules ==
95. sor:
# '''Simple and complex predicates''' If P is an ''n''-adic (''n'' ≥ 0) predicate, then <math>Pa_1,…,Pa_n</math> is well-formed. If ''n'' ≤ 1, P is atomic.
# '''Inductive Clause I:''' If φ is a ''wff'', then ¬ φ is a ''wff''.
# '''Inductive Clause II:''' If φ and ψ are ''wff''s, then <math>(\phi \wedge \psi)</math>, <math>(\phi \vee \psi)</math>, (φ
# '''Inductive Clause III:''' If φ is a ''wff'' containing a free instance of variable ''x'', then <math> \forall x \, \varphi </math> and <math> \exists x \, \varphi </math> are ''wff''s. (Then any instance of ''x'' is said to be [[binding|bound]] – not free – in <math> \forall x \, \varphi </math> and <math> \exists x \, \varphi </math>.)
# '''Closure Clause:''' Nothing else is a ''wff''.
148. sor:
{{csonk-dátum|csonk-mat|2005 júniusából}}
{{DEFAULTSORT:Elso~rendu~logika}}
[[Kategória:Matematikai logika]]
| |||