Difficulty of Presburger over the reals

Thread View: sci.logic

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by Bill Pugh Tue, 06 Oct 1992 22:26

#465

Author: Bill Pugh
Date: Tue, 06 Oct 1992 22:26

20 lines
1119 bytes

I'm looking at some problems that involve producing constructive
proofs for Presburger-like formulas, except over the reals, not
over integers. 

Questions:

  * Is there a better name for this class of formulas other than 
	"Presburger over the reals"

  * Any pointers to algorithms or upper bounds for either verifying
	such formulas or producing constructive proofs?

We actually don't need full Presburger over the reals, but we do need
to deal with formulas that have an arbitrary number of alternating 
quantifiers. If there are any methods that work for subsets of Presburger 
that allow an arbitrary number of alternating quantifiers, that would be 
of interest as well.

  Thanks,
    Bill Pugh

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads