Results for 'recursive path ordering'

972 found
Order:
  1.  45
    Andreas Weiermann. Complexity bounds for some finite forms of Kruskal's Theorem. Journal of Symbolic Computation, vol. 18 , pp. 463–448. - Andreas Weiermann. Termination proofs for term rewriting systems with lexicographic path ordering imply multiply recursive derivation lengths. Theoretical Computer Science, vol. 139 , pp. 355–362. - Andreas Weiermann. Bounding derivation lengths with functions from the slow growing hierarchy. Archive of Mathematical Logic, vol. 37 , pp. 427–441. [REVIEW]Georg Moser - 2004 - Bulletin of Symbolic Logic 10 (4):588-590.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  2.  47
    The order types of termination orderings on monadic terms, strings and multisets.Ursula Martin & Elizabeth Scott - 1997 - Journal of Symbolic Logic 62 (2):624-635.
    We consider total well-founded orderings on monadic terms satisfying the replacement and full invariance properties. We show that any such ordering on monadic terms in one variable and two unary function symbols must have order typeω,ω2orωω. We show that a familiar construction gives rise to continuum many such orderings of order typeω. We construct a new family of such orderings of order typeω2, and show that there are continuum many of these. We show that there are only four such (...))
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  3. Cut-elimination and a permutation-free sequent calculus for intuitionistic logic.Roy Dyckhoff & Luis Pinto - 1998 - Studia Logica 60 (1):107-118.
    We describe a sequent calculus, based on work of Herbelin, of which the cut-free derivations are in 1-1 correspondence with the normal natural deduction proofs of intuitionistic logic. We present a simple proof of Herbelin's strong cut-elimination theorem for the calculus, using the recursive path ordering theorem of Dershowitz.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  4.  60
    (1 other version)Some results on cut-elimination, provable well-orderings, induction and reflection.Toshiyasu Arai - 1998 - Annals of Pure and Applied Logic 95 (1-3):93-184.
    We gather the following miscellaneous results in proof theory from the attic.1. 1. A provably well-founded elementary ordering admits an elementary order preserving map.2. 2. A simple proof of an elementary bound for cut elimination in propositional calculus and its applications to separation problem in relativized bounded arithmetic below S21.3. 3. Equivalents for Bar Induction, e.g., reflection schema for ω logic.4. 4. Direct computations in an equational calculus PRE and a decidability problem for provable inequations in PRE.5. 5. Intuitionistic (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  5. A general theorem on termination of rewriting.Jeremy E. Dawson - unknown
    We re-express our theorem on the strong-normalisation of display calculi as a theorem about the well-foundedness of a certain ordering on first-order terms, thereby allowing us to prove the termination of systems of rewrite rules. We first show how to use our theorem to prove the well-foundedness of the lexicographic ordering, the multiset ordering and the recursive path ordering. Next, we give examples of systems of rewrite rules which cannot be handled by these methods (...)
     
    Export citation  
     
    Bookmark  
  6.  16
    Dependent choice as a termination principle.Thomas Powell - 2020 - Archive for Mathematical Logic 59 (3-4):503-516.
    We introduce a new formulation of the axiom of dependent choice, which can be viewed as an abstract termination principle that in particular generalises recursive path orderings, the latter being fundamental tools used to establish termination of rewrite systems. We consider several variants of our termination principle, and relate them to general termination theorems in the literature.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  7.  27
    Recursive linear orders with recursive successivities.Michael Moses - 1984 - Annals of Pure and Applied Logic 27 (3):253-264.
    A successivity in a linear order is a pair of elements with no other elements between them. A recursive linear order with recursive successivities U is recursively categorical if every recursive linear order with recursive successivities isomorphic to U is in fact recursively isomorphic to U . We characterize those recursive linear orders with recursive successivities that are recursively categorical as precisely those with order type k 1 + g 1 + k 2 + (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  8. (1 other version)Recursive well-orderings.Clifford Spector - 1955 - Journal of Symbolic Logic 20 (2):151-163.
  9.  63
    Transfinite Progressions: A Second Look At Completeness.Torkel Franzén - 2004 - Bulletin of Symbolic Logic 10 (3):367-389.
    §1. Iterated Gödelian extensions of theories. The idea of iterating ad infinitum the operation of extending a theory T by adding as a new axiom a Gödel sentence for T, or equivalently a formalization of “T is consistent”, thus obtaining an infinite sequence of theories, arose naturally when Godel's incompleteness theorem first appeared, and occurs today to many non-specialists when they ponder the theorem. In the logical literature this idea has been thoroughly explored through two main approaches. One is that (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  10.  36
    Do not Block the Path of Inquiry!Wendy Wheeler - 2008 - American Journal of Semiotics 24 (1-3):171-187.
    Drawing on biosemiotic theory and the Peircean idea of ‘abduction’, I shall propose the idea of a layered structure of bio / semiotic evolution, in which humanknowledge is systemic and recursive — and thus emergent both from what is forgotten and from earlier evolutionary strata. I will argue that abductions are those processes by which we move creatively between often unacknowledged types of knowledge which are rooted in our natural and cultural evolutionary past (e.g., unconscious, preconscious, or tacit knowledge; (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  11. Every recursive linear ordering has a copy in DTIMESPACE (n; log (n)).S. Gregorie - 1990 - Journal of Symbolic Logic 55:260-276.
  12.  42
    A construction for recursive linear orderings.C. J. Ash - 1991 - Journal of Symbolic Logic 56 (2):673-683.
    We re-express a previous general result in a way which seems easier to remember, using the terminology of infinite games. We show how this can be applied to construct recursive linear orderings, showing, for example, that if there is a ▵ 0 2β + 1 linear ordering of type τ, then there is a recursive ordering of type ω β · τ.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  13.  30
    Recursive linear orderings and hyperarithmetical functions.Shih-Chao Liu - 1962 - Notre Dame Journal of Formal Logic 3 (3):129-132.
  14.  39
    Finite condensations of recursive linear orders.Dev K. Roy & Richard Watnick - 1988 - Studia Logica 47 (4):311 - 317.
    The complexity of aII 4 set of natural numbers is encoded into a linear order to show that the finite condensation of a recursive linear order can beII 2–II 1. A priority argument establishes the same result, and is extended to a complete classification of finite condensations iterated finitely many times.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  15.  46
    Degrees of orderings not isomorphic to recursive linear orderings.Carl G. Jockusch & Robert I. Soare - 1991 - Annals of Pure and Applied Logic 52 (1-2):39-64.
    It is shown that for every nonzero r.e. degree c there is a linear ordering of degree c which is not isomorphic to any recursive linear ordering. It follows that there is a linear ordering of low degree which is not isomorphic to any recursive linear ordering. It is shown further that there is a linear ordering L such that L is not isomorphic to any recursive linear ordering, and L together (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   23 citations  
  16. Every recursive linear ordering has a copy in dtime-space (n, log(n)).Serge Grigorieff - 1990 - Journal of Symbolic Logic 55 (1):260-276.
  17.  29
    Intuitionistically provable recursive well-orderings.Harvey M. Friedman & Andre Scedrov - 1986 - Annals of Pure and Applied Logic 30 (2):165-171.
    We consider intuitionistic number theory with recursive infinitary rules . Any primitive recursive binary relation for which transfinite induction schema is provable is in fact well founded. Its ordinal is less than ε 0 if the transfinite induction schema is intuitionistically provable in elementary number theory. These results are provable intuitionistically. In fact, it suffices to consider transfinite induction with respect to one particular number-theoretic property.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  18.  24
    Spector Clifford. Recursive well-orderings.Werner Markwald - 1956 - Journal of Symbolic Logic 21 (4):412-413.
  19.  28
    (1 other version)Hierarchies over recursive well-orderings.Herbert Enderton & David Luckham - 1964 - Journal of Symbolic Logic 29 (4):183-190.
  20.  28
    Recursive automorphisms of recursive linear orderings.Steven Schwarz - 1984 - Annals of Pure and Applied Logic 26 (1):69-73.
  21.  19
    (1 other version)Number theoretic concepts and recursive well-orderings.G. Kreisel, J. Shoenfield & Hao Wang - 1960 - Archive for Mathematical Logic 5 (1-2):42-64.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   16 citations  
  22.  24
    A generalization of the Keisler-Morley theorem to recursively saturated ordered structures.Shahram Mohsenipour - 2007 - Mathematical Logic Quarterly 53 (3):289-294.
    We prove a model theoretic generalization of an extension of the Keisler-Morley theorem for countable recursively saturated models of theories having a K-like model, where K is an inaccessible cardinal.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  23.  20
    Rice H. G.. Recursive and recursively enumerable orders. Transactions of the American Mathematical Society, vol. 83 , pp. 277–300. [REVIEW]Martin Davis - 1957 - Journal of Symbolic Logic 22 (4):375-375.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  24.  57
    A generalization of tennenbaum's theorem on effectively finite recursive linear orderings.Richard Watnick - 1984 - Journal of Symbolic Logic 49 (2):563-569.
  25.  30
    (1 other version)On Choice Sets and Strongly Non‐Trivial Self‐Embeddings of Recursive Linear Orders.Rodney G. Downey & Michael F. Moses - 1989 - Mathematical Logic Quarterly 35 (3):237-246.
  26. XML Update and Query-Structural Recursion on Ordered Trees and List-Based Complex Objects--Expressiveness and PTIME Restrictions.Edward L. Robertson, Lawrence V. Saxton, Dirk Van Gucht & Stijn Vansummeren - 2006 - In O. Stock & M. Schaerf, Lecture Notes In Computer Science. Springer Verlag. pp. 344-358.
     
    Export citation  
     
    Bookmark  
  27.  19
    Herbert Enderton and David Luckham. Hierarchies over recursive well-orderings. The journal of symbolic logic, vol. 29 no. 4 , pp. 183–190.Gustav Hensel - 1966 - Journal of Symbolic Logic 31 (2):263.
  28.  52
    Four types of general recursive well-orderings.Shih Chao Liu - 1962 - Notre Dame Journal of Formal Logic 3 (2):75-78.
  29.  23
    Order‐free Recursion on the Real Numbers.Vasco Brattka - 1997 - Mathematical Logic Quarterly 43 (2):216-234.
    Direct download  
     
    Export citation  
     
    Bookmark  
  30.  43
    Liu Shih-Chao. Four types of general recursive well-orderings. Notre Dame journal of formal logic, vol. 3 , pp. 75–78.Gustav Hensel - 1965 - Journal of Symbolic Logic 30 (2):255-256.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  31.  55
    On Π 1-automorphisms of recursive linear orders.Henry A. Kierstead - 1987 - Journal of Symbolic Logic 52 (3):681-688.
  32.  27
    A lexicographic path order with slow growing derivation bounds.Naohi Eguchi - 2009 - Mathematical Logic Quarterly 55 (2):212-224.
    This paper is concerned with implicit computational complexity of the exptime computable functions. Modifying the lexicographic path order, we introduce a path order EPO. It is shown that a termination proof for a term rewriting system via EPO implies an exponential bound on the lengths of derivations. The path order EPO is designed so that every exptime function is representable as a term rewrite system compatible with EPO (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim).
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  33.  33
    Second-Order Recursions of First-Order Cybernetics: An “Experimental Epistemology”.Won Jeon - 2022 - Open Philosophy 5 (1):381-395.
    This article examines central tensions in cybernetics, defined as the study of self-organization, communication, automated feedback in organisms, and other distributed informational networks, from its wartime beginnings to its contemporary adaptations. By examining aspects of both first- and second-order cybernetics, the article introduces an epistemological standpoint that highlights the tension between its definition as a theory of recursion and a theory of control, prediction, and actionability. I begin by examining the historical outcomes of the Macy Conferences to provide a context (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  34. First Order Theories for Nonmonotone Inductive Definitions: Recursively Inaccessible and Mahlo.Gerhard Jäger - 2001 - Journal of Symbolic Logic 66 (3):1073-1089.
    In this paper first order theories for nonmonotone inductive definitions are introduced, and a proof-theoretic analysis for such theories based on combined operator forms a la Richter with recursively inaccessible and Mahlo closure ordinals is given.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  35.  40
    The Recursively Mahlo Property in Second Order Arithmetic.Michael Rathjen - 1996 - Mathematical Logic Quarterly 42 (1):59-66.
    The paper characterizes the second order arithmetic theorems of a set theory that features a recursively Mahlo universe; thereby complementing prior proof-theoretic investigations on this notion. It is shown that the property of being recursively Mahlo corresponds to a certain kind of β-model reflection in second order arithmetic. Further, this leads to a characterization of the reals recursively computable in the superjump functional.
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  36.  43
    C. Spector. Hyperarithmetical quantifiers. Fundamenta mathematicae, vol. 48 no. 3 , pp. 313–320. - Shih-Chao Liu. Recursive linear orderings and hyper arithmetical junctions. Notre Dame journal of formal logic, vol. 3 , pp. 129–132. [REVIEW]Gustav Hensel - 1966 - Journal of Symbolic Logic 31 (1):137-137.
  37.  51
    Recursion theory on orderings. I. a model theoretic setting.G. Metakides & J. B. Remmel - 1979 - Journal of Symbolic Logic 44 (3):383-402.
    In [6], Metakides and Nerode introduced the study of the lattice of recursively enumerable substructures of a recursively presented model as a means to understand the recursive content of certain algebraic constructions. For example, the lattice of recursively enumerable subspaces,, of a recursively presented vector spaceV∞has been studied by Kalantari, Metakides and Nerode, Retzlaff, Remmel and Shore. Similar studies have been done by Remmel [12], [13] for Boolean algebras and by Metakides and Nerode [9] for algebraically closed fields. In (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  38.  68
    G. Kreisel, J. Shoenfield, and Hao Wang. Number theoretic concepts and recursive well-orderings. Archiv für mathematische Logik und Grundlagenforschung, vol. 5 , pp. 42–64. [REVIEW]Ann M. Singleterry - 1966 - Journal of Symbolic Logic 31 (3):511-512.
  39.  75
    A recursion principle for linear orderings.Juha Oikkonen - 1992 - Journal of Symbolic Logic 57 (1):82-96.
    The idea of this paper is to approach linear orderings as generalized ordinals and to study how they are made from their initial segments. First we look at how the equality of two linear orderings can be expressed in terms of equality of their initial segments. Then we shall use similar methods to define functions by recursion with respect to the initial segment relation. Our method is based on the use of a game where smaller and smaller initial segments of (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  40.  23
    An exact algebraic solution for the recursive path model with manifest variables.Peter H. Schönemann - 1984 - Bulletin of the Psychonomic Society 22 (5):455-458.
  41.  76
    Some conservation results on weak König's lemma.Stephen G. Simpson, Kazuyuki Tanaka & Takeshi Yamazaki - 2002 - Annals of Pure and Applied Logic 118 (1-2):87-114.
    By , we denote the system of second-order arithmetic based on recursive comprehension axioms and Σ10 induction. is defined to be plus weak König's lemma: every infinite tree of sequences of 0's and 1's has an infinite path. In this paper, we first show that for any countable model M of , there exists a countable model M′ of whose first-order part is the same as that of M, and whose second-order part consists of the M-recursive sets (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  42.  31
    On uniform weak König's lemma.Ulrich Kohlenbach - 2002 - Annals of Pure and Applied Logic 114 (1-3):103-116.
    The so-called weak König's lemma WKL asserts the existence of an infinite path b in any infinite binary tree . Based on this principle one can formulate subsystems of higher-order arithmetic which allow to carry out very substantial parts of classical mathematics but are Π 2 0 -conservative over primitive recursive arithmetic PRA . In Kohlenbach 1239–1273) we established such conservation results relative to finite type extensions PRA ω of PRA . In this setting one can consider also (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  43.  32
    Recursive complexity of the Carnap first order modal logic C.Amélie Gheerbrant & Marcin Mostowski - 2006 - Mathematical Logic Quarterly 52 (1):87-94.
    We consider first order modal logic C firstly defined by Carnap in “Meaning and Necessity” [1]. We prove elimination of nested modalities for this logic, which gives additionally the Skolem-Löwenheim theorem for C. We also evaluate the degree of unsolvability for C, by showing that it is exactly 0′. We compare this logic with the logics of Henkin quantifiers, Σ11 logic, and SO. We also shortly discuss properties of the logic C in finite models.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  44.  36
    Recursion theory and ordered groups.R. G. Downey & Stuart A. Kurtz - 1986 - Annals of Pure and Applied Logic 32:137-151.
  45.  20
    The Number of Preference Orderings: A Recursive Approach.Ben Eggleston - 2015 - The Mathematical Gazette 99 (544):21-32.
    This article discusses approaches to the problem of the number of preference orderings that can be constructed from a given set of alternatives. After briefly reviewing the prevalent approach to this problem, which involves determining a partitioning of the alternatives and then a permutation of the partitions, this article explains a recursive approach and shows it to have certain advantages over the partitioning one.
    Direct download  
     
    Export citation  
     
    Bookmark  
  46.  23
    Recursive well-founded orderings.Keh-Hsun Chen - 1978 - Annals of Mathematical Logic 13 (2):117-147.
  47. The Prescience of the Untimely: A Review of Arab Spring, Libyan Winter by Vijay Prashad. [REVIEW]Sasha Ross - 2012 - Continent 2 (3):218-223.
    continent. 2.3 (2012): 218–223 Vijay Prashad. Arab Spring, Libyan Winter . Oakland: AK Press. 2012. 271pp, pbk. $14.95 ISBN-13: 978-1849351126. Nearly a decade ago, I sat in a class entitled, quite simply, “Corporations,” taught by Vijay Prashad at Trinity College. Over the course of the semester, I was amazed at the extent of Prashad’s knowledge, and the complexity and erudition of his style. He has since authored a number of classic books that have gained recognition throughout the world. The Darker (...)
    No categories
     
    Export citation  
     
    Bookmark  
  48.  49
    Interpolating d-r.e. and REA degrees between r.e. degrees.Marat Arslanov, Steffen Lempp & Richard A. Shore - 1996 - Annals of Pure and Applied Logic 78 (1-3):29-56.
    We provide three new results about interpolating 2-r.e. or 2-REA degrees between given r.e. degrees: Proposition 1.13. If c h are r.e. , c is low and h is high, then there is an a h which is REA in c but not r.e. Theorem 2.1. For all high r.e. degrees h g there is a properly d-r.e. degree a such that h a g and a is r.e. in h . Theorem 3.1. There is an incomplete nonrecursive r.e. A (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  49. Recursion theory on orderings. II.J. B. Remmel - 1980 - Journal of Symbolic Logic 45 (2):317-333.
  50.  40
    Relative predicativity and dependent recursion in second-order set theory and higher-order theories.Sato Kentaro - 2014 - Journal of Symbolic Logic 79 (3):712-732.
    This article reports that some robustness of the notions of predicativity and of autonomous progression is broken down if as the given infinite total entity we choose some mathematical entities other than the traditionalω. Namely, the equivalence between normal transfinite recursion scheme and newdependent transfinite recursionscheme, which does hold in the context of subsystems of second order number theory, does not hold in the context of subsystems of second order set theory where the universeVof sets is treated as the given (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   8 citations  
1 — 50 / 972