Order:
Disambiguations
Samuel R. Buss [33]Sarah Buss [32]Sam Buss [20]S. Buss [6]
Samuel Buss [3]S. . . R. Buss [2]S. R. Buss [1]Stephanie S. Buss [1]
  1. Personal Autonomy.Sarah Buss - 2008 - Stanford Encyclopedia of Philosophy.
    To be autonomous is to be a law to oneself; autonomous agents are self-governing agents. Most of us want to be autonomous because we want to be accountable for what we do, and because it seems that if we are not the ones calling the shots, then we cannot be accountable. More importantly, perhaps, the value of autonomy is tied to the value of self-integration. We don't want to be alien to, or at war with, ourselves; and it seems that (...)
    Direct download  
     
    Export citation  
     
    Bookmark   46 citations  
  2. Autonomous Action: Self-Determination in the Passive Mode.Sarah Buss - 2012 - Ethics 122 (4):647-691.
    In order to be a self-governing agent, a person must govern the process by means of which she acquires the intention to act as she does. But what does governing this process require? The standard compatibilist answers to this question all assume that autonomous actions differ from nonautonomous actions insofar as they are a more perfect expression of the agent’s agency. I challenge this conception of autonomous agents as super agents. The distinguishing feature of autonomous agents is, I argue, the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   24 citations  
  3.  35
    Handbook of Proof Theory.Samuel R. Buss (ed.) - 1998 - 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  
     
    Export citation  
     
    Bookmark   28 citations  
  4. Valuing Autonomy and Respecting Persons: Manipulation, Seduction, and the Basis of Moral Constraints.Sarah Buss - 2005 - Ethics 115 (2):195-235.
  5. Appearing Respectful: The Moral Significance of Manners.Sarah Buss - 1999 - Ethics 109 (4):795-826.
  6. Contours of Agency: Essays on Themes From Harry Frankfurt.Sarah Buss & Lee Overton (eds.) - 2002 - MIT Press, Bradford Books.
    The original essays in this book address Harry Frankfurt's influential writing on personal identity, love, value, moral responsibility, and the freedom and ...
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   20 citations  
  7.  36
    Morality and the Emotions.Sarah Buss - 1994 - Philosophical Review 103 (4):726.
  8. Respect for Persons.Sarah Buss - 1999 - Canadian Journal of Philosophy 29 (4):517-550.
    We believe we owe one another respect. We believe we ought to pay what we owe by treating one another ‘with respect.’ If we could understand these beliefs we would be well on the way to understanding morality itself. If we could justify these beliefs we could vindicate a central part of our moral experience.Respect comes in many varieties. We respect some people for their upright character, others for their exceptional achievements. There are people we respect as forces of nature: (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   26 citations  
  9. Weakness of Will.Sarah Buss - 1997 - Pacific Philosophical Quarterly 78 (1):13–44.
    My chief aim is to explain how someone can act freely against her own best judgment. But I also have a second aim: to defend a conception of practical rationality according to which someone cannot do something freely if she believes it would be better to do something else. These aims may appear incompatible. But I argue that practical reason has the capacity to undermine itself in such a way that it produces reasons for behaving irrationally. Weakness of will is (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   17 citations  
  10.  21
    Practical Induction.Sarah Buss - 1999 - Philosophical Review 108 (4):571.
    I wish more books of philosophy were like this one. It is elegantly written. It is filled with provocative claims and ingenious arguments. It is a really good read, even while it forces us to rethink many of our assumptions about practical reason and practical reasoning, morality and agency.
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   23 citations  
  11.  22
    Polynomial Size Proofs of the Propositional Pigeonhole Principle.Samuel R. Buss - 1987 - 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 (8 more)  
     
    Export citation  
     
    Bookmark   26 citations  
  12. Needs , Projects , and Reasons.Sarah Buss - 2006 - Journal of Philosophy 103 (8):373-402.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  13. Autonomy Reconsidered.Sarah Buss - 1994 - Midwest Studies in Philosophy 19 (1):95-121.
  14. What Practical Reasoning Must Be If We Act for Our Own Reasons.Sarah Buss - 1999 - Australasian Journal of Philosophy 77 (4):399 – 421.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  15.  18
    Intuitionistic Validity in T-Normal Kripke Structures.Samuel R. Buss - 1993 - Annals of Pure and Applied Logic 59 (3):159-173.
    Let T be a first-order theory. A T-normal Kripke structure is one in which every world is a classical model of T. This paper gives a characterization of the intuitionistic theory T of sentences intuitionistically valid in all T-normal Kripke structures and proves the corresponding soundness and completeness theorems. For Peano arithmetic , the theory PA is a proper subtheory of Heyting arithmetic , so HA is complete but not sound for PA-normal Kripke structures.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  16. Justified Wrongdoing.Sarah Buss - 1997 - Noûs 31 (3):337-369.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  17. 10. Nicholas Rescher, Objectivity: The Obligations of Impersonal Reason Nicholas Rescher, Objectivity: The Obligations of Impersonal Reason (Pp. 917-919). [REVIEW]Tamar Schapiro, A. John Simmons, Seana Valentine Shiffrin, Sarah Buss, Julia Driver, G. F. Schueler, James Montmarquet, Mark van Roojen & Samantha Brennan - 1999 - Ethics 109 (4).
  18.  6
    Relating the Bounded Arithmetic and Polynomial Time Hierarchies.Samuel R. Buss - 1995 - Annals of Pure and Applied Logic 75 (1-2):67-77.
    The bounded arithmetic theory S2 is finitely axiomatized if and only if the polynomial hierarchy provably collapses. If T2i equals S2i + 1 then T2i is equal to S2 and proves that the polynomial time hierarchy collapses to ∑i + 3p, and, in fact, to the Boolean hierarchy over ∑i + 2p and to ∑i + 1p/poly.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   20 citations  
  19.  57
    On Gödel's Theorems on Lengths of Proofs I: Number of Lines and Speedup for Arithmetics.Samuel R. Buss - 1994 - 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 (9 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  20.  20
    Fragments of Approximate Counting.Samuel R. Buss, Leszek Aleksander Kołodziejczyk & Neil Thapen - 2014 - Journal of Symbolic Logic 79 (2):496-525.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  21.  29
    Polynomial Local Search in the Polynomial Hierarchy and Witnessing in Fragments of Bounded Arithmetic.Arnold Beckmann & Samuel R. Buss - 2009 - Journal of Mathematical Logic 9 (1):103-138.
    The complexity class of [Formula: see text]-polynomial local search problems is introduced and is used to give new witnessing theorems for fragments of bounded arithmetic. For 1 ≤ i ≤ k + 1, the [Formula: see text]-definable functions of [Formula: see text] are characterized in terms of [Formula: see text]-PLS problems. These [Formula: see text]-PLS problems can be defined in a weak base theory such as [Formula: see text], and proved to be total in [Formula: see text]. Furthermore, the [Formula: (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  22. The Value of Humanity.Sarah Buss - 2012 - Journal of Philosophy 109 (5-6):341-377.
  23.  22
    Unprovability of Consistency Statements in Fragments of Bounded Arithmetic.Samuel R. Buss & Aleksandar Ignjatović - 1995 - 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 (11 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  24.  41
    The Modal Logic of Pure Provability.Samuel R. Buss - 1990 - Notre Dame Journal of Formal Logic 31 (2):225-231.
  25.  20
    Safe Recursive Set Functions.Arnold Beckmann, Samuel R. Buss & Sy-David Friedman - 2015 - Journal of Symbolic Logic 80 (3):730-762.
  26.  11
    Propositional Consistency Proofs.Samuel R. Buss - 1991 - Annals of Pure and Applied Logic 52 (1-2):3-29.
    Partial consistency statements can be expressed as polynomial-size propositional formulas. Frege proof systems have polynomial-size partial self-consistency proofs. Frege proof systems have polynomial-size proofs of partial consistency of extended Frege proof systems if and only if Frege proof systems polynomially simulate extended Frege proof systems. We give a new proof of Reckhow's theorem that any two Frege proof systems p-simulate each other. The proofs depend on polynomial size propositional formulas defining the truth of propositional formulas. These are already known to (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  27.  14
    On the Computational Content of Intuitionistic Propositional Proofs.Samuel R. Buss & Pavel Pudlák - 2001 - Annals of Pure and Applied Logic 109 (1-2):49-64.
    The paper proves refined feasibility properties for the disjunction property of intuitionistic propositional logic. We prove that it is possible to eliminate all cuts from an intuitionistic proof, propositional or first-order, without increasing the Horn closure of the proof. We obtain a polynomial time, interactive, realizability algorithm for propositional intuitionistic proofs. The feasibility of the disjunction property is proved for sequents containing Harrop formulas. Under hardness assumptions for NP and for factoring, it is shown that the intuitionistic propositional calculus does (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  28.  53
    Some Remarks on Lengths of Propositional Proofs.Samuel R. Buss - 1995 - 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 (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  29.  15
    The Complexity of the Disjunction and Existential Properties in Intuitionistic Logic.Sam Buss & Grigori Mints - 1999 - Annals of Pure and Applied Logic 99 (1-3):93-104.
    This paper considers the computational complexity of the disjunction and existential properties of intuitionistic logic. We prove that the disjunction property holds feasibly for intuitionistic propositional logic; i.e., from a proof of A v B, a proof either of A or of B can be found in polynomial time. For intuitionistic predicate logic, we prove superexponential lower bounds for the disjunction property, namely, there is a superexponential lower bound on the time required, given a proof of A v B, to (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  30.  41
    The Prospects for Mathematical Logic in the Twenty-First Century.Samuel R. Buss, Alexander S. Kechris, Anand Pillay & Richard A. Shore - 2001 - 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 (12 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  31.  18
    Separation Results for the Size of Constant-Depth Propositional Proofs.Arnold Beckmann & Samuel R. Buss - 2005 - Annals of Pure and Applied Logic 136 (1-2):30-55.
    This paper proves exponential separations between depth d-LK and depth -LK for every utilizing the order induction principle. As a consequence, we obtain an exponential separation between depth d-LK and depth -LK for . We investigate the relationship between the sequence-size, tree-size and height of depth d-LK-derivations for , and describe transformations between them. We define a general method to lift principles requiring exponential tree-size -LK-refutations for to principles requiring exponential sequence-size d-LK-refutations, which will be described for the Ramsey principle (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  32.  70
    Bounded Arithmetic, Cryptography and Complexity.Samuel R. Buss - 1997 - Theoria 63 (3):147-167.
  33.  60
    The Deduction Rule and Linear and Near-Linear Proof Simulations.Maria Luisa Bonet & Samuel R. Buss - 1993 - 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 (8 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  34.  33
    Strong Isomorphism Reductions in Complexity Theory.Sam Buss, Yijia Chen, Jörg Flum, Sy-David Friedman & Moritz Müller - 2011 - 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 (7 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  35.  43
    Pool Resolution is NP-Hard to Recognize.Samuel R. Buss - 2009 - 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.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  36.  64
    Accountability, Integrity, Authenticity, and Self-Legislation: Reflections on Ruediger Bittner’s Reflections on Autonomy. [REVIEW]Sarah Buss - 2014 - Erkenntnis 79 (S7):1-14.
    In this paper I consider three widespread assumptions: (1) the assumption that we are accountable for our intentional actions only if they are in some special sense ours; (2) the assumption that it is possible for us to be more or less “true to” ourselves, and that we are flawed human beings to the extent that we lack “integrity”; and (3) the assumption that we can sometimes give ourselves reasons by giving ourselves commands. I acknowledge that, as Ruediger Bittner has (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  37.  57
    Experiments In Vivo, In Vitro, and In Cathedra.Sarah Buss - 2014 - Ethics 124 (4):860-881.
    In the context of a largely exploratory inquiry, I warn against oversimplifying the relationships among intuitions, emotions, principle-governed reasoning, and responsiveness to reasons. I point out that one cannot determine the normative status of some fact without determining whether a case can be made for this status. But I also note that, though reason is thus autonomous, every episode of reasoning depends causally on the way things nonnormatively are, and this makes it possible for any reasoner to challenge even her (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  38. The Irrationality of Unhappiness and the Paradox of Despair.Sarah Buss - 2004 - Journal of Philosophy 101 (4):167 - 196.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  39. Minimum Propositional Proof Length is NP-Hard to Linearly Approximate.Michael Alekhnovich, Sam Buss, Shlomo Moran & Toniann Pitassi - 2001 - 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 (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  40.  2
    Uniform Proofs of ACC Representations.Sam Buss - 2017 - Archive for Mathematical Logic 56 (5-6):639-669.
    We give a uniform proof of the theorems of Yao and Beigel–Tarui representing ACC predicates as constant depth circuits with MODm\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\hbox {MOD}_{m}$$\end{document} gates and a symmetric gate. The proof is based on a relativized, generalized form of Toda’s theorem expressed in terms of closure properties of formulas under bounded universal, existential and modular counting quantifiers. This allows the main proofs to be expressed in terms of formula classes instead of Boolean circuits. (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  41. Contours of Agency: Essays for Harry Frankfurt.Sarah Buss & Lee Overton (eds.) - 2002 - MIT Press.
     
    Export citation  
     
    Bookmark   2 citations  
  42.  47
    Cutting Planes, Connectivity, and Threshold Logic.Samuel R. Buss & Peter Clote - 1996 - 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 (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  43.  33
    Propositional Proofs and Reductions Between NP Search Problems.Samuel R. Buss & Alan S. Johnson - 2012 - Annals of Pure and Applied Logic 163 (9):1163-1182.
  44.  27
    The Quantifier Complexity of Polynomial‐Size Iterated Definitions in First‐Order Logic.Samuel R. Buss & Alan S. Johnson - 2010 - Mathematical Logic Quarterly 56 (6):573-590.
    We refine the constructions of Ferrante-Rackoff and Solovay on iterated definitions in first-order logic and their expressibility with polynomial size formulas. These constructions introduce additional quantifiers; however, we show that these extra quantifiers range over only finite sets and can be eliminated. We prove optimal upper and lower bounds on the quantifier complexity of polynomial size formulas obtained from the iterated definitions. In the quantifier-free case and in the case of purely existential or universal quantifiers, we show that Ω quantifiers (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  45.  94
    Book ReviewsRichard. Moran, Authority and Estrangement: An Essay on Self‐Knowledge. Princeton, N.J.: Princeton University Press, 2001. Pp. 202. $16.95. [REVIEW]Sarah Buss - 2003 - Ethics 113 (4):898-902.
  46.  7
    Respect for Persans.Sarah Buss - 1999 - Canadian Journal of Philosophy 29 (4):517-550.
    We believe we owe one another respect. We believe we ought to pay what we owe by treating one another ‘with respect.’ If we could understand these beliefs we would be well on the way to understanding morality itself. If we could justify these beliefs we could vindicate a central part of our moral experience.Respect comes in many varieties. We respect some people for their upright character, others for their exceptional achievements. There are people we respect as forces of nature: (...)
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  47.  17
    Ordinal Notations and Well-Orderings in Bounded Arithmetic.Arnold Beckmann, Chris Pollett & Samuel R. Buss - 2003 - Annals of Pure and Applied Logic 120 (1-3):197-223.
    This paper investigates provability and non-provability of well-foundedness of ordinal notations in weak theories of bounded arithmetic. We define a notion of well-foundedness on bounded domains. We show that T21 and S22 can prove the well-foundedness on bounded domains of the ordinal notations below 0 and Γ0. As a corollary, the class of polynomial local search problems, PLS, can be augmented with cost functions that take ordinal values below 0 and Γ0 without increasing the class PLS.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  48.  12
    Ordinal Notations and Well-Orderings in Bounded Arithmetic (Vol 120, Pg 197, 2003).Arnold Beckmann, Samuel R. Buss & Chris Pollett - 2003 - Annals of Pure and Applied Logic 123 (1-3):291-291.
    This paper investigates provability and non-provability of well-foundedness of ordinal notations in weak theories of bounded arithmetic. We define a notion of well-foundedness on bounded domains. We show that T21 and S22 can prove the well-foundedness on bounded domains of the ordinal notations below 0 and Γ0. As a corollary, the class of polynomial local search problems, PLS, can be augmented with cost functions that take ordinal values below 0 and Γ0 without increasing the class PLS.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  49.  19
    Quasipolynomial Size Frege Proofs of Frankl’s Theorem on the Trace of Sets.James Aisenberg, Maria Luisa Bonet & Sam Buss - 2016 - Journal of Symbolic Logic 81 (2):687-710.
    We extend results of Bonet, Buss and Pitassi on Bondy’s Theorem and of Nozaki, Arai and Arai on Bollobás’ Theorem by proving that Frankl’s Theorem on the trace of sets has quasipolynomial size Frege proofs. For constant values of the parametert, we prove that Frankl’s Theorem has polynomial size AC0-Frege proofs from instances of the pigeonhole principle.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  50.  15
    Computability in Europe 2009.Klaus Ambos-Spies, Arnold Beckmann, Samuel R. Buss & Benedikt Löwe - 2012 - Annals of Pure and Applied Logic 163 (5):483-484.
1 — 50 / 92