Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Formation rule

From Wikipedia, the free encyclopedia
Rule defining the correct structure of expressions in formal grammar
Part ofa series on
Formal languages

Inmathematical logic,formation rules are rules for describingwell-formed words over thealphabet of aformal language.[1] These rules only address the location and manipulation of the strings of the language. It does not describe anything else about a language, such as itssemantics (i.e. what the strings mean). (See alsoformal grammar).

Formal language

[edit]
Main article:Formal language

Aformal language is an organizedset ofsymbols the essential feature being that it can be precisely defined in terms of just the shapes and locations of those symbols. Such a language can be defined, then, without anyreference to anymeanings of any of its expressions; it can exist before anyinterpretation is assigned to it—that is, before it has any meaning. Aformal grammar determines which symbols and sets of symbols areformulas in a formal language.

Formal systems

[edit]
Main article:Formal system

Aformal system (also called alogical calculus, or alogical system) consists of a formal language together with adeductive apparatus (also called adeductive system). The deductive apparatus may consist of a set oftransformation rules (also calledinference rules) or a set ofaxioms, or have both. A formal system is used toderive one expression from one or more other expressions. Propositional and predicate calculi are examples of formal systems.

Propositional and predicate logic

[edit]

The formation rules of apropositional calculus may, for instance, take a form such that;

Apredicate calculus will usually include all the same rules as a propositional calculus, with the addition ofquantifiers such that if we take Φ to be a formula of propositional logic and α as avariable then we can take ({\displaystyle \forall }α)Φ and ({\displaystyle \exists }α)Φ each to be formulas of our predicate calculus.

See also

[edit]

References

[edit]
  1. ^Hinman, Peter (2005).Fundamentals of Mathematical Logic. A K Peters/CRC Press. Retrieved2022-11-17.Specifying the syntax of any language L follows a common pattern. First a set of symbols is given, and we define an L-expression to be any finite sequence of these symbols. Then we specify one or more sets of L-expressions which we regard as meaningful. The meaningful expressions are generally described as those constructed by following certain rules or algorithms, and the set of them is characterized as the smallest set of expressions which is closed under these formation rules.
General
Theorems (list)
 and paradoxes
Logics
Traditional
Propositional
Predicate
Set theory
Types ofsets
Maps and cardinality
Set theories
Formal systems (list),
language and syntax
Example axiomatic
systems
 (list)
Proof theory
Model theory
Computability theory
Related
Retrieved from "https://en.wikipedia.org/w/index.php?title=Formation_rule&oldid=1288377632"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp