Category:Finite model theory
![]() | Computing portal |
Here is a list of articles in the Finite model theory category of the Computing portal that unifies foundations of mathematics and computations using computers.
Pages in category "Finite model theory"
The following 11 pages are in this category, out of 11 total.
- Finite model theory (computing)
D
- Descriptive complexity theory (computing)
F
- FO (complexity) (computing)
H
- HO (complexity) (computing)
L
- Lindström quantifier (computing)
- Logic of graphs (computing)
P
- Parity game (computing)
Q
- Quantifier rank (computing)
S
- SO (complexity) (computing)
- The Strange Logic of Random Graphs (computing)
T
- Trakhtenbrot's theorem (computing)