Computational complexity and the expressive power of logics
From MaRDI portal
Recommendations
Cited in
(20)- The computational complexity of ideal semantics
- Computational complexity of terminological reasoning in BACK
- Succinctness as a source of complexity in logical formalisms
- The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws
- Possibilistic logic: Complexity and algorithms
- The expressive power of the temporal query language \(L_{\mathcal H}\)
- Expressing versus proving: relating forms of complexity in logic
- Experimental descriptive complexity
- Structure and specification as sources of complexity
- Comparing the Expressibility of Languages Formed Using NP-Complete Operators
- Fundamental significance of the finitary and infinitary semantic layers and characterization of the expressive power of first-order logic
- scientific article; zbMATH DE number 5599076 (Why is no real title available?)
- scientific article; zbMATH DE number 4103047 (Why is no real title available?)
- scientific article; zbMATH DE number 17544 (Why is no real title available?)
- scientific article; zbMATH DE number 1086678 (Why is no real title available?)
- scientific article; zbMATH DE number 1978903 (Why is no real title available?)
- Logics for complexity classes
- Circuit complexity and the expressive power of generalized first-order formulas
- Logical operations and Kolmogorov complexity
- The expressive rate of constraints
This page was built for publication: Computational complexity and the expressive power of logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000099)
