The following pages link to Monotone versus positive (Q3778681):
Displaying 20 items.
- Finite-model theory -- A personal perspective (Q688663) (← links)
- Negation in rule-based database languages: A survey (Q753476) (← links)
- Homomorphism preservation on quasi-wide classes (Q980940) (← links)
- On the minimum number of negations leading to super-polynomial savings (Q1029051) (← links)
- Fixed-point extensions of first-order logic (Q1090327) (← links)
- Positive versions of polynomial time (Q1281503) (← links)
- Context-sensitive transitive closure operators (Q1319508) (← links)
- Non-cancellative Boolean circuits: A generalization of monotone boolean circuits (Q1566723) (← links)
- Relativised homomorphism preservation at the finite level (Q1680516) (← links)
- On learning monotone DNF under product distributions (Q1881232) (← links)
- Generalized quantifiers and pebble games on finite structures (Q1892941) (← links)
- Replacement in logic (Q1947034) (← links)
- Proof complexity of monotone branching programs (Q2104254) (← links)
- A polynomial excluded-minor approximation of treedepth (Q2119392) (← links)
- A monotone preservation result for Boolean queries expressed as a containment of conjunctive queries (Q2274499) (← links)
- Inductive definitions over finite structures (Q2639057) (← links)
- (Q4638077) (← links)
- First order properties on nowhere dense structures (Q4931094) (← links)
- Positive First-order Logic on Words and Graphs (Q6135776) (← links)
- Non-cancellative Boolean circuits: a generalization of monotone Boolean circuits (Q6567780) (← links)
