Statements (43)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:academic
|
| gptkbp:application |
gptkb:artificial_intelligence
finite automata theory verification complexity classes database query languages |
| gptkbp:characteristic |
does not satisfy Löwenheim–Skolem theorem
does not satisfy compactness theorem |
| gptkbp:conference |
Computer Science Logic (CSL)
Logic in Computer Science (LICS) |
| gptkbp:distinctiveFeature |
classical model theory
|
| gptkbp:fieldOfStudy |
gptkb:logic
theoretical computer science |
| gptkbp:focusesOn |
finite structures
|
| gptkbp:hasJournal |
gptkb:Journal_of_Symbolic_Logic
gptkb:Information_and_Computation Theoretical Computer Science |
| gptkbp:hasTextbook |
Elements of Finite Model Theory by Leonid Libkin
|
| https://www.w3.org/2000/01/rdf-schema#label |
Finite Model Theory
|
| gptkbp:notableContributor |
gptkb:Ronald_Fagin
gptkb:Heinz-Dieter_Ebbinghaus gptkb:Leonid_Libkin Wolfgang Thomas |
| gptkbp:notableWork |
gptkb:Finite_Model_Theory_by_Ebbinghaus_and_Flum
|
| gptkbp:relatedTo |
gptkb:first-order_logic
gptkb:second-order_logic gptkb:Ehrenfeucht–Fraïssé_games model theory theoretical computer science database theory fixed-point logic |
| gptkbp:studies |
descriptive complexity
finite satisfiability finite variable logics definability finite games 0-1 laws expressive power of logical languages finite homomorphism finite isomorphism finite structures in logic |
| gptkbp:bfsParent |
gptkb:Finite_Model_Theory_by_Ebbinghaus_and_Flum
|
| gptkbp:bfsLayer |
6
|