Results for 'Transfinite sequences'

929 found
Order:
  1.  50
    A transfinite sequence of ?-models.Andrzej Mostowski - 1972 - Journal of Symbolic Logic 37 (1):96-102.
  2.  30
    Transfinite descending sequences of models HODα.Wo̵dzimierz Zadroźny - 1981 - Annals of Mathematical Logic 20 (2):201-229.
  3.  45
    Cofinally Invariant Sequences and Revision.Edoardo Rivello - 2015 - Studia Logica 103 (3):599-622.
    Revision sequences are a kind of transfinite sequences which were introduced by Herzberger and Gupta in 1982 as the main mathematical tool for developing their respective revision theories of truth. We generalise revision sequences to the notion of cofinally invariant sequences, showing that several known facts about Herzberger’s and Gupta’s theories also hold for this more abstract kind of sequences and providing new and more informative proofs of the old results.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  4.  18
    Some transfinite natural sums.Paolo Lipparini - 2018 - Mathematical Logic Quarterly 64 (6):514-528.
    We study a transfinite iteration of the ordinal Hessenberg natural sum obtained by taking suprema at limit stages. We show that such an iterated natural sum differs from the more usual transfinite ordinal sum only for a finite number of iteration steps. The iterated natural sum of a sequence of ordinals can be obtained as a mixed sum (in an order‐theoretical sense) of the ordinals in the sequence; in fact, it is the largest mixed sum which satisfies a (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  5.  34
    Derived sequences and reverse mathematics.Jeffry L. Hirst - 1993 - Mathematical Logic Quarterly 39 (1):447-453.
    One of the earliest applications of transfinite numbers is in the construction of derived sequences by Cantor [2]. In [6], the existence of derived sequences for countable closed sets is proved in ATR0. This existence theorem is an intermediate step in a proof that a statement concerning topological comparability is equivalent to ATR0. In actuality, the full strength of ATR0 is used in proving the existence theorem. To show this, we will derive a statement known to be (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  6.  62
    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  
  7.  38
    Periodicity and Reflexivity in Revision Sequences.Edoardo Rivello - 2015 - Studia Logica 103 (6):1279-1302.
    Revision sequences were introduced in 1982 by Herzberger and Gupta as a mathematical tool in formalising their respective theories of truth. Since then, revision has developed in a method of analysis of theoretical concepts with several applications in other areas of logic and philosophy. Revision sequences are usually formalised as ordinal-length sequences of objects of some sort. A common idea of revision process is shared by all revision theories but specific proposals can differ in the so-called limit (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  8.  15
    What is effective transfinite recursion in reverse mathematics?Anton Freund - 2020 - Mathematical Logic Quarterly 66 (4):479-483.
    In the context of reverse mathematics, effective transfinite recursion refers to a principle that allows us to construct sequences of sets by recursion along arbitrary well orders, provided that each set is ‐definable relative to the previous stages of the recursion. It is known that this principle is provable in. In the present note, we argue that a common formulation of effective transfinite recursion is too restrictive. We then propose a more liberal formulation, which appears very natural (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  9. The Logic of Sequences.Cian Dorr & Matthew Mandelkern - manuscript
    In the course of proving a tenability result about the probabilities of conditionals, van Fraassen (1976) introduced a semantics for conditionals based on ω-sequences of worlds, which amounts to a particularly simple special case of ordering semantics for conditionals. On that semantics, ‘If p, then q’ is true at an ω-sequence just in case q is true at the first tail of the sequence where p is true (if such a tail exists). This approach has become increasingly popular in (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  10.  36
    Ordinal analyses for monotone and cofinal transfinite inductions.Kentaro Sato - 2020 - Archive for Mathematical Logic 59 (3-4):277-291.
    We consider two variants of transfinite induction, one with monotonicity assumption on the predicate and one with the induction hypothesis only for cofinally many below. The latter can be seen as a transfinite analogue of the successor induction, while the usual transfinite induction is that of cumulative induction. We calculate the supremum of ordinals along which these schemata for \ formulae are provable in \. It is shown to be larger than the proof-theoretic ordinal \ by power (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  11.  71
    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  
  12.  20
    A topological completeness theorem for transfinite provability logic.Juan P. Aguilera - 2023 - Archive for Mathematical Logic 62 (5):751-788.
    We prove a topological completeness theorem for the modal logic $$\textsf{GLP}$$ GLP containing operators $$\{\langle \xi \rangle :\xi \in \textsf{Ord}\}$$ { ⟨ ξ ⟩ : ξ ∈ Ord } intended to capture a wellordered sequence of consistency operators increasing in strength. More specifically, we prove that, given a tall-enough scattered space X, any sentence $$\phi $$ ϕ consistent with $$\textsf{GLP}$$ GLP can be satisfied on a polytopological space based on finitely many Icard topologies constructed over X and corresponding to the (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  13. Non-Archimedean Preferences Over Countable Lotteries.Jeffrey Sanford Russell - 2020 - Journal of Mathematical Economics 88 (May 2020):180-186.
    We prove a representation theorem for preference relations over countably infinite lotteries that satisfy a generalized form of the Independence axiom, without assuming Continuity. The representing space consists of lexicographically ordered transfinite sequences of bounded real numbers. This result is generalized to preference orders on abstract superconvex spaces.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  14.  38
    Finite State Automata and Monadic Definability of Singular Cardinals.Itay Neeman - 2008 - Journal of Symbolic Logic 73 (2):412 - 438.
    We define a class of finite state automata acting on transfinite sequences, and use these automata to prove that no singular cardinal can be defined by a monadic second order formula over the ordinals.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  15. Absolute Infinity, Knowledge, and Divinity in the Thought of Cusanus and Cantor (ABSTRACT ONLY).Anne Newstead - 2024 - In Mirosław Szatkowski (ed.), Ontology of Divinity. Boston: De Gruyter. pp. 561-580.
    Renaissance philosopher, mathematician, and theologian Nicholas of Cusa (1401-1464) said that there is no proportion between the finite mind and the infinite. He is fond of saying reason cannot fully comprehend the infinite. That our best hope for attaining a vision and understanding of infinite things is by mathematics and by the use of contemplating symbols, which help us grasp "the absolute infinite". By the late 19th century, there is a decisive intervention in mathematics and its philosophy: the philosophical mathematician (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  16.  29
    A note on the first‐order logic of complete BL‐chains.Petr Hájek & Franco Montagna - 2008 - Mathematical Logic Quarterly 54 (4):435-446.
    In [10] it is claimed that the set of predicate tautologies of all complete BL-chains and the set of all standard tautologies coincide. As noticed in [11], this claim is wrong. In this paper we show that a complete BL-chain B satisfies all standard BL-tautologies iff for any transfinite sequence of elements of B, the condition ∧i ∈ I = 2 holds in B.
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  17.  69
    Metavaluations.Ross T. Brady - 2017 - Bulletin of Symbolic Logic 23 (3):296-323.
    This is a general account of metavaluations and their applications, which can be seen as an alternative to standard model-theoretic methodology. They work best for what are called metacomplete logics, which include the contraction-less relevant logics, with possible additions of Conjunctive Syllogism, & →.A→C, and the irrelevant, A→.B→A, these including the logic MC of meaning containment which is arguably a good entailment logic. Indeed, metavaluations focus on the formula-inductive properties of theorems of entailment form A→B, splintering into two types, M1- (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  18. "Infinity, Knowledge, and Divinity in the Thought of Cusanus and Cantor" (Manuscript draft of first page of forthcoming book chapter ).Anne Newstead (ed.) - forthcoming - Berlin: De Gruyter.
    Renaissance philosopher, mathematician, and theologian Nicholas of Cusa (1401-1464) said that there is no proportion between the finite mind and the infinite. He is fond of saying reason cannot fully comprehend the infinite. That our best hope for attaining a vision and understanding of infinite things is by mathematics and by the use of contemplating symbols, which help us grasp "the absolute infinite". By the late 19th century, there is a decisive intervention in mathematics and its philosophy: the philosophical mathematician (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  19.  77
    Weaker variants of infinite time Turing machines.Matteo Bianchetti - 2020 - Archive for Mathematical Logic 59 (3-4):335-365.
    Infinite time Turing machines represent a model of computability that extends the operations of Turing machines to transfinite ordinal time by defining the content of each cell at limit steps to be the lim sup of the sequences of previous contents of that cell. In this paper, we study a computational model obtained by replacing the lim sup rule with an ‘eventually constant’ rule: at each limit step, the value of each cell is defined if and only if (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  20.  52
    Proof theory of reflection.Michael Rathjen - 1994 - Annals of Pure and Applied Logic 68 (2):181-224.
    The paper contains proof-theoretic investigation on extensions of Kripke-Platek set theory, KP, which accommodate first-order reflection. Ordinal analyses for such theories are obtained by devising cut elimination procedures for infinitary calculi of ramified set theory with Пn reflection rules. This leads to consistency proofs for the theories KP+Пn reflection using a small amount of arithmetic and the well-foundedness of a certain ordinal system with respect to primitive decending sequences. Regarding future work, we intend to avail ourselves of these new (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   37 citations  
  21.  91
    Probability for the Revision Theory of Truth.Catrin Campbell-Moore, Leon Horsten & Hannes Leitgeb - 2019 - Journal of Philosophical Logic 48 (1):87-112.
    We investigate how to assign probabilities to sentences that contain a type-free truth predicate. These probability values track how often a sentence is satisfied in transfinite revision sequences, following Gupta and Belnap’s revision theory of truth. This answers an open problem by Leitgeb which asks how one might describe transfinite stages of the revision sequence using such probability functions. We offer a general construction, and explore additional constraints that lead to desirable properties of the resulting probability function. (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  22. Idealist and Realist Elements in Cantor's Approach to Set Theory.I. Jane - 2010 - Philosophia Mathematica 18 (2):193-226.
    There is an apparent tension between the open-ended aspect of the ordinal sequence and the assumption that the set-theoretical universe is fully determinate. This tension is already present in Cantor, who stressed the incompletable character of the transfinite number sequence in Grundlagen and avowed the definiteness of the totality of sets and numbers in subsequent philosophical publications and in correspondence. The tension is particularly discernible in his late distinction between sets and inconsistent multiplicities. I discuss Cantor’s contrasting views, and (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  23.  47
    (1 other version)On the restricted ordinal theorem.R. L. Goodstein - 1944 - Journal of Symbolic Logic 9 (2):33-41.
    The proposition that a decreasing sequence of ordinals necessarily terminates has been given a new, and perhaps unexpected, importance by the rôle which it plays in Gentzen's proof of the freedom from contradiction of the “reine Zahlentheorie.” Gödel's construction of non-demonstrable propositions and the establishment of the impossibility of a proof of freedom from contradiction, within the framework of a certain type of formal system, showed that a proof of freedom from contradiction could be found only by transcending the axioms (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   23 citations  
  24. Meillassoux’s Virtual Future.Graham Harman - 2011 - Continent 1 (2):78-91.
    continent. 1.2 (2011): 78-91. This article consists of three parts. First, I will review the major themes of Quentin Meillassoux’s After Finitude . Since some of my readers will have read this book and others not, I will try to strike a balance between clear summary and fresh critique. Second, I discuss an unpublished book by Meillassoux unfamiliar to all readers of this article, except those scant few that may have gone digging in the microfilm archives of the École normale (...)
     
    Export citation  
     
    Bookmark   2 citations  
  25.  48
    Iteratively Changing the Heights of Automorphism Towers.Gunter Fuchs & Philipp Lücke - 2012 - Notre Dame Journal of Formal Logic 53 (2):155-174.
    We extend the results of Hamkins and Thomas concerning the malleability of automorphism tower heights of groups by forcing. We show that any reasonable sequence of ordinals can be realized as the automorphism tower heights of a certain group in consecutive forcing extensions or ground models, as desired. For example, it is possible to increase the height of the automorphism tower by passing to a forcing extension, then increase it further by passing to a ground model, and then decrease it (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  26.  11
    A Walk with Goodstein and Ackermann.David Fernández-Duque & Andreas Weiermann - 2024 - Notre Dame Journal of Formal Logic 65 (2):181-201.
    Goodstein’s theorem states that certain sequences based on exponential notation for the natural numbers are always finite. The result is independent of Peano arithmetic and is a prototypical example of a proof of termination by transfinite induction. A variant based instead on the Ackermann function has more recently been proposed by Arai, Fernández-Duque, Wainer, and Weiermann, and instead is independent of the more powerful theory ATR0. However, this result is contingent on rather elaborate normal forms for natural numbers (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  27.  18
    Infinite Wordle and the mastermind numbers.Joel David Hamkins - forthcoming - Mathematical Logic Quarterly.
    I consider the natural infinitary variations of the games Wordle and Mastermind, as well as their game‐theoretic variations Absurdle and Madstermind, considering these games with infinitely long words and infinite color sequences and allowing transfinite game play. For each game, a secret codeword is hidden, which the codebreaker attempts to discover by making a series of guesses and receiving feedback as to their accuracy. In Wordle with words of any size from a finite alphabet of n letters, including (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  28.  66
    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  
  29. 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  
  30.  31
    Transfinite induction within Peano arithmetic.Richard Sommer - 1995 - Annals of Pure and Applied Logic 76 (3):231-289.
    The relative strengths of first-order theories axiomatized by transfinite induction, for ordinals less-than 0, and formulas restricted in quantifier complexity, is determined. This is done, in part, by describing the provably recursive functions of such theories. Upper bounds for the provably recursive functions are obtained using model-theoretic techniques. A variety of additional results that come as an application of such techniques are mentioned.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   24 citations  
  31. (1 other version)The development of rhythmic attending in auditory sequences: attunement, referent period, focal attending.Carolyn Drake, Mari Riess Jones & Clarisse Baruch - 2000 - Cognition 77 (3):251-288.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   34 citations  
  32.  23
    The internal representation of pitch sequences in tonal music.Diana Deutsch & John Feroe - 1981 - Psychological Review 88 (6):503-522.
  33.  31
    (1 other version)On the Minimal Length of Sequences Representing Simply Ordered Sets.Alexander Abian & David Deever - 1967 - Mathematical Logic Quarterly 13 (1‐2):21-23.
    Direct download  
     
    Export citation  
     
    Bookmark  
  34.  37
    The mental representation of ordinal sequences is spatially organized.Wim Gevers, Bert Reynvoet & Wim Fias - 2003 - Cognition 87 (3):B87-B95.
  35.  14
    Temporal Binding in Multi-Step Action-Event Sequences is Driven by Altered Effect Perception.Felicitas V. Muth, Robert Wirth & Wilfried Kunde - 2022 - Consciousness and Cognition 99 (C):103299.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  36. Fusing significance coding with the stream of cognitive and conscious sequences: Generalizing from a neurocomputational model of motivated saccadic eye movements.M. Bernstein & J. Bickle - 2000 - Consciousness and Cognition 9 (2):S74 - S75.
  37. Structured Semantic Knowledge Can Emerge Automatically from Predicting Word Sequences in Child-Directed Speech.Philip A. Huebner & Jon A. Willits - 2018 - Frontiers in Psychology 9.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  38.  57
    Simultaneous stationary reflection and square sequences.Yair Hayut & Chris Lambie-Hanson - 2017 - Journal of Mathematical Logic 17 (2):1750010.
    We investigate the relationship between weak square principles and simultaneous reflection of stationary sets.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  39.  77
    Modality and Perceptual-Motor Experience Influence the Detection of Temporal Deviations in Tap Dance Sequences.Mauro Murgia, Valter Prpic, Jenny O., Penny McCullagh, Ilaria Santoro, Alessandra Galmonte & Tiziano Agostini - 2017 - Frontiers in Psychology 8.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  40.  26
    An Exploration of Rhythmic Grouping of Speech Sequences by French- and German-Learning Infants.Nawal Abboub, Natalie Boll-Avetisyan, Anjali Bhatara, Barbara Höhle & Thierry Nazzi - 2016 - Frontiers in Human Neuroscience 10.
  41.  22
    The Legend of Death: Two Poetic Sequences ''“ By John Milbank.Craig Hovey - 2010 - Modern Theology 26 (1):152-154.
    Direct download  
     
    Export citation  
     
    Bookmark  
  42. Judged versus perceived causality in visual and action-outcome sequences.S. Huber, A. Schlottmann & M. M. Daum - 1996 - In Enrique Villanueva (ed.), Perception. Ridgeview Pub. Co. pp. 33.
     
    Export citation  
     
    Bookmark   1 citation  
  43.  13
    Editorial: What Next - The Cognition of Sequences.Jaswal Snehlata - 2017 - Frontiers in Psychology 8.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  44. From the axiom of choice to choice sequences.H. Jervell - 1996 - Nordic Journal of Philosophical Logic 1 (1):95-98.
  45.  20
    Implicit learning of predictable sound sequences modulates human brain responses at different levels of the auditory hierarchy.Françoise Lecaignard, Olivier Bertrand, Gérard Gimenez, Jérémie Mattout & Anne Caclin - 2015 - Frontiers in Human Neuroscience 9.
  46.  60
    Children’s imitation of causal action sequences is influenced by statistical and pedagogical evidence.Daphna Buchsbaum, Alison Gopnik, Thomas L. Griffiths & Patrick Shafto - 2011 - Cognition 120 (3):331-340.
    No categories
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   25 citations  
  47.  58
    Causality, Criticality, and Reading Words: Distinct Sources of Fractal Scaling in Behavioral Sequences.Fermín Moscoso del Prado Martín - 2011 - Cognitive Science 35 (5):785-837.
    The finding of fractal scaling (FS) in behavioral sequences has raised a debate on whether FS is a pervasive property of the cognitive system or is the result of specific processes. Inferences about the origins of properties in time sequences are causal. That is, as opposed to correlational inferences reflecting instantaneous symmetrical relations, causal inferences concern asymmetric relations lagged in time. Here, I integrate Granger-causality with inferences about FS. Four simulations illustrate that causal analyses can isolate distinct FS (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  48.  11
    Negotiation of entitlement in proposal sequences.Sae Oshima & Birte Asmuß - 2012 - Discourse Studies 14 (1):67-86.
    Meetings are complex institutional events at which participants recurrently negotiate institutional roles, which are oriented to, renegotiated, and sometimes challenged. With a view to gaining further understanding of the ongoing negotiation of roles at meetings, this article examines one specific recurring feature of meetings: the act of proposing future action. Based on microanalysis of video recordings of two-party strategy meetings, the study shows that participants orient to at least two aspects when making proposals: 1) the acceptance or rejection of the (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   8 citations  
  49.  37
    Dyslexia and configural perception of character sequences.Joseph W. Houpt, Bethany L. Sussman, James T. Townsend & Sharlene D. Newman - 2015 - Frontiers in Psychology 6.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark  
  50.  20
    (1 other version)Some extensions of built‐upness on systems of fundamental sequences.Noriya Kadota & Kiwamu Aoyama - 1990 - Mathematical Logic Quarterly 36 (4):357-364.
1 — 50 / 929