Skip to Content.
Sympa Menu

coq-club - Re: [Coq-Club] ring tactic: boolean rings and completeness when supplied with equalities

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

Re: [Coq-Club] ring tactic: boolean rings and completeness when supplied with equalities


Chronological Thread 
  • From: Abhishek Anand <abhishek.anand.iitg AT gmail.com>
  • To: coq-club <coq-club AT inria.fr>
  • Subject: Re: [Coq-Club] ring tactic: boolean rings and completeness when supplied with equalities
  • Date: Fri, 15 Apr 2016 19:36:12 -0400
  • Authentication-results: mail2-smtp-roc.national.inria.fr; spf=None smtp.pra=abhishek.anand.iitg AT gmail.com; spf=Pass smtp.mailfrom=abhishek.anand.iitg AT gmail.com; spf=None smtp.helo=postmaster AT mail-yw0-f170.google.com
  • Ironport-phdr: 9a23:UyewXRZyY/8M0MqCxzTulN3/LSx+4OfEezUN459isYplN5qZpcmybnLW6fgltlLVR4KTs6sC0LqG9f2wEjZeqb+681k8M7V0HycfjssXmwFySOWkMmbcaMDQUiohAc5ZX0Vk9XzoeWJcGcL5ekGA6ibqtW1aJBzzOEJPK/jvHcaK1oLsh7D0ps2YOVsArQH+SI0xBS3+lR/WuMgSjNkqAYcK4TyNnEF1ff9Lz3hjP1OZkkW0zM6x+Jl+73YY4Kp5pIYTGZn9Kq8/VPlTCCksezQ+49Suvh3eRyOO4GEdWyMYiEwbLRLC6UTTVJfwqSv3taJU3iCcMYWiRLo0WC+i4qQtQRnhjitBNj8l/0nYj8VxiORQpxf39E83+JLdfIzAbKk2RajaZ95PHWc=

Thanks, Daniel, Pierre-Marie, and Laurent.

I am missing one piece of the puzzle.
My boolean ring (say B) has infinitely many elements.
How do I justify changing the types of the variables from B to bool, or to Z/2Z?

More formally, How do I prove:
(forall (b1 b2 ... bn : B), h1l=h1r -> h2l=h2r ->..... hml=hmr -> cl=cr)
<->(forall (b1 b2 ... bn : bool), h1l=h1r -> h2l=h2r ->..... hml=hmr -> cl=cr),

where hil, hir, cl and cr are ring expressions over the variables bi.

Thanks,
-- Abhishek

On Fri, Apr 15, 2016 at 6:24 AM, Laurent Thery <Laurent.Thery AT inria.fr> wrote:
Maybe I am missing something here but as

x = y can be encoded as x + y + 1
and
x -> y as x * y + y + 1

Oops

x * y + x + 1





Archive powered by MHonArc 2.6.18.

Top of Page