Switch to: References

Add citations

You must login to add citations.
  1. Reverse mathematics, well-quasi-orders, and Noetherian spaces.Emanuele Frittaion, Matthew Hendtlass, Alberto Marcone, Paul Shafer & Jeroen Van der Meeren - 2016 - Archive for Mathematical Logic 55 (3):431-459.
    A quasi-order Q induces two natural quasi-orders on $${\mathcal{P}(Q)}$$, but if Q is a well-quasi-order, then these quasi-orders need not necessarily be well-quasi-orders. Nevertheless, Goubault-Larrecq (Proceedings of the 22nd Annual IEEE Symposium 4 on Logic in Computer Science (LICS’07), pp. 453–462, 2007) showed that moving from a well-quasi-order Q to the quasi-orders on $${\mathcal{P}(Q)}$$ preserves well-quasi-orderedness in a topological sense. Specifically, Goubault-Larrecq proved that the upper topologies of the induced quasi-orders on $${\mathcal{P}(Q)}$$ are Noetherian, which means that they contain no (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings.Rüsinš Freivalds, Efim B. Kinber & Rolf Wiehagen - 1988 - Mathematical Logic Quarterly 34 (6):531-539.
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)Probabilistic Versus Deterministic Inductive Inference in Nonstandard Numberings.Rüsinš Freivalds, Efim B. Kinber & Rolf Wiehagen - 1988 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 34 (6):531-539.
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)Inductive Inference and Computable One‐One Numberings.Rsinš Freivalds, Efim B. Kinber & Rolf Wiehagen - 1982 - Mathematical Logic Quarterly 28 (27‐32):463-479.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)Inductive Inference and Computable One-One Numberings.Rsinš Freivalds, Efim B. Kinber & Rolf Wiehagen - 1982 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 28 (27-32):463-479.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Computable de Finetti measures.Cameron E. Freer & Daniel M. Roy - 2012 - Annals of Pure and Applied Logic 163 (5):530-546.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)Connections between identifying functionals, standardizing operations, and computable numberings.Rüsinš Freivalds, Efim B. Kinber & Rolf Wiehagen - 1984 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 30 (9-11):145-164.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)Connections between identifying functionals, standardizing operations, and computable numberings.Rüsinš Freivalds, Efim B. Kinber & Rolf Wiehagen - 1984 - Mathematical Logic Quarterly 30 (9‐11):145-164.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)Elementary Formal Systems for Hyperarithmetical Relations.Melvin Fitting - 1978 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 24 (1-6):25-30.
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)The First‐Order Theory of the c‐Degrees With the #‐Operation.Patrick Farrington - 1982 - Mathematical Logic Quarterly 28 (33‐38):487-493.
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)The first‐order theory of the c‐degrees.Paddy Farrinoton - 1984 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 30 (26‐29):437-446.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)The First-Order Theory of thec-Degrees With the #-Operation.Patrick Farrington - 1982 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 28 (33-38):487-493.
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)Universalität von Berechenbaren Numerierungen von Partiell Rekursiven Funktionen.Josef Falkinger - 1980 - Mathematical Logic Quarterly 26 (32‐33):523-528.
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)Universalität von Berechenbaren Numerierungen von Partiell Rekursiven Funktionen.Josef Falkinger - 1980 - Mathematical Logic Quarterly 26 (32-33):523-528.
    Download  
     
    Export citation  
     
    Bookmark  
  • Reduzierbarkeit von Berechenbaren Numerierungen von P1.Josef Falkinger - 1980 - Mathematical Logic Quarterly 26 (28-30):445-458.
    Download  
     
    Export citation  
     
    Bookmark  
  • The evolutionary aspect of cognitive functions.J. -P. Ewert - 1987 - Behavioral and Brain Sciences 10 (3):481-483.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • The scientific induction problem: A case for case studies.K. Anders Ericsson - 1987 - Behavioral and Brain Sciences 10 (3):480-481.
    Download  
     
    Export citation  
     
    Bookmark  
  • Computations over abstract categories of representation.Roy Eagleson - 1990 - Behavioral and Brain Sciences 13 (4):661-662.
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)On Some σ‐Algebras Containing the Projective Sets I.C. A. di Prisco & Wiktor Marek - 1982 - Mathematical Logic Quarterly 28 (33‐38):525-538.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)On the Simplicity of Busy Beaver Sets.Robert P. Daley - 1978 - Mathematical Logic Quarterly 24 (13‐14):207-224.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)On the Simplicity of Busy Beaver Sets.Robert P. Daley - 1978 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 24 (13-14):207-224.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • The algorithm/implementation distinction.Austen Clark - 1987 - Behavioral and Brain Sciences 10 (3):480-480.
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)Sortability and Extensibility of the Graphs of Recursively Enumerable Partial and Total Orders.John Case - 1976 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 22 (1):1-18.
    Download  
     
    Export citation  
     
    Bookmark  
  • Rice and Rice-Shapiro Theorems for transfinite correction grammars.John Case & Sanjay Jain - 2011 - Mathematical Logic Quarterly 57 (5):504-516.
    Hay and, then, Johnson extended the classic Rice and Rice-Shapiro Theorems for computably enumerable sets, to analogs for all the higher levels in the finite Ershov Hierarchy. The present paper extends their work to analogs in the transfinite Ershov Hierarchy. Some of the transfinite cases are done for all transfinite notations in Kleene's important system of notations, equation image. Other cases are done for all transfinite notations in a very natural, proper subsystem equation image of equation image, where equation image (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)Nondeterministic Ω‐Computations and the Analytical Hierarchy.J. Castro & F. Cucker - 1989 - Mathematical Logic Quarterly 35 (4):333-342.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)Nondeterministic Ω-Computations and the Analytical Hierarchy.J. Castro & F. Cucker - 1989 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 35 (4):333-342.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)Maximal Arithmetical Reducibilities.John Case - 1974 - Mathematical Logic Quarterly 20 (13‐18):261-270.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • (1 other version)Maximal Arithmetical Reducibilities.John Case - 1974 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 20 (13-18):261-270.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Generality’s price: Inescapable deficiencies in machine-learned programs.John Case, Keh-Jiann Chen, Sanjay Jain, Wolfgang Merkle & James S. Royer - 2006 - Annals of Pure and Applied Logic 139 (1):303-326.
    This paper investigates some delicate tradeoffs between the generality of an algorithmic learning device and the quality of the programs it learns successfully. There are results to the effect that, thanks to small increases in generality of a learning device, the computational complexity of some successfully learned programs is provably unalterably suboptimal. There are also results in which the complexity of successfully learned programs is asymptotically optimal and the learning device is general, but, still thanks to the generality, some of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)Effectivizing Inseparability.John Case - 1991 - Mathematical Logic Quarterly 37 (7):97-111.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)Effectivizing Inseparability.John Case - 1991 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 37 (7):97-111.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • On the Necessity of U-Shaped Learning.Lorenzo Carlucci & John Case - 2013 - Topics in Cognitive Science 5 (1):56-88.
    A U-shaped curve in a cognitive-developmental trajectory refers to a three-step process: good performance followed by bad performance followed by good performance once again. U-shaped curves have been observed in a wide variety of cognitive-developmental and learning contexts. U-shaped learning seems to contradict the idea that learning is a monotonic, cumulative process and thus constitutes a challenge for competing theories of cognitive development and learning. U-shaped behavior in language learning (in particular in learning English past tense) has become a central (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • (1 other version)Two Impredicative Theories of Properties and Sets.Andrea Cantini - 1988 - Mathematical Logic Quarterly 34 (5):403-420.
    Download  
     
    Export citation  
     
    Bookmark  
  • Paulo Freire, Mathematics and Policies that Shape Mathematics.Isabel Cafezeiro, Ricardo Kubrusly, Ivan da Costa Marques & Edwaldo Cafezeiro - 2017 - Journal of the Indian Council of Philosophical Research 34 (2):227-246.
    PurposeThis paper proposes a situated understanding of mathematics, which means recognizing mathematics as locally and collectively constructed knowledge, in opposition to the universalist and neutralist conceptions of mathematics. We consider proposals formulated by Brazilian intellectuals of the 1920s and 1950s, as well as the political and social conjuncture of contemporary Brazil.MethodologyWe start section “An Act of Vandalism” in a critical position regarding the current Brazilian social and political conjuncture. We show that this has been provoking the strengthening of education policies (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • The R. E. Complexity of Decision Problems for Commutative Semi-Thue Systems With Recursive Rule Set.Egon Börger & Hans Kleine Büning - 1980 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 26 (28-30):459-469.
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)A New General Approach to the Theory of the Many‐One Equivalence of Decision Problems for Algorithmic Systems.Egon Börger - 1979 - Mathematical Logic Quarterly 25 (7‐12):135-162.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)On BI‐Immune Isols.Joachim Biskup - 1976 - Mathematical Logic Quarterly 23 (31‐35):469-484.
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)Small Π0 1 Classes.Stephen Binns - 2005 - Archive for Mathematical Logic 45 (4):393-410.
    The property of smallness for Π0 1 classes is introduced and is investigated with respect to Medvedev and Muchnik degree. It is shown that the property of containing a small Π0 1 class depends only on the Muchnik degree of a Π0 1 class. A comparison is made with the idea of thinness for Π0 1 classesmsthm.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Completeness, Compactness, Effective Dimensions.Stephen Binns - 2013 - Mathematical Logic Quarterly 59 (3):206-218.
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)Reducibility in some categories of partial recursive operators.Caterina Bianchini & Andrea Sorbi - 1992 - Mathematical Logic Quarterly 38 (1):349-359.
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)Reducibility in some categories of partial recursive operators.Caterina Bianchini & Andrea Sorbi - 1992 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 38 (1):349-359.
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)Recursively Enumerable L‐Sets.Loredana Biacino & Giangiacomo Gerla - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (2):107-113.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Expressive power of digraph solvability.Marc Bezem, Clemens Grabmayer & Michał Walicki - 2012 - Annals of Pure and Applied Logic 163 (3):200-213.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Translating the hypergame paradox: Remarks on the set of founded elements of a relation. [REVIEW]Claudio Bernardi & Giovanna D'Agostino - 1996 - Journal of Philosophical Logic 25 (5):545 - 557.
    In Zwicker (1987) the hypergame paradox is introduced and studied. In this paper we continue this investigation, comparing the hypergame argument with the diagonal one, in order to find a proof schema. In particular, in Theorems 9 and 10 we discuss the complexity of the set of founded elements in a recursively enumerable relation on the set N of natural numbers, in the framework of reduction between relations. We also find an application in the theory of diagonalizable algebras and construct (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • On the relation provable equivalence and on partitions in effectively inseparable sets.Claudio Bernardi - 1981 - Studia Logica 40 (1):29 - 37.
    We generalize a well-knownSmullyan's result, by showing that any two sets of the kindC a = {x/ xa} andC b = {x/ xb} are effectively inseparable (if I b). Then we investigate logical and recursive consequences of this fact (see Introduction).
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • (1 other version)Rekursive Algebren mit Kettenbedingungen.Walter Baur - 1974 - Mathematical Logic Quarterly 20 (1-3):37-46.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • (1 other version)On Some Properties of Recursively Enumerable Equivalence Relations.Stefano Baratella - 1989 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 35 (3):261-268.
    Download  
     
    Export citation  
     
    Bookmark  
  • The jump operation for structure degrees.V. Baleva - 2005 - Archive for Mathematical Logic 45 (3):249-265.
    One of the main problems in effective model theory is to find an appropriate information complexity measure of the algebraic structures in the sense of computability. Unlike the commonly used degrees of structures, the structure degree measure is total. We introduce and study the jump operation for structure degrees. We prove that it has all natural jump properties (including jump inversion theorem, theorem of Ash), which show that our definition is relevant. We study the relation between the structure degree jump (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Recursive Structures and Ershov's Hierarchy.Christopher J. Ash & Julia F. Knight - 1996 - Mathematical Logic Quarterly 42 (1):461-468.
    Ash and Nerode [2] gave natural definability conditions under which a relation is intrinsically r. e. Here we generalize this to arbitrary levels in Ershov's hierarchy of Δmath image sets, giving conditions under which a relation is intrinsically α-r. e.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Implementations, algorithms, and more.John R. Anderson - 1987 - Behavioral and Brain Sciences 10 (3):498-505.
    Download  
     
    Export citation  
     
    Bookmark