Semantic Restrictions over Second-Order Logic
From MaRDI portal
Publication:3458159
DOI10.1007/978-3-642-36008-4_8zbMath1452.68066OpenAlexW1258136410MaRDI QIDQ3458159
Alejandro L. Grosso, Jose Maria Turull Torres, Flavio Ferrarotti
Publication date: 8 December 2015
Published in: Semantics in Data and Knowledge Bases (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-36008-4_8
Database theory (68P15) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Descriptive complexity and finite models (68Q19) Higher-order logic (03B16)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fixed-point extensions of first-order logic
- Datalog extensions for database queries and updates
- Infinitary logics and 0-1 laws
- An optimal lower bound on the number of variables for graph identification
- The polynomial-time hierarchy
- A restricted second order logic for finite structures
- On the complexity of entailment in propositional multivalued logics
- Generalized quantifiers and pebble games on finite structures
- SO F : A Semantic Restriction over Second-Order Logic and Its Polynomial-Time Hierarchy
- Relational queries computable in polynomial time
- On Moschovakis closure ordinals
- Finite Variable Logics in Descriptive Complexity Theory
- Fixpoint logics, relational machines, and computational complexity
- Subclasses of binary NP
- The expressive power of fixed-point logic with counting
- The Relational Polynomial-Time Hierarchy and Second-Order Logic
This page was built for publication: Semantic Restrictions over Second-Order Logic
