Sciweavers

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

29

LOGCOM
2006

favoriteEmaildiscussreport

50views more LOGCOM 2006»

An Independence Result for Intuitionistic Bounded Arithmetic

13 years 10 months ago

An Independence Result for Intuitionistic Bounded Arithmetic

Download math.ipm.ac.ir

Morteza Moniri

Real-time Traffic

LOGCOM 2006 |

claim paper

Related Content

» The minimal edegree problem in fragments of Peano arithmetic

» Quaternary Arithmetic Logic Unit on a Programmable Logic Device

» Affine Arithmetic Based Estimation of Cue Distributions in Deformable Model Tracking

» Optimal Size Integer Division Circuits

» Combinatorics with definable sets Euler characteristics and Grothendieck rings

» Assisted verification of elementary functions using Gappa

» Two Algorithms for the Minimum Enclosing Ball Problem

» Fair Noiseless Broadcast Source Coding

» Linear Systems over Composite Moduli

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2006
Where	LOGCOM
Authors	Morteza Moniri

Comments (0)