“…where ϕ [t] indicates a formula that contains term t. The rule (∃-I) may be primitive in various ND, but must be primitive in ND for partial logics (such as the ND proposed below) alongside the introduction rule for ∀, since ∀ and ∃ are not interdefinable in partial logics. To illustrate, the formula ¬∃xBK(x), where BK is the predicate "be (identical to) the KF", is currently true, while ∀x¬BK(x) is false since not every individual is decidable as (not) being BK (to work properly, the law for the exchange of quantifiers must be adjusted using the strong truth predicate [see, e.g., Raclavský, , 2018).…”