Results for ' diagonal sequence'

971 found
Order:
  1.  55
    Computable Diagonalizations and Turing’s Cardinality Paradox.Dale Jacquette - 2014 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 45 (2):239-262.
    A. N. Turing’s 1936 concept of computability, computing machines, and computable binary digital sequences, is subject to Turing’s Cardinality Paradox. The paradox conjoins two opposed but comparably powerful lines of argument, supporting the propositions that the cardinality of dedicated Turing machines outputting all and only the computable binary digital sequences can only be denumerable, and yet must also be nondenumerable. Turing’s objections to a similar kind of diagonalization are answered, and the implications of the paradox for the concept of a (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  2.  30
    Separating diagonal stationary reflection principles.Gunter Fuchs & Chris Lambie-Hanson - 2021 - Journal of Symbolic Logic 86 (1):262-292.
    We introduce three families of diagonal reflection principles for matrices of stationary sets of ordinals. We analyze both their relationships among themselves and their relationships with other known principles of simultaneous stationary reflection, the strong reflection principle, and the existence of square sequences.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  3.  64
    Diagonalization.Jaroslav Peregrin - unknown
    It is a trivial fact that if we have a square table filled with numbers, we can always form a column which is not yet contained in the table. Despite its apparent triviality, this fact underlies the foundations of most of the path-breaking results of logic in the second half of the nineteenth and the first half of the twentieth century. We explain how this fact can be used to show that there are more sequences of natural numbers than there (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  4. The diagonalization lemma, Rosser and Tarski.Peter Smith - unknown
    We’ve now proved our key version of the First Theorem, Theorem 42. If T is the right kind of ω-consistent theory including enough arithmetic, then there will be an arithmetic sentence GT such that T ￿ GT and T ￿ ¬GT. Moreover, GT is constructed so that it is true if and only if unprovable-in T (so it is true). Now recall that, for a p.r. axiomatized theory T , Prf T(m, n) is the relation which holds just if m (...)
     
    Export citation  
     
    Bookmark  
  5.  77
    Additivity properties of topological diagonalizations.Tomek Bartoszynski, Saharon Shelah & Boaz Tsaban - 2003 - Journal of Symbolic Logic 68 (4):1254-1260.
    We answer a question of Just, Miller, Scheepers and Szeptycki whether certain diagonalization properties for sequences of open covers are provably closed under taking finite or countable unions.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  6.  28
    The subcompleteness of diagonal Prikry forcing.Kaethe Minden - 2020 - Archive for Mathematical Logic 59 (1-2):81-102.
    Let \ be an infinite discrete set of measurable cardinals. It is shown that generalized Prikry forcing to add a countable sequence to each cardinal in \ is subcomplete. To do this it is shown that a simplified version of generalized Prikry forcing which adds a point below each cardinal in \, called generalized diagonal Prikry forcing, is subcomplete. Moreover, the generalized diagonal Prikry forcing associated to \ is subcomplete above \, where \ is any regular cardinal (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  7.  61
    The Decision Problem of Modal Product Logics with a Diagonal, and Faulty Counter Machines.C. Hampson, S. Kikot & A. Kurucz - 2016 - Studia Logica 104 (3):455-486.
    In the propositional modal treatment of two-variable first-order logic equality is modelled by a ‘diagonal’ constant, interpreted in square products of universal frames as the identity relation. Here we study the decision problem of products of two arbitrary modal logics equipped with such a diagonal. As the presence or absence of equality in two-variable first-order logic does not influence the complexity of its satisfiability problem, one might expect that adding a diagonal to product logics in general is (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  8. Gödelizing the Yablo Sequence.Cezary Cieśliński & Rafal Urbaniak - 2013 - Journal of Philosophical Logic 42 (5):679-695.
    We investigate what happens when ‘truth’ is replaced with ‘provability’ in Yablo’s paradox. By diagonalization, appropriate sequences of sentences can be constructed. Such sequences contain no sentence decided by the background consistent and sufficiently strong arithmetical theory. If the provability predicate satisfies the derivability conditions, each such sentence is provably equivalent to the consistency statement and to the Gödel sentence. Thus each two such sentences are provably equivalent to each other. The same holds for the arithmetization of the existential Yablo (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  9.  10
    Semantical and Logical Paradox.Keith Simmons - 2002 - In Dale Jacquette (ed.), A Companion to Philosophical Logic. Malden, MA, USA: Wiley-Blackwell. pp. 115–130.
    This chapter contains sections titled: Introduction Semantic Paradoxes: Some Proposals Sets and Extensions Three Paradoxes A Contextual Approach A Singularity Proposal Universality.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  10.  32
    Compactness and guessing principles in the Radin extensions.Omer Ben-Neria & Jing Zhang - 2023 - Journal of Mathematical Logic 23 (2).
    We investigate the interaction between compactness principles and guessing principles in the Radin forcing extensions. In particular, we show that in any Radin forcing extension with respect to a measure sequence on [Formula: see text], if [Formula: see text] is weakly compact, then [Formula: see text] holds. This provides contrast with a well-known theorem of Woodin, who showed that in a certain Radin extension over a suitably prepared ground model relative to the existence of large cardinals, the diamond principle (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  11.  31
    Ideals of independence.Vera Fischer & Diana Carolina Montoya - 2019 - Archive for Mathematical Logic 58 (5-6):767-785.
    We study two ideals which are naturally associated to independent families. The first of them, denoted \, is characterized by a diagonalization property which allows along a cofinal sequence of stages along a finite support iteration to adjoin a maximal independent family. The second ideal, denoted \\), originates in Shelah’s proof of \ in Shelah, 433–443, 1992). We show that for every independent family \, \\subseteq \mathcal {J}_\mathcal {A}\) and define a class of maximal independent families, to which we (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  12. THIS IS NICE OF YOU. Introduction by Ben Segal.Gary Lutz - 2011 - Continent 1 (1):43-51.
    Reproduced with the kind permission of the author. Currently available in the collection I Looked Alive . © 2010 The Brooklyn Rail/Black Square Editions | ISBN 978-1934029-07-7 Originally published 2003 Four Walls Eight Windows. continent. 1.1 (2011): 43-51. Introduction Ben Segal What interests me is instigated language, language dishabituated from its ordinary doings, language startled by itself. I don't know where that sort of interest locates me, or leaves me, but a lot of the books I see in the stores (...)
     
    Export citation  
     
    Bookmark  
  13.  50
    Canonical structure in the universe of set theory: Part two.James Cummings, Matthew Foreman & Menachem Magidor - 2006 - Annals of Pure and Applied Logic 142 (1):55-75.
    We prove a number of consistency results complementary to the ZFC results from our paper [J. Cummings, M. Foreman, M. Magidor, Canonical structure in the universe of set theory: part one, Annals of Pure and Applied Logic 129 211–243]. We produce examples of non-tightly stationary mutually stationary sequences, sequences of cardinals on which every sequence of sets is mutually stationary, and mutually stationary sequences not concentrating on a fixed cofinality. We also give an alternative proof for the consistency of (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   18 citations  
  14.  27
    The Position-Momentum Commutator as a Generalized Function: Resolution of the Apparent Discrepancy Between Continuous and Discrete Bases.Timothy B. Boykin - 2023 - Foundations of Physics 53 (3):1-9.
    It has been known for many years that the matrix representation of the one-dimensional position-momentum commutator calculated with the position and momentum matrices in a finite basis is not proportional to the diagonal matrix, contrary to what one expects from the continuous-space commutator. This discrepancy has correctly been ascribed to the incompleteness of any finite basis, but without the details of exactly why this happens. Understanding why the discrepancy occurs requires calculating the position, momentum, and commutator matrix elements in (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  15.  32
    Higher indescribability and derived topologies.Brent Cody - 2023 - Journal of Mathematical Logic 24 (1).
    We introduce reflection properties of cardinals in which the attributes that reflect are expressible by infinitary formulas whose lengths can be strictly larger than the cardinal under consideration. This kind of generalized reflection principle leads to the definitions of [Formula: see text]-indescribability and [Formula: see text]-indescribability of a cardinal [Formula: see text] for all [Formula: see text]. In this context, universal [Formula: see text] formulas exist, there is a normal ideal associated to [Formula: see text]-indescribability and the notions of [Formula: (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  16.  52
    Graham Oppy. Philosophical perspectives on infinity.Elliott Mendelson - 2007 - Philosophia Mathematica 15 (3):397-399.
    The author tells us that this book was originally intended to be part of a larger work, with the provisional title God and Infinity, but that he opted instead for a separate and independent treatment of the notion of infinity in philosophy and related areas. The original purpose is very well-hidden, showing itself clearly only in the Preface and a few other places. The book begins with a chapter describing some known alleged difficulties having to do with the infinitely large (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  17.  65
    Some observations on truth hierarchies.P. D. Welch - 2014 - Review of Symbolic Logic 7 (1):1-30.
    We show how in the hierarchies${F_\alpha }$of Fieldian truth sets, and Herzberger’s${H_\alpha }$revision sequence starting from any hypothesis for${F_0}$ that essentially each${H_\alpha }$ carries within it a history of the whole prior revision process.As applications we provide a precise representation for, and a calculation of the length of, possiblepath independent determinateness hierarchiesof Field’s construction with a binary conditional operator. We demonstrate the existence of generalized liar sentences, that can be considered as diagonalizing past the determinateness hierarchies definable in Field’s (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  18.  12
    A Critical Study of Logical Paradoxes. [REVIEW]G. N. T. - 1971 - Review of Metaphysics 25 (2):354-355.
    This work is, in large part, a series of refutations; it is also the author's Ph.D. thesis. First to be refuted is Russell's vicious circle principle as a general remedy for the solution of the paradoxes. The author rejects the classification of paradoxes into syntactic and semantic, since in his view there are no purely syntactic paradoxes. The distinction in logic between the uninterpreted syntactical aspect of a system and the system when given a determinate interpretation is held to be (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  19.  29
    Zf + dc + ax4.Saharon Shelah - 2016 - Archive for Mathematical Logic 55 (1-2):239-294.
    We consider mainly the following version of set theory: “ZF+DC and for every λ,λℵ0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\lambda, \lambda^{\aleph_0}}$$\end{document} is well ordered”, our thesis is that this is a reasonable set theory, e.g. on the one hand it is much weaker than full choice, and on the other hand much can be said or at least this is what the present work tries to indicate. In particular, we prove that for a sequence δ¯=⟨δs:s∈Y⟩,cf\documentclass[12pt]{minimal} \usepackage{amsmath} (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  20.  21
    On Optimal Inverters.Yijia Chen & Jörg Flum - 2014 - Bulletin of Symbolic Logic 20 (1):1-23.
    Leonid Levin showed that every algorithm computing a function has an optimal inverter. Recently, we applied his result in various contexts: existence of optimal acceptors, existence of hard sequences for algorithms and proof systems, proofs of Gödel’s incompleteness theorems, analysis of the complexity of the clique problem assuming the nonuniform Exponential Time Hypothesis. We present all these applications here. Even though a simple diagonalization yields Levin’s result, we believe that it is worthwhile to be aware of the explicit result. The (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  21.  73
    Scientific Intuition of Genii Against Mytho-‘Logic’ of Cantor’s Transfinite ‘Paradise’.Alexander A. Zenkin - 2005 - Philosophia Scientiae 9 (2):145-163.
    In the paper, a detailed analysis of some new logical aspects of Cantor’s diagonal proof of the uncountability of continuum is presented. For the first time, strict formal, axiomatic, and algorithmic definitions of the notions of potential and actual infinities are presented. It is shown that the actualization of infinite sets and sequences used in Cantor’s proof is a necessary, but hidden, condition of the proof. The explication of the necessary condition and its factual usage within the framework of (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  22. Gödel's Incompleteness Results.Haim Gaifman - unknown
    This short sketch of Gödel’s incompleteness proof shows how it arises naturally from Cantor’s diagonalization method [1891]. It renders Gödel’s proof and its relation to the semantic paradoxes transparent. Some historical details, which are often ignored, are pointed out. We also make some observations on circularity and draw brief comparisons with natural language. The sketch does not include the messy details of the arithmetization of the language, but the motives for it are made obvious. We suggest this as a more (...)
     
    Export citation  
     
    Bookmark  
  23.  26
    Relativity of the metric.William M. Honig - 1977 - Foundations of Physics 7 (7-8):549-572.
    Although the form of the metric is invariant for arbitrary coordinate transformations, the magnitudes of the elements of the metric are not invariant. For Cartesian coordinates these elements are equal to one and are on the diagonal. Such a unitary metric can also apply to arbitrary coordinates, but only for a coordinate system inhabitant (CSI), to whom these coordinates would appear to be Cartesian. The meaning for a non-Euclidean metric consequently appears to be a simple coordinate system transformation for (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  24.  20
    Degrees of randomized computability.Rupert Hölzl & Christopher P. Porter - 2022 - Bulletin of Symbolic Logic 28 (1):27-70.
    In this survey we discuss work of Levin and V’yugin on collections of sequences that are non-negligible in the sense that they can be computed by a probabilistic algorithm with positive probability. More precisely, Levin and V’yugin introduced an ordering on collections of sequences that are closed under Turing equivalence. Roughly speaking, given two such collections $\mathcal {A}$ and $\mathcal {B}$, $\mathcal {A}$ is below $\mathcal {B}$ in this ordering if $\mathcal {A}\setminus \mathcal {B}$ is negligible. The degree structure associated (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  25. Elena loizidou.Sequences on law & The Body - 2018 - In Andreas Philippopoulos-Mihalopoulos (ed.), Routledge Handbook of Law and Theory. New York, NY: Routledge.
     
    Export citation  
     
    Bookmark  
  26.  68
    Addressing the Ethical Challenges in Genetic Testing and Sequencing of Children.Ellen Wright Clayton, Laurence B. McCullough, Leslie G. Biesecker, Steven Joffe, Lainie Friedman Ross, Susan M. Wolf & For the Clinical Sequencing Exploratory Research Group - 2014 - American Journal of Bioethics 14 (3):3-9.
    American Academy of Pediatrics (AAP) and American College of Medical Genetics (ACMG) recently provided two recommendations about predictive genetic testing of children. The Clinical Sequencing Exploratory Research Consortium's Pediatrics Working Group compared these recommendations, focusing on operational and ethical issues specific to decision making for children. Content analysis of the statements addresses two issues: (1) how these recommendations characterize and analyze locus of decision making, as well as the risks and benefits of testing, and (2) whether the guidelines conflict or (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   20 citations  
  27.  77
    Diagonal decision theory.Melissa Fusco - 2024 - Economics and Philosophy 40 (2):485-496.
    Stalnaker’s ‘Assertion’ (1978 [1999]) offers a classic account of diagonalization as an approach to the meaning of a declarative sentence in context. Here I explore the relationship between diagonalization and some puzzles in Mahtani’s book The Objects of Credence. Diagonalization can influence how we think about both credence and desirability, so it influences both components of a standard expected utility equation. In that vein, I touch on two of Mahtani’s case-studies, chance and the finite version of the Two Envelope Paradox.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  28.  23
    Conscious awareness of motor fluidity improves performance and decreases cognitive effort in sequence learning.Stefano Ioannucci, Arnaud Boutin, Thomas Michelet, Alexandre Zenon & Arnaud Badets - 2021 - Consciousness and Cognition 95 (C):103220.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  29.  91
    Mechanisms of Implicit Learning: Connectionist Models of Sequence Processing.Axel Cleeremans - 1993 - MIT Press.
    What do people learn when they do not know that they are learning? Until recently, all of the work in the area of implicit learning focused on empirical questions and methods. In this book, Axel Cleeremans explores unintentional learning from an information-processing perspective. He introduces a theoretical framework that unifies existing data and models on implicit learning, along with a detailed computational model of human performance in sequence-learning situations.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   47 citations  
  30.  53
    Diagonalization in double frames.Andrzej Wiśniewski & Jerzy Pogonowski - 2010 - Logica Universalis 4 (1):31-39.
    We consider structures of the form, where Φ and Ψ are non-empty sets and is a relation whose domain is Ψ. In particular, by using a special kind of a diagonal argument, we prove that if Φ is a denumerable recursive set, Ψ is a denumerable r.e. set, and R is an r.e. relation, then there exists an infinite family of infinite recursive subsets of Φ which are not R -images of elements of Ψ. The proof is a very (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  31.  26
    The additive structure of integers with the lower Wythoff sequence.Mohsen Khani & Afshin Zarei - 2023 - Archive for Mathematical Logic 62 (1):225-237.
    We have provided a model-theoretic proof for the decidability of the additive structure of integers together with the function f mapping x to $$\lfloor \varphi x\rfloor $$ where $$\varphi $$ is the golden ratio.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  32.  35
    Diagonal reflections on squares.Gunter Fuchs - 2019 - Archive for Mathematical Logic 58 (1-2):1-26.
    The effects of the forcing axioms \, \ and \ on the failure of weak threaded square principles of the form \\) are analyzed. To this end, a diagonal reflection principle, \, and it implies the failure of \\) if \. It is also shown that this result is sharp. It is noted that \/\ imply the failure of \\), for every regular \, and that this result is sharp as well.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  33. (1 other version)Wittgensteins Diagonal-Argument: Eine Variation auf Cantor und Turing.Juliet Floyd - 2018 - In Bromand Joachim & Reichert Bastian (eds.), Wittgenstein und die Philosophie der Mathematik. Mentis Verlag. pp. 167-197.
    A German translation with 2017 postscript of Floyd, Juliet. 2012. "Wittgenstein's Diagonal Argument: A Variation on Cantor and Turing." In Epistemology versus Ontology, Logic, Epistemology: Essays in Honor of Per Martin-Löf, edited by P. Dybjer, S. Lindström, E. Palmgren and G. Sundholm, 25-44. Dordrecht: Springer Science+Business Media. An analysis of philosophical aspects of Turing's diagonal argument in his (136) "On computable numbers, with an application to the Entscheidungsproblem" in relation to Wittgenstein's writings on Turing and Cantor.
     
    Export citation  
     
    Bookmark   2 citations  
  34.  26
    The Diagonal Strong Reflection Principle and its Fragments.C. O. X. Sean D. & Gunter Fuchs - 2023 - Journal of Symbolic Logic 88 (3):1281-1309.
    A diagonal version of the strong reflection principle is introduced, along with fragments of this principle associated with arbitrary forcing classes. The relationships between the resulting principles and related principles, such as the corresponding forcing axioms and the corresponding fragments of the strong reflection principle, are analyzed, and consequences are presented. Some of these consequences are “exact” versions of diagonal stationary reflection principles of sets of ordinals. We also separate some of these diagonal strong reflection principles from (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  35. How probable is an infinite sequence of heads?Timothy Williamson - 2007 - Analysis 67 (3):173-180.
    Isn't probability 1 certainty? If the probability is objective, so is the certainty: whatever has chance 1 of occurring is certain to occur. Equivalently, whatever has chance 0 of occurring is certain not to occur. If the probability is subjective, so is the certainty: if you give credence 1 to an event, you are certain that it will occur. Equivalently, if you give credence 0 to an event, you are certain that it will not occur. And so on for other (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   91 citations  
  36.  9
    Analyse des reformulations dans les interactions orales : l'exemple d'une séquence portant sur l'écosystème en CM2.Stéphanie Volteau - 2015 - Corela. Cognition, Représentation, Langage.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  37.  39
    Diagonal fixed points in algebraic recursion theory.Jordan Zashev - 2005 - Archive for Mathematical Logic 44 (8):973-994.
    The relation between least and diagonal fixed points is a well known and completely studied question for a large class of partially ordered models of the lambda calculus and combinatory logic. Here we consider this question in the context of algebraic recursion theory, whose close connection with combinatory logic recently become apparent. We find a comparatively simple and rather weak general condition which suffices to prove the equality of least fixed points with canonical (corresponding to those produced by the (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  38.  15
    Television Match Official Review in Rugby Union: the Sequence of Referee’s Actions.R. A. Matvienko - 2018 - Sociology of Power 30 (2):101-120.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  39.  63
    Does awareness of speech as a sequence of phones arise spontaneously?José Morais, Luz Cary, Jésus Alegria & Paul Bertelson - 1979 - Cognition 7 (4):323-331.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   48 citations  
  40.  14
    From metaphor to practices: The introduction of" information engineers" into the first DNA sequence database.Miguel García-Sancho - 2011 - History and Philosophy of the Life Sciences 33 (1).
  41.  21
    Sequencing Critical Moves for Ethical Argumentation Practice: Munāẓara and the Interdependence of Procedure and Agent.Rahmi Oruç, Mehmet Ali Üzelgün & Karim Sadek - 2023 - Informal Logic 43 (1):113-137.
    The aim of this paper is to highlight an interdependence between procedural and agential norms that undermines their neat separation when appraising argumentation. Drawing on the munāẓara tradition, we carve a space for sequencing in argumentation scholarship. Focusing on the antagonist’s sequencing of critical moves, we identify each sequence’s corresponding values of argumentation: coalescence, reliability, and efficacy. These values arise through the mediation of virtues and simultaneously underpin procedural as well as agential norms. Consequently, an ambiguity between procedure and (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  42. The Diagonal Lemma: An Informal Exposition.Richard Kimberly Heck - manuscript
    This is a completely informal presentation of the ideas behind the diagonal lemma. One really can't see this important result from too many different angles. This one aims at getting the main idea across. (For the cognoscenti, it is in the spirit of Quine's treatment in terms of "appended to its own quotation".).
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  43.  38
    The prevalence and cognitive profile of sequence-space synaesthesia.Jamie Ward, Alberta Ipser, Eva Phanvanova, Paris Brown, Iris Bunte & Julia Simner - 2018 - Consciousness and Cognition 61:79-93.
  44.  36
    Comparing the Strength of Diagonally Nonrecursive Functions in the Absence of Induction.François G. Dorais, Jeffry L. Hirst & Paul Shafer - 2015 - Journal of Symbolic Logic 80 (4):1211-1235.
    We prove that the statement “there is aksuch that for everyfthere is ak-bounded diagonally nonrecursive function relative tof” does not imply weak König’s lemma over${\rm{RC}}{{\rm{A}}_0} + {\rm{B\Sigma }}_2^0$. This answers a question posed by Simpson. A recursion-theoretic consequence is that the classic fact that everyk-bounded diagonally nonrecursive function computes a 2-bounded diagonally nonrecursive function may fail in the absence of${\rm{I\Sigma }}_2^0$.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  45.  41
    Auditory grouping mechanisms reflect a sound's relative position in a sequence.Kevin T. Hill, Christopher W. Bishop & Lee M. Miller - 2012 - Frontiers in Human Neuroscience 6.
  46.  43
    (1 other version)A New Interpretation of the von Mises' Concept of Random Sequence.Donald Loveland - 1966 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 12 (1):279-294.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   6 citations  
  47.  65
    Expanding the prediction capacity in long sequence time-series forecasting.Haoyi Zhou, Jianxin Li, Shanghang Zhang, Shuai Zhang, Mengyi Yan & Hui Xiong - 2023 - Artificial Intelligence 318 (C):103886.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  48.  48
    Unpredicted Pitch Modulates Beta Oscillatory Power during Rhythmic Entrainment to a Tone Sequence.Andrew Chang, Dan J. Bosnyak & Laurel J. Trainor - 2016 - Frontiers in Psychology 7.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  49.  18
    Diagonalized Asymmetry.Ari Santas - 2015 - International Journal of Applied Philosophy 29 (2):207-220.
    Myofascial Pain Syndrome is somatic pain due to muscular tension associated with muscular-skeletal imbalance. The pain and discomfort of the patient is not simply due to some isolated tension, but in the dynamic relationships between related structures. As the body adjusts to reestablish balance and symmetry, the tension and pain in one area “diagonalizes,” creating a tense correlate along a diagonal axis. This diagonalization of tension exacerbates and perpetuates the initial condition of pain and dysfunction. The purpose of this (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  50.  94
    Can amnesic patients learn without awareness? New evidence comparing deterministic and probabilistic sequence learning.Muriel Vandenberghe, Nicolas Schmidt, Patrick Fery & Axel Cleeremans - 2006 - Neuropsychologia 44 (10):1629-1641.
    Can associative learning take place without awareness? We explore this issue in a sequence learning paradigm with amnesic and control participants, who were simply asked to react to one of four possible stimuli on each trial. Unknown to them, successive stimuli occurred in a sequence. We manipulated the extent to which stimuli followed the sequence in a deterministic manner (noiseless condition) or only probabilistically so (noisy condition). Through this paradigm, we aimed at addressing two central issues: first, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
1 — 50 / 971