Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

AML
2007

favoriteEmaildiscussreport

87views more AML 2007»

Preservation theorems for bounded formulas

13 years 4 months ago

Preservation theorems for bounded formulas

Download math.ipm.ac.ir

In this paper we naturally deﬁne when a theory has bounded quantiﬁer elimination, or is bounded model complete. We give several equivalent conditions for a theory to have each of these properties. These results provide simple proofs for some known results in the model theory of the bounded arithmetic theories like

Morteza Moniri

Real-time Traffic

AML 2007 | Model Complete | Quantiﬁer Elimination | Theory |

claim paper

Related Content

» On Preservation under Homomorphisms and Unions of Conjunctive Queries

» Model Theory Makes Formulas Large

» On Herbrands Theorem

» Lazy Theorem Proving for Bounded Model Checking over Infinite Domains

» Generating Text with a Theorem Prover

» Monotonicity and Persistence in Preferential Logics

» Fibring Modal FirstOrder Logics Completeness Preservation

» A finiteness theorem for Markov bases of hierarchical models

» Logspace Versions of the Theorems of Bodlaender and Courcelle

Post Info
More Details (n/a)

Added	08 Dec 2010
Updated	08 Dec 2010
Type	Journal
Year	2007
Where	AML
Authors	Morteza Moniri

Comments (0)