Switch to: References

Add citations

You must login to add citations.
  1. Models and the dynamics of theory-building in physics. Part I—Modeling strategies.Gérard G. Emch - 2007 - Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics 38 (3):558-585.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Representation and Invariance of Scientific Structures.Patrick Suppes - 2002 - CSLI Publications (distributed by Chicago University Press).
    An early, very preliminary edition of this book was circulated in 1962 under the title Set-theoretical Structures in Science. There are many reasons for maintaining that such structures play a role in the philosophy of science. Perhaps the best is that they provide the right setting for investigating problems of representation and invariance in any systematic part of science, past or present. Examples are easy to cite. Sophisticated analysis of the nature of representation in perception is to be found already (...)
    Download  
     
    Export citation  
     
    Bookmark   143 citations  
  • Products of modal logics. Part 2: relativised quantifiers in classical logic.D. Gabbay & V. Shehtman - 2000 - Logic Journal of the IGPL 8 (2):165-210.
    In the first part of this paper we introduced products of modal logics and proved basic results on their axiomatisability and the f.m.p. In this continuation paper we prove a stronger result - the product f.m.p. holds for products of modal logics in which some of the modalities are reflexive or serial. This theorem is applied in classical first-order logic, we identify a new Square Fragment of the classical logic, where the basic predicates are binary and all quantifiers are relativised, (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Relativizing chaitin's halting probability.Rod Downey, Denis R. Hirschfeldt, Joseph S. Miller & André Nies - 2005 - Journal of Mathematical Logic 5 (02):167-192.
    As a natural example of a 1-random real, Chaitin proposed the halting probability Ω of a universal prefix-free machine. We can relativize this example by considering a universal prefix-free oracle machine U. Let [Formula: see text] be the halting probability of UA; this gives a natural uniform way of producing an A-random real for every A ∈ 2ω. It is this operator which is our primary object of study. We can draw an analogy between the jump operator from computability theory (...)
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • Van Lambalgen's Theorem and High Degrees.Johanna N. Y. Franklin & Frank Stephan - 2011 - Notre Dame Journal of Formal Logic 52 (2):173-185.
    We show that van Lambalgen's Theorem fails with respect to recursive randomness and Schnorr randomness for some real in every high degree and provide a full characterization of the Turing degrees for which van Lambalgen's Theorem can fail with respect to Kurtz randomness. However, we also show that there is a recursively random real that is not Martin-Löf random for which van Lambalgen's Theorem holds with respect to recursive randomness.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Probabilistic issues in statistical mechanics.Gérard G. Emch - 2005 - Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics 36 (2):303-322.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Randomness and computability: Open questions.Joseph S. Miller & André Nies - 2006 - Bulletin of Symbolic Logic 12 (3):390-410.
    It is time for a new paper about open questions in the currently very active area of randomness and computability. Ambos-Spies and Kučera presented such a paper in 1999 [1]. All the question in it have been solved, except for one: is KL-randomness different from Martin-Löf randomness? This question is discussed in Section 6.Not all the questions are necessarily hard—some simply have not been tried seriously. When we think a question is a major one, and therefore likely to be hard, (...)
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  • Calibrating randomness.Rod Downey, Denis R. Hirschfeldt, André Nies & Sebastiaan A. Terwijn - 2006 - Bulletin of Symbolic Logic 12 (3):411-491.
    We report on some recent work centered on attempts to understand when one set is more random than another. We look at various methods of calibration by initial segment complexity, such as those introduced by Solovay [125], Downey, Hirschfeldt, and Nies [39], Downey, Hirschfeldt, and LaForte [36], and Downey [31]; as well as other methods such as lowness notions of Kučera and Terwijn [71], Terwijn and Zambella [133], Nies [101, 100], and Downey, Griffiths, and Reid [34]; higher level randomness notions (...)
    Download  
     
    Export citation  
     
    Bookmark   29 citations  
  • Agreement reducibility.Rachel Epstein & Karen Lange - 2020 - Mathematical Logic Quarterly 66 (4):448-465.
    We introduce agreement reducibility and highlight its major features. Given subsets A and B of, we write if there is a total computable function satisfying for all,.We shall discuss the central role plays in this reducibility and its connection to strong‐hyper‐hyper‐immunity. We shall also compare agreement reducibility to other well‐known reducibilities, in particular s1‐ and s‐reducibility. We came upon this reducibility while studying the computable reducibility of a class of equivalence relations on based on set‐agreement. We end by describing the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • On relative randomness.Antonín Kučera - 1993 - Annals of Pure and Applied Logic 63 (1):61-67.
    Kuera, A., On relative randomness, Annals of Pure and Applied Logic 63 61–67. It is the aim of the paper to answer a question raised by M. van Lambalgen and D. Zambella whether there can be a nonrecursive set A having the property that there is a set B such that B is 1-random relative to A and simultaneously A is recursive in B. We give apositive answer to this question as well as further information about relative randomness.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Models and the dynamics of theory-building in physics. Part I—Modeling strategies.Gérard G. Emch - 2007 - Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics 38 (3):558-585.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • On a decidable generalized quantifier logic corresponding to a decidable fragment of first-order logic.Natasha Alechina - 1995 - Journal of Logic, Language and Information 4 (3):177-189.
    Van Lambalgen (1990) proposed a translation from a language containing a generalized quantifierQ into a first-order language enriched with a family of predicatesR i, for every arityi (or an infinitary predicateR) which takesQxg(x, y1,..., yn) to x(R(x, y1,..., y1) (x,y1,...,yn)) (y 1,...,yn are precisely the free variables ofQx). The logic ofQ (without ordinary quantifiers) corresponds therefore to the fragment of first-order logic which contains only specially restricted quantification. We prove that it is decidable using the method of analytic tableaux. Related (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Typicality à la Russell in Set Theory.Athanassios Tzouvaras - 2022 - Notre Dame Journal of Formal Logic 63 (2).
    We adjust the notion of typicality originated with Russell, which was introduced and studied in a previous paper for general first-order structures, to make it expressible in the language of set theory. The adopted definition of the class ${\rm NT}$ of nontypical sets comes out as a natural strengthening of Russell's initial definition, which employs properties of small (minority) extensions, when the latter are restricted to the various levels $V_\zeta$ of $V$. This strengthening leads to defining ${\rm NT}$ as the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • The K -Degrees, Low for K Degrees,and Weakly Low for K Sets.Joseph S. Miller - 2009 - Notre Dame Journal of Formal Logic 50 (4):381-391.
    We call A weakly low for K if there is a c such that $K^A(\sigma)\geq K(\sigma)-c$ for infinitely many σ; in other words, there are infinitely many strings that A does not help compress. We prove that A is weakly low for K if and only if Chaitin's Ω is A-random. This has consequences in the K-degrees and the low for K (i.e., low for random) degrees. Furthermore, we prove that the initial segment prefix-free complexity of 2-random reals is infinitely (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Rules, Regularities, Randomness. Festschrift for Michiel van Lambalgen.Keith Stenning & Martin Stokhof (eds.) - 2022 - Amsterdam, The Netherlands: Institute for Logic, Language and Computation.
    Festschrift for Michiel van Lambalgen on the occasion of his retirement as professor of logic and cognitive science at the University of Amsterdam.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Open questions about Ramsey-type statements in reverse mathematics.Ludovic Patey - 2016 - Bulletin of Symbolic Logic 22 (2):151-169.
    Ramsey’s theorem states that for any coloring of then-element subsets of ℕ with finitely many colors, there is an infinite setHsuch that alln-element subsets ofHhave the same color. The strength of consequences of Ramsey’s theorem has been extensively studied in reverse mathematics and under various reducibilities, namely, computable reducibility and uniform reducibility. Our understanding of the combinatorics of Ramsey’s theorem and its consequences has been greatly improved over the past decades. In this paper, we state some questions which naturally arose (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Russell's typicality as another randomness notion.Athanassios Tzouvaras - 2020 - Mathematical Logic Quarterly 66 (3):355-365.
    We reformulate slightly Russell's notion of typicality, so as to eliminate its circularity and make it applicable to elements of any first‐order structure. We argue that the notion parallels Martin‐Löf (ML) randomness, in the sense that it uses definable sets in place of computable ones and sets of “small” cardinality (i.e., strictly smaller than that of the structure domain) in place of measure zero sets. It is shown that if the domain M satisfies, then there exist typical elements and only (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Two More Characterizations of K-Triviality.Noam Greenberg, Joseph S. Miller, Benoit Monin & Daniel Turetsky - 2018 - Notre Dame Journal of Formal Logic 59 (2):189-195.
    We give two new characterizations of K-triviality. We show that if for all Y such that Ω is Y-random, Ω is -random, then A is K-trivial. The other direction was proved by Stephan and Yu, giving us the first titular characterization of K-triviality and answering a question of Yu. We also prove that if A is K-trivial, then for all Y such that Ω is Y-random, ≡LRY. This answers a question of Merkle and Yu. The other direction is immediate, so (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Probabilistic issues in statistical mechanics.Gérard G. Emch - 2005 - Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics 36 (2):303-322.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Density-1-bounding and quasiminimality in the generic degrees.Peter Cholak & Gregory Igusa - 2017 - Journal of Symbolic Logic 82 (3):931-957.
    We consider the question “Is every nonzero generic degree a density-1-bounding generic degree?” By previous results [8] either resolution of this question would answer an open question concerning the structure of the generic degrees: A positive result would prove that there are no minimal generic degrees, and a negative result would prove that there exist minimal pairs in the generic degrees.We consider several techniques for showing that the answer might be positive, and use those techniques to prove that a wide (...)
    Download  
     
    Export citation  
     
    Bookmark