39 found
Sort by:
Disambiguations:
Samuel R. Buss [27]Sam Buss [10]Samuel Buss [2]
  1. Sam Buss, Benedikt Löwe, Dag Normann & Ivan Soskov (2013). Computability in Europe 2011. Annals of Pure and Applied Logic 164 (5):509-510.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  2. Sam Buss & Mia Minnes (2013). Probabilistic Algorithmic Randomness. Journal of Symbolic Logic 78 (2):579-601.
    We introduce martingales defined by probabilistic strategies, in which randomness is used to decide whether to bet. We show that different criteria for the success of computable probabilistic strategies can be used to characterize ML-randomness, computable randomness, and partial computable randomness. Our characterization of ML-randomness partially addresses a critique of Schnorr by formulating ML randomness in terms of a computable process rather than a computably enumerable function.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  3. Klaus Ambos-Spies, Arnold Beckmann, Samuel R. Buss & Benedikt Löwe (2012). Computability in Europe 2009. Annals of Pure and Applied Logic 163 (5):483-484.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  4. Sam Buss (2012). REVIEWS-J. Krajíček, Forcing with Random Variables and Proof Complexity. Bulletin of Symbolic Logic 18 (4):576.
     
    My bibliography  
     
    Export citation  
  5. Samuel R. Buss (2012). Sharpened Lower Bounds for Cut Elimination. Journal of Symbolic Logic 77 (2):656-668.
    We present sharpened lower bounds on the size of cut free proofs for first-order logic. Prior lower bounds for eliminating cuts from a proof established superexponential lower bounds as a stack of exponentials, with the height of the stack proportional to the maximum depth d of the formulas in the original proof. Our results remove the constant of proportionality, giving an exponential stack of height equal to d — 0(1). The proof method is based on more efficiently expressing the Gentzen-Solovay (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  6. Samuel R. Buss (2012). Towards–Via Proof Complexity and Search. Annals of Pure and Applied Logic 163 (7):906-917.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  7. Samuel R. Buss & Alan S. Johnson (2012). Propositional Proofs and Reductions Between NP Search Problems. Annals of Pure and Applied Logic 163 (9):1163-1182.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  8. Samuel R. Buss & Roman Kuznets (2012). Lower Complexity Bounds in Justification Logic. Annals of Pure and Applied Logic 163 (7):888-905.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  9. Sam Buss, Yijia Chen, Jörg Flum, Sy-David Friedman & Moritz Müller (2011). Strong Isomorphism Reductions in Complexity Theory. Journal of Symbolic Logic 76 (4):1381-1402.
    We give the first systematic study of strong isomorphism reductions, a notion of reduction more appropriate than polynomial time reduction when, for example, comparing the computational complexity of the isomorphim problem for different classes of structures. We show that the partial ordering of its degrees is quite rich. We analyze its relationship to a further type of reduction between classes of structures based on purely comparing for every n the number of nonisomorphic structures of cardinality at most n in both (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  10. Samuel R. Buss & Alan S. Johnson (2010). The Quantifier Complexity of Polynomial‐Size Iterated Definitions in First‐Order Logic. Mathematical Logic Quarterly 56 (6):573-590.
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  11. Arnold Beckmann & Samuel R. Buss (2009). Polynomial Local Search in the Polynomial Hierarchy and Witnessing in Fragments of Bounded Arithmetic. Journal of Mathematical Logic 9 (01):103-138.
  12. Samuel R. Buss (2009). Pool Resolution is NP-Hard to Recognize. Archive for Mathematical Logic 48 (8):793-798.
    A pool resolution proof is a dag-like resolution proof which admits a depth-first traversal tree in which no variable is used as a resolution variable twice on any branch. The problem of determining whether a given dag-like resolution proof is a valid pool resolution proof is shown to be NP-complete.
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  13. Samuel R. Buss, S. Barry Cooper, Benedikt Löwe & Andrea Sorbi (2009). Preface. Annals of Pure and Applied Logic 160 (3):229-230.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  14. Sam Buss, Stephen Cook, José Ferreirós, David Marker, Theodore Slaman & Jamie Tappenden (2008). University of California, Irvine Irvine, California March 27–30, 2008. Bulletin of Symbolic Logic 14 (3).
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  15. Sam Buss, Stephen Cook, Jos Ferreirs, Andy Lewis, David Marker, Theodore Slaman & Jamie Tappenden (2008). 2008 Annual Meeting of the Association for Symbolic Logic-University of California, Irvine-Irvine, California-March 27-30, 2008-Abstracts. [REVIEW] Bulletin of Symbolic Logic 14 (3).
     
    My bibliography  
     
    Export citation  
  16. Arnold Beckmann & Samuel R. Buss (2005). Separation Results for the Size of Constant-Depth Propositional Proofs. Annals of Pure and Applied Logic 136 (1-2):30-55.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  17. Arnold Beckmann, Samuel R. Buss & Chris Pollett (2003). Erratum to “Ordinal Notations and Well-Orderings in Bounded Arithmetic” [Annals of Pure and Applied Logic 120 (2003) 197–223]. [REVIEW] Annals of Pure and Applied Logic 123 (1-3):291.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  18. Arnold Beckmann, Chris Pollett & Samuel R. Buss (2003). Ordinal Notations and Well-Orderings in Bounded Arithmetic. Annals of Pure and Applied Logic 120 (1-3):197-223.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  19. Michael Alekhnovich, Sam Buss, Shlomo Moran & Toniann Pitassi (2001). Minimum Propositional Proof Length is NP-Hard to Linearly Approximate. Journal of Symbolic Logic 66 (1):171-191.
    We prove that the problem of determining the minimum propositional proof length is NP- hard to approximate within a factor of 2 log 1 - o(1) n . These results are very robust in that they hold for almost all natural proof systems, including: Frege systems, extended Frege systems, resolution, Horn resolution, the polynomial calculus, the sequent calculus, the cut-free sequent calculus, as well as the polynomial calculus. Our hardness of approximation results usually apply to proof length measured either by (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  20. Samuel R. Buss, Alexander S. Kechris, Anand Pillay & Richard A. Shore (2001). The Prospects for Mathematical Logic in the Twenty-First Century. Bulletin of Symbolic Logic 7 (2):169-196.
    The four authors present their speculations about the future developments of mathematical logic in the twenty-first century. The areas of recursion theory, proof theory and logic for computer science, model theory, and set theory are discussed independently.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  21. Samuel R. Buss & Pavel Pudlák (2001). On the Computational Content of Intuitionistic Propositional Proofs. Annals of Pure and Applied Logic 109 (1-2):49-64.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  22. Sergei Artemov, Sam Buss, Edmund Clarke Jr, Heinz Dieter Ebbinghaus, Hans Kamp, Phokion Kolaitis, Maarten de Rijke & Valeria de Paiva (1999). University of Sao Paulo (Sao Paulo), Brazil, July 28–31, 1998. Bulletin of Symbolic Logic 5 (3).
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  23. Sam Buss (1999). 1998-99 Annual Meeting of the Association for Symbolic Logic. Bulletin of Symbolic Logic 5 (3).
    Direct download  
     
    My bibliography  
     
    Export citation  
  24. Sam Buss & Grigori Mints (1999). The Complexity of the Disjunction and Existential Properties in Intuitionistic Logic. Annals of Pure and Applied Logic 99 (1-3):93-104.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  25. Samuel R. Buss (1999). Bounded Arithmetic, Proof Complexity and Two Papers of Parikh. Annals of Pure and Applied Logic 96 (1-3):43-55.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  26. Samuel R. Buss (ed.) (1998). Handbook of Proof Theory. Elsevier.
    This volume contains articles covering a broad spectrum of proof theory, with an emphasis on its mathematical aspects. The articles should not only be interesting to specialists of proof theory, but should also be accessible to a diverse audience, including logicians, mathematicians, computer scientists and philosophers. Many of the central topics of proof theory have been included in a self-contained expository of articles, covered in great detail and depth. The chapters are arranged so that the two introductory articles come first; (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  27. Samuel R. Buss (1997). Bounded Arithmetic, Cryptography and Complexity. Theoria 63 (3):147-167.
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  28. Samuel R. Buss & Peter Clote (1996). Cutting Planes, Connectivity, and Threshold Logic. Archive for Mathematical Logic 35 (1):33-62.
    Originating from work in operations research the cutting plane refutation systemCP is an extension of resolution, where unsatisfiable propositional logic formulas in conjunctive normal form are recognized by showing the non-existence of boolean solutions to associated families of linear inequalities. Polynomial sizeCP proofs are given for the undirecteds-t connectivity principle. The subsystemsCP q ofCP, forq≥2, are shown to be polynomially equivalent toCP, thus answering problem 19 from the list of open problems of [8]. We present a normal form theorem forCP (...)
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  29. Samuel R. Buss (1995). Relating the Bounded Arithmetic and Polynomial Time Hierarchies. Annals of Pure and Applied Logic 75 (1-2):67-77.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  30. Samuel R. Buss (1995). Some Remarks on Lengths of Propositional Proofs. Archive for Mathematical Logic 34 (6):377-394.
    We survey the best known lower bounds on symbols and lines in Frege and extended Frege proofs. We prove that in minimum length sequent calculus proofs, no formula is generated twice or used twice on any single branch of the proof. We prove that the number of distinct subformulas in a minimum length Frege proof is linearly bounded by the number of lines. Depthd Frege proofs ofm lines can be transformed into depthd proofs ofO(m d+1) symbols. We show that renaming (...)
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  31. Samuel R. Buss & Aleksandar Ignjatović (1995). Unprovability of Consistency Statements in Fragments of Bounded Arithmetic. Annals of Pure and Applied Logic 74 (3):221-244.
    Samuel R. Buss and Aleksandar Ignjatović. Unprovability of Consistency Statements in Fragments of Bounded Arithmetic.
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  32. Samuel R. Buss (1994). On Gödel's Theorems on Lengths of Proofs I: Number of Lines and Speedup for Arithmetics. Journal of Symbolic Logic 59 (3):737-756.
    This paper discusses lower bounds for proof length, especially as measured by number of steps (inferences). We give the first publicly known proof of Gödel's claim that there is superrecursive (in fact. unbounded) proof speedup of (i + 1)st-order arithmetic over ith-order arithmetic, where arithmetic is formalized in Hilbert-style calculi with + and · as function symbols or with the language of PRA. The same results are established for any weakly schematic formalization of higher-order logic: this allows all tautologies as (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  33. Maria Luisa Bonet & Samuel R. Buss (1993). The Deduction Rule and Linear and Near-Linear Proof Simulations. Journal of Symbolic Logic 58 (2):688-709.
    We introduce new proof systems for propositional logic, simple deduction Frege systems, general deduction Frege systems, and nested deduction Frege systems, which augment Frege systems with variants of the deduction rule. We give upper bounds on the lengths of proofs in Frege proof systems compared to lengths in these new systems. As applications we give near-linear simulations of the propositional Gentzen sequent calculus and the natural deduction calculus by Frege proofs. The length of a proof is the number of lines (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  34. Samuel R. Buss (1993). Intuitionistic Validity in T-Normal Kripke Structures. Annals of Pure and Applied Logic 59 (3):159-173.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  35. Samuel R. Buss (1991). Propositional Consistency Proofs. Annals of Pure and Applied Logic 52 (1-2):3-29.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  36. Samuel R. Buss (1990). The Modal Logic of Pure Provability. Notre Dame Journal of Formal Logic 31 (2):225-231.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  37. Samuel Buss (1989). Immerman Neil. Upper and Lower Bounds for First Order Expressibility. Journal of Computer and System Sciences, Vol. 25 (1982), Pp. 76–98. Immerman Neil. Relational Queries Computable in Polynomial Time. Information and Control, Vol. 68 (1986), Pp. 86–104. Immerman Neil. Languages That Capture Complexity Classes. SIAM Journal on Computing, Vol. 16 (1987), Pp. 760–778. [REVIEW] Journal of Symbolic Logic 54 (1):287-288.
    Direct download  
     
    My bibliography  
     
    Export citation  
  38. Samuel Buss (1989). Review: Neil Immerman, Upper and Lower Bounds for First Order Expressibility; Neil Immerman, Relational Queries Computable in Polynomial Time; Neil Immerman, Languages That Capture Complexity Classes. [REVIEW] Journal of Symbolic Logic 54 (1):287-288.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  39. Samuel R. Buss (1987). Polynomial Size Proofs of the Propositional Pigeonhole Principle. Journal of Symbolic Logic 52 (4):916-927.
    Cook and Reckhow defined a propositional formulation of the pigeonhole principle. This paper shows that there are Frege proofs of this propositional pigeonhole principle of polynomial size. This together with a result of Haken gives another proof of Urquhart's theorem that Frege systems have an exponential speedup over resolution. We also discuss connections to provability in theories of bounded arithmetic.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation