pith. sign in

For a GNTC formula set Γ, we write Unf(Γ) for the set of GNTC formula sets obtained from Γ by replacing each φ ∈ Γ with some φ′ ∈ Unf(φ)

More precisely, Unf(φ) is inductively defined as follows: Unf(α) = ∆ {α}, Unf(α ∧ ¬ψ) = ∆ {α ∧ ¬ψ}, Unf(ψ ∨ ρ) = ∆ {ψ′ ∨ ρ′ | ψ′ ∈ Unf(ψ), ρ′ ∈ Unf(ρ)}, Unf(ψ ∧ ρ) = ∆ {ψ′ ∧ ρ′

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

fields

cs.LO 1

years

2025 1

verdicts

UNVERDICTED 1

representative citing papers

Guarded Negation Transitive Closure Logic

cs.LO · 2025-01-25 · unverdicted · novelty 7.0

GNTC satisfiability is 2ExpTime-complete and model checking is P^NP[O(log² n)]-complete via polynomial and exponential reductions to UNTC and 2-way alternating parity tree automata.

citing papers explorer

Showing 1 of 1 citing paper.

  • Guarded Negation Transitive Closure Logic cs.LO · 2025-01-25 · unverdicted · none · ref 77

    GNTC satisfiability is 2ExpTime-complete and model checking is P^NP[O(log² n)]-complete via polynomial and exponential reductions to UNTC and 2-way alternating parity tree automata.