One unary function says less than two in existential second order logic
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3115890 (Why is no real title available?)
- scientific article; zbMATH DE number 3474957 (Why is no real title available?)
- scientific article; zbMATH DE number 803291 (Why is no real title available?)
- A Natural NP-Complete Problem with a Nontrivial Lower Bound
- A note on the number of monadic quantifiers in monadic \(\Sigma ^{1}_{1}\)
- An application of games to the completeness problem for formalized theories
- First-order spectra with one variable
- Monadic generalized spectra
- On monadic NP vs monadic co-NP
- On winning Ehrenfeucht games and monadic NP
- Reachability is harder for directed than for undirected finite graphs
- Second-order and Inductive Definability on Finite Structures
- Universal quantifiers and time complexity of random access machines
Cited in
(3)
This page was built for publication: One unary function says less than two in existential second order logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q286970)