Results for 'Arnold Beckmann†'

1000+ found
Order:
  1.  17
    Arnold Beckmann and Wolfram Pohlers. Applications of Cut-Free Infinitary Derivations to Generalized Recursion Theory. Annals of Pure and Applied Logic, Vol. 94 , Pp. 7–19. [REVIEW]Dag Normann - 2000 - Bulletin of Symbolic Logic 6 (2):221-222.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  2.  9
    Review: Arnold Beckmann, Wolfram Pohlers, Applications of Cut-Free Infinitary Derivations to Generalized Recursion Theory. [REVIEW]Dag Normann - 2000 - Bulletin of Symbolic Logic 6 (2):221-222.
  3.  11
    Arnold Beckmann. Proving Consistency of Equational Theories in Bounded Arithmetic. The Journal of Symbolic Logic, Vol. 67 , Pp. 279–296. [REVIEW]Chris Pollett - 2003 - Bulletin of Symbolic Logic 9 (1):44-45.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  4.  31
    Stephen Bellantoni and Stephen Cook. A New Recursion-Theoretic Characterization of the Polytime Functions. Computational Complexity, Vol. 2 , Pp. 97–110. - Arnold Beckmann and Andreas Weiermann. A Term Rewriting Characterization of the Polytime Functions and Related Complexity Classes. Archive for Mathematical Logic, Vol. 36 , Pp. 11–30. [REVIEW]Karl-Heinz Niggl - 2000 - Bulletin of Symbolic Logic 6 (3):351-353.
  5.  69
    Dynamic Ordinal Analysis.Arnold Beckmann - 2003 - Archive for Mathematical Logic 42 (4):303-334.
    Dynamic ordinal analysis is ordinal analysis for weak arithmetics like fragments of bounded arithmetic. In this paper we will define dynamic ordinals – they will be sets of number theoretic functions measuring the amount of sΠ b 1(X) order induction available in a theory. We will compare order induction to successor induction over weak theories. We will compute dynamic ordinals of the bounded arithmetic theories sΣ b n (X)−L m IND for m=n and m=n+1, n≥0. Different dynamic ordinals lead to (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  6.  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   6 citations  
  7.  53
    Exact Bounds for Lengths of Reductions in Typed Λ-Calculus.Arnold Beckmann - 2001 - Journal of Symbolic Logic 66 (3):1277-1285.
    We determine the exact bounds for the length of an arbitrary reduction sequence of a term in the typed λ-calculus with β-, ξ- and η-conversion. There will be two essentially different classifications, one depending on the height and the degree of the term and the other depending on the length and the degree of the term.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  8.  18
    Safe Recursive Set Functions.Arnold Beckmann, Samuel R. Buss & Sy-David Friedman - 2015 - Journal of Symbolic Logic 80 (3):730-762.
  9.  13
    Linear Kripke Frames and Gödel Logics.Arnold Beckmann & Norbert Preining - 2007 - Journal of Symbolic Logic 72 (1):26 - 44.
    We investigate the relation between intermediate predicate logics based on countable linear Kripke frames with constant domains and Gödel logics. We show that for any such Kripke frame there is a Gödel logic which coincides with the logic defined by this Kripke frame on constant domains and vice versa. This allows us to transfer several recent results on Gödel logics to logics based on countable linear Kripke frames with constant domains: We obtain a complete characterisation of axiomatisability of logics based (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  10.  34
    Analyzing Godel's T Via Expanded Head Reduction Trees.Arnold Beckmann & Andreas Weiermann - 2000 - Mathematical Logic Quarterly 46 (4):517-536.
    Inspired from Buchholz' ordinal analysis of ID1 and Beckmann's analysis of the simple typed λ-calculus we classify the derivation lengths for Gödel's system T in the λ-formulation.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  11.  29
    A Term Rewriting Characterization of the Polytime Functions and Related Complexity Classes.Arnold Beckmann & Andreas Weiermann - 1996 - Archive for Mathematical Logic 36 (1):11-30.
  12.  17
    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   3 citations  
  13.  30
    Applications of Cut-Free Infinitary Derivations to Generalized Recursion Theory.Arnold Beckmann & Wolfram Pohlers - 1998 - Annals of Pure and Applied Logic 94 (1-3):7-19.
    We prove that the boundedness theorem of generalized recursion theory can be derived from the ω-completeness theorem for number theory. This yields a proof of the boundedness theorem which does not refer to the analytical hierarchy theorem.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  14.  60
    Characterizing the Elementary Recursive Functions by a Fragment of Gödel's T.Arnold Beckmann & Andreas Weiermann - 2000 - Archive for Mathematical Logic 39 (7):475-491.
    Let T be Gödel's system of primitive recursive functionals of finite type in a combinatory logic formulation. Let $T^{\star}$ be the subsystem of T in which the iterator and recursor constants are permitted only when immediately applied to type 0 arguments. By a Howard-Schütte-style argument the $T^{\star}$ -derivation lengths are classified in terms of an iterated exponential function. As a consequence a constructive strong normalization proof for $T^{\star}$ is obtained. Another consequence is that every $T^{\star}$ -representable number-theoretic function is elementary (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  15.  39
    Proving Consistency of Equational Theories in Bounded Arithmetic.Arnold Beckmann† - 2002 - Journal of Symbolic Logic 67 (1):279-296.
    We consider equational theories for functions defined via recursion involving equations between closed terms with natural rules based on recursive definitions of the function symbols. We show that consistency of such equational theories can be proved in the weak fragment of arithmetic S 1 2 . In particular this solves an open problem formulated by TAKEUTI (c.f. [5, p.5 problem 9.]).
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  16.  14
    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  
  17.  10
    Preservation Theorems and Restricted Consistency Statements in Bounded Arithmetic.Arnold Beckmann - 2004 - Annals of Pure and Applied Logic 126 (1-3):255-280.
    We define and study a new restricted consistency notion RCon ∗ for bounded arithmetic theories T 2 j . It is the strongest ∀ Π 1 b -statement over S 2 1 provable in T 2 j , similar to Con in Krajíček and Pudlák, 29) or RCon in Krajı́ček and Takeuti 107). The advantage of our notion over the others is that RCon ∗ can directly be used to construct models of T 2 j . We apply this by (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  18.  10
    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  
  19.  49
    On the Computational Complexity of Cut-Reduction.Klaus Aehlig & Arnold Beckmann - 2010 - Annals of Pure and Applied Logic 161 (6):711-736.
    Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations. Explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all the known results on definable functions of certain such theories can be reobtained in a uniform way.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  20.  29
    A Non-Well-Founded Primitive Recursive Tree Provably Well-Founded for Co-R.E. Sets.Arnold Beckmann - 2002 - Archive for Mathematical Logic 41 (3):251-257.
    We construct by diagonalization a non-well-founded primitive recursive tree, which is well-founded for co-r.e. sets, provable in Σ1 0. It follows that the supremum of order-types of primitive recursive well-orderings, whose well-foundedness on co-r.e. sets is provable in Σ1 0, equals the limit of all recursive ordinals ω1 ck . RID=""ID="" Mathematics Subject Classification (2000): 03B30, 03F15 RID=""ID="" Supported by the Deutschen Akademie der Naturforscher Leopoldina grant #BMBF-LPD 9801-7 with funds from the Bundesministerium für Bildung, Wissenschaft, Forschung und Technologie. RID=""ID="" (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  21.  24
    An Unexpected Separation Result in Linearly Bounded Arithmetic.Arnold Beckmann & Jan Johannsen - 2005 - Mathematical Logic Quarterly 51 (2):191-200.
    The theories Si1 and Ti1 are the analogues of Buss' relativized bounded arithmetic theories in the language where every term is bounded by a polynomial, and thus all definable functions grow linearly in length. For every i, a Σbi+1-formula TOPi, which expresses a form of the total ordering principle, is exhibited that is provable in Si+11 , but unprovable in Ti1. This is in contrast with the classical situation, where Si+12 is conservative over Ti2 w. r. t. Σbi+1-sentences. The independence (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  22.  20
    Computability in Europe 2008.Arnold Beckmann, Costas Dimitracopoulos & Benedikt Löwe - 2010 - Archive for Mathematical Logic 49 (2):119-121.
  23.  6
    Cobham Recursive Set Functions.Arnold Beckmann, Sam Buss, Sy-David Friedman, Moritz Müller & Neil Thapen - 2016 - Annals of Pure and Applied Logic 167 (3):335-369.
  24.  21
    Erratum to “Ordinal Notations and Well-Orderings in Bounded Arithmetic” [Annals of Pure and Applied Logic 120 (2003) 197–223]. [REVIEW]Arnold Beckmann, Samuel R. Buss & Chris Pollett - 2003 - Annals of Pure and Applied Logic 123 (1-3):291.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  25.  11
    Gaisi Takeuti. Incompleteness Theorems and Versus. Logic Colloquium '96, Proceedings of the Colloquium Held in San Sebastián, Spain, July 9–15, 1996, Edited by J. M. Larrazabal, D. Lascar, and G. Mints, Lecture Notes in Logic, No. 12, Springer, Berlin, Heidelberg, New York, Etc., 1998, Pp. 247–261. - Gaisi Takeuti. Gödel Sentences of Bounded Arithmetic. The Journal of Symbolic Logic, Vol. 65 , Pp. 1338–1346. [REVIEW]Arnold Beckmann - 2002 - Bulletin of Symbolic Logic 8 (3):433-435.
  26.  9
    Incompleteness Theorems and S I 2 Versus S I+1 2Godel Sentences of Bounded Arithmetic.Arnold Beckmann & Gaisi Takeuti - 2002 - Bulletin of Symbolic Logic 8 (3):433.
  27.  14
    On Transformations of Constant Depth Propositional Proofs.Arnold Beckmann & Sam Buss - 2019 - Annals of Pure and Applied Logic 170 (10):1176-1187.
    This paper studies the complexity of constant depth propositional proofs in the cedent and sequent calculus. We discuss the relationships between the size of tree-like proofs, the size of dag-like proofs, and the heights of proofs. The main result is to correct a proof construction in an earlier paper about transformations from proofs with polylogarithmic height and constantly many formulas per cedent.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  28.  17
    Preface.Arnold Beckmann, Jeremy Avigad & Georg Moser - 2005 - Annals of Pure and Applied Logic 136 (1-2):1-2.
  29.  20
    16th Workshop on Logic, Language, Information and Computation (WoLLIC 2009).Hans Tompits, Ken Satoh, Arnold Beckmann, Carlos Caleiro, Thomas Eiter, Sylvain Salvati, Taisuke Sato & Frank Wolter - 2010 - Bulletin of Symbolic Logic 16 (1):805-815.
  30.  9
    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.
  31.  10
    2002 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium'02.Lev D. Beklemishev, Stephen Cook, Olivier Lessmann, Simon Thomas, Jeremy Avigad, Arnold Beckmann, Tim Carlson, Robert L. Constable & Kosta Došen - 2003 - Bulletin of Symbolic Logic 9 (1):71.
  32.  26
    Matthew Arnold.Matthew Arnold & James Gribble - 1967 - Collier-Macmillan Macmillan.
  33.  24
    Matthew Arnold.Marjorie Cruickshank, James Gribble & Matthew Arnold - 1968 - British Journal of Educational Studies 16 (2):214.
  34.  13
    Aesthetics and the Theory of Criticism: Selected Essays of Arnold Isenberg.Arnold Isenberg - 1988 - University of Chicago Press.
    "These sixteen essays by Arnold Isenberg "bring wide-ranging connoiseurship, intricate analysis, and epigrammatic literacy to bear on a number of glib and fuzzy oppositions between form and content, description and interpretation, ...
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  35.  8
    Lettre de M. Arnold reymond, professeur à l'université de lausanne.Arnold Reymond - 1945 - Revue de Métaphysique et de Morale 50 (1/2):8 - 11.
    No categories
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  36.  35
    Moral Commitments and the Societal Role of Business.Markus Beckmann - 2009 - Business Ethics Quarterly 19 (3):375-401.
    This article introduces an “ordonomic” approach to corporate citizenship. We believe that ordonomics offers a conceptual framework for analyzing both the social structure and the semantics of moral commitments. We claim that such an analysis can provide theoretical guidance for the changing role of business in society, especially in regard to the expectation and trend that businesses take a political role and act as corporate citizens. The systematic raison d’être of corporate citizenship is that business firms can and—judged by the (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   21 citations  
  37.  8
    Rnge, Arnold, Dr. Privatdozent an der Universität Heidelberg. Die Philosophie der Gegenwart. Eine internationale Jahres -ÜbersiehtI. [REVIEW]Arnold Rüge - 1911 - Kant-Studien 16 (1-3).
    No categories
    Direct download (4 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  38.  4
    Rüge, Arnold. Kritische Betrachtung und Darstellung des Deutschen Studentenlebens in seinen Grundzügen.Arnold Rüge - 1908 - Kant-Studien 13 (1-3).
    No categories
    Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  39. Arnold Toynbee a Selection From His Works.Arnold Joseph Toynbee & E. W. F. Tomlin - 1978
     
    Export citation  
     
    Bookmark  
  40.  11
    Editorial: Dynamic Personality Science. Integrating Between-Person Stability and Within-Person Change.Nadin Beckmann & Robert E. Wood - 2017 - Frontiers in Psychology 8.
  41.  12
    Actor and Institutional Dynamics in the Development of Multi-Stakeholder Initiatives.Anica Zeyen, Markus Beckmann & Stella Wolters - 2016 - Journal of Business Ethics 135 (2):341-360.
    As forms of private self-regulation, multi-stakeholder initiatives have emerged as an important empirical phenomenon in global governance processes. At the same time, MSIs are also theoretically intriguing because of their inherent double nature. On the one hand, MSIs spell out CSR standards that define norms for corporate behavior. On the other hand, MSIs are also the result of corporate and stakeholder behavior. We combine the perspectives of institutional theory and club theory to conceptualize this double nature of MSIs. Based on (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  42.  22
    Matthew Arnold and the Education of the New Order.G. H. Bantock, P. Smith, G. Summerfield & Matthew Arnold - 1970 - British Journal of Educational Studies 18 (1):108.
  43.  22
    Treatment Patterns Among Colorectal Cancer Patients in South Australia: A Demonstration of the Utility of Population-Based Data Linkage.Kerri R. Beckmann, Alice Bennett, Graeme P. Young & David M. Roder - 2014 - Journal of Evaluation in Clinical Practice 20 (4):467-477.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  44.  7
    Short‐Term Outcomes After Surgical Resection for Colorectal Cancer in South Australia.Kerri Beckmann, James Moore, David Wattchow, Graeme Young & David Roder - 2017 - Journal of Evaluation in Clinical Practice 23 (2):316-324.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  45.  11
    Competitive Sport, Winning and Education/Peter J. Arnold.J. Arnold Peter - 1989 - Journal of Moral Education 18 (1):15-25.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  46.  6
    Preventing Motor Skill Failure Through Hemisphere-Specific Priming: Cases From Choking Under Pressure.Jürgen Beckmann, Peter Gröpel & Felix Ehrlenspiel - 2013 - Journal of Experimental Psychology: General 142 (3):679-691.
  47.  36
    Further Thoughts on the Degeneration of Market Socialism: A Reply to Schweickart: N. Scott Arnold.N. Scott Arnold - 1987 - Economics and Philosophy 3 (2):320-330.
    David Schweickart has challenged a number of claims that are central to my argument that market socialism would probably degenerate into something only nominally distinguishable from capitalism. Chief among these is the claim that competitive pressures would force the workers in a worker-controlled firm to create pay and authority differentials that would make such firms structurally homologous to capitalist firms. Schweickart challenges this on two fronts: He argues that there is no good reason to believe that market forces under market (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  48. Matthew Arnold and the Education of the New Order: A Selection of Arnold's Writings on Education.Matthew Arnold - 1969 - London: Cambridge University Press.
     
    Export citation  
     
    Bookmark  
  49. Matthew Arnold and the Education of the New Order a Selection of Arnold's Writings on Education; [Edited] with an Introduction and Notes by Peter Smith and Geoffrey Summerfield.Matthew Arnold, Peter Smith & Geoffrey Summerfield - 1969 - Cambridge University Press.
     
    Export citation  
     
    Bookmark  
  50. Matthew Arnold on Education.Matthew Arnold - 1973 - Harmondsworth, Penguin Education.
     
    Export citation  
     
    Bookmark  
1 — 50 / 1000