A Second-Order Logic in Which Variables Range over Relations with Complete First-Order Types

We introduce a restriction of second order logic, SO F , for finite structures. In this restriction the quantifiers range over relation closed by the equivalence relation Ξ FO . In this equivalence relation the equivalence classes are formed by k-tuples whose FO type is the same, for some integer k...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Grosso, A L, Turull-Torres, José M
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Computational complexity Computational modeling Cost accounting Descriptive Complexity Finite Model Theory Games Relational Machine Semantics Vocabulary
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!