Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

hooo_dual_imply is too strong (c^(a => b) => ¬(c^b => c^a)) #579

Closed
bvssvni opened this issue Nov 22, 2022 · 2 comments · Fixed by #595
Closed

hooo_dual_imply is too strong (c^(a => b) => ¬(c^b => c^a)) #579

bvssvni opened this issue Nov 22, 2022 · 2 comments · Fixed by #595
Assignees
Labels

Comments

@bvssvni
Copy link
Contributor

bvssvni commented Nov 22, 2022

pub fn proof<A: Prop, B: Prop>(
    pow_ba: Pow<B, A>,
    pow_bna: Pow<B, Not<A>>
) -> False {
    pow_rev_not(pow_bna)(pow_ba)
}

pub fn proof2() -> False {
    fn f(_: Or<True, Not<True>>) -> True {True}
    let (a, b) = hooo_dual_or(f);
    proof(a, b)
}

Here, hooo_dual_or has a trusted proof:

/// `c^(a ⋁ b) => (c^a ⋀ c^b)`.
pub fn hooo_dual_or<A: Prop, B: Prop, C: Prop>(
    x: Pow<C, Or<A, B>>
) -> And<Pow<C, A>, Pow<C, B>> {
    (pow_transitivity(Left, x.clone()), pow_transitivity(Right, x))
}

The only weakness is hooo_dual_imply, used in pow_rev_not:

/// `a^(¬b) => ¬a^b`.
pub fn pow_rev_not<A: Prop, B: Prop>(x: Pow<A, Not<B>>) -> Not<Pow<A, B>> {
    let y = hooo_dual_imply(x);
    Rc::new(move |pow_a_b| {
        y(pow_a_b.map_any())
    })
}
@bvssvni
Copy link
Contributor Author

bvssvni commented Nov 22, 2022

This undermines the dual axiom scheme for HOOO EP.

@bvssvni
Copy link
Contributor Author

bvssvni commented Dec 19, 2022

This also implies tauto_hooo_dual_imply is too strong, since tauto_hooo_dual_imply implies hooo_dual_imply.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Projects
None yet
Development

Successfully merging a pull request may close this issue.

1 participant