SO^F: a semantic restriction over second-order logic and its polynomial-time hierarchy
From MaRDI portal
Publication:3224003
Recommendations
- The Relational Polynomial-Time Hierarchy and Second-Order Logic
- A restricted second-order logic for non-deterministic poly-logarithmic time
- Semantic restrictions over second-order logic
- Capturing complexity classes by fragments of second-order logic
- Complexity and expressive power of second-order extended Horn logic
Cites work
- A restricted second order logic for finite structures
- A study of homogeneity in relational databases
- Datalog extensions for database queries and updates
- Elements of finite model theory.
- scientific article; zbMATH DE number 17544 (Why is no real title available?)
- scientific article; zbMATH DE number 1302020 (Why is no real title available?)
- Infinitary logics and 0-1 laws
- On finite rigid structures
- Redundant relations in relational databases: a model theoretic perspective
- Relational queries computable in polynomial time
- The polynomial-time hierarchy
- The Relational Polynomial-Time Hierarchy and Second-Order Logic
Cited in
(4)
This page was built for publication: \(\mathrm{SO}^F\): a semantic restriction over second-order logic and its polynomial-time hierarchy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3224003)