Finite Model Theory/Logics and Structures

FMT studies logics on finite structures. An outline of the most important of these objects of study is given here.

Logics

The logics defined here and used throughout the book are always relational, i.e. without function symbols, and finite, i.e. have a finite universe, without further notice.

Fragments of FO

The subsequent restrictions can analogously be found in other logics like SO.

MFO ...
ESO and USO ...
FOⁿ ...

Second Order Logic (SO)

Second-order logic extends first-order logic by adding variables and quantifiers that range over sets of individuals. For example, the second-order sentence $\forall S\,\forall x\,(x\in S\lor x\not \in S)$ says that for every set S of individuals and every individual x, either x is in S or it is not. That is, the rules are extended by:

If X is a n-ary relation variable and t₁ ... t_n are terms then X t₁ ... t_n is a formula
If φ is a formula and X a relation variable then $\exists _{X}\varphi$ is a formula

Fragments of Second Order Logic

The fragment monadic second-order logic (MSO) only unary relation variables ("set variables")are allowed.
The existential fragment (ESO) is second-order logic without universal second-order quantifiers, and without negative occurrences of existential second-order quantifiers.
USO ...

Infinitary Logics

Notion

The intention is to extend FO by an infinite disjunction element over a set ψ of formulas (of infinitary logic)

$\bigvee \psi$

So the following infinitary logics can be defined

$L_{\infty \varpi }$ where ψ is an arbitrary set of formulas, e.g. uncountable
$L_{\varpi \varpi }$ where ψ is a countable set of formulas
$L_{\infty \varpi }^{n}$ ...

Definition

syntax ...

semantics ...

Properties

General Quantifier Logics

Fixed Point Logics

Counting Logics

Structures

Finite Graphs

Kinds of Finite Graphs

Strings

This article is issued from Wikibooks. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.