Does permitting comprehension over all well-formed formulas that are neither contradictions nor tautologies result in paradoxes?
I have a hunch that a simple extensional set theory with the "axiom schema of contingent comprehension" is probably susceptible to a well-known paradox and there's a short proof of its inconsistency, but I'm having trouble finding one.
This question is inspired by the argument that plural logic is not susceptible to Russell's paradox given here and the set theory NFU which uses the type system of the simple theory of types only in its comprehension schema. The idea is to insist that all sets are nonempty (similar to rules about plurals in plural logic), but to identify all the different levels of our hierarchy, like NFU does.
Let's take a set theory with the following axioms.
Every set has at least one element.
Every set has at least one non-element.
Extensionality. Sets with the same elements are equal.
Let us additionally insist on the following axiom schema of restricted comprehension.
$$ \text{there exists a $z$ such that $\varphi(z)$ holds and a $w$ such that $\varphi(w)$ fails} \implies \{ x : \varphi(x) \} \; \text{exists} $$
Russell's paradox begins by defining the Russell set $R = \{ x : x \not\in x \} $.
However, in this setting, using this notation in first place brings with it the additional assumption that $z \not\in z$ is contingent.
If we reject this and say that $z \not\in z$ is either a tautology or a contradiction, then we can defuse Russell's paradox by refuting one of its hypotheses.
A version of Curry's paradox has us consider the set
$$ A = \{ x : x \in x \to \varphi \} $$
However, if we insist that $z \in z$ is a contradiction, then $x \in x \to \varphi$ is not allowed as the body of an expression in set-builder notation.