Unprovability of Lower Bounds on Circuit Size in Certain Fragments of Bounded Arithmetic

Izvestiya Mathematics - United Kingdom
doi 10.1070/im1995v059n01abeh000009
Full Text
Abstract

Available in full text

Categories
Mathematics
Date
Authors
Publisher

IOP Publishing

Related search

On Bounded Arithmetic Augmented by the Ability to Count Certain Sets of Primes

Journal of Symbolic Logic
PhilosophyLogic
2009English

Tensor-Rank and Lower Bounds for Arithmetic Formulas

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
2013English

Lower Bounds for the Unknotting Numbers of Certain Torus Knots

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1982English

On a Certain Class of Arithmetic Functions

2016English

Lower Bounds to Processor-Time Tradeoffs Under Bounded-Speed Message Propagation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1995English

On Extensions of Models of Strong Fragments of Arithmetic

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1990English

On Certain Subclasses of Bounded Univalent Functions

Annales Polonici Mathematici
Mathematics
1991English

Models of Arithmetic and Upper Bounds for Arithmetic Sets

Journal of Symbolic Logic
PhilosophyLogic
1994English

On Lower Bounds of Exponential Frames

Journal of Fourier Analysis and Applications
MathematicsApplied MathematicsAnalysis
1999English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy