Order:
Disambiguations
Michael Stob [15]M. Stob [4]Mike Stob [2]
  1.  70
    Mechanical Learners Pay a Price for Bayesianism.Daniel N. Osherson, Michael Stob & Scott Weinstein - 1988 - Journal of Symbolic Logic 53 (4):1245-1251.
  2. Computable Boolean Algebras.Julia F. Knight & Michael Stob - 2000 - Journal of Symbolic Logic 65 (4):1605-1623.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  3.  12
    Splitting Theorems in Recursion Theory.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 65 (1):1-106.
    A splitting of an r.e. set A is a pair A1, A2 of disjoint r.e. sets such that A1 A2 = A. Theorems about splittings have played an important role in recursion theory. One of the main reasons for this is that a splitting of A is a decomposition of A in both the lattice, , of recursively enumerable sets and in the uppersemilattice, R, of recursively enumerable degrees . Thus splitting theor ems have been used to obtain results about (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  4.  47
    Wtt-Degrees and T-Degrees of R.E. Sets.Michael Stob - 1983 - Journal of Symbolic Logic 48 (4):921-930.
    We use some simple facts about the wtt-degrees of r.e. sets together with a construction to answer some questions concerning the join and meet operators in the r.e. degrees. The construction is that of an r.e. Turing degree a with just one wtt-degree in a such that a is the join of a minimal pair of r.e. degrees. We hope to illustrate the usefulness of studying the stronger reducibility orderings of r.e. sets for providing information about Turing reducibility.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  5.  27
    Default Probability.Daniel N. Osherson, Joshua Stern, Ormond Wilkie, Michael Stob & Edward E. Smith - 1991 - Cognitive Science 15 (2):251-269.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   12 citations  
  6.  16
    Structural Interactions of the Recursively Enumerable T- and W-Degrees.R. G. Downey & M. Stob - 1986 - Annals of Pure and Applied Logic 31:205-236.
  7.  31
    Jumps of Hemimaximal Sets.Rod Downey & Mike Stob - 1991 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 37 (8):113-120.
  8.  21
    Jumps of Hemimaximal Sets.Rod Downey & Mike Stob - 1991 - Mathematical Logic Quarterly 37 (8):113-120.
  9.  8
    The Intervals of the Lattice of Recursively Enumerable Sets Determined by Major Subsets.Wolfgang Maass & Michael Stob - 1983 - Annals of Pure and Applied Logic 24 (2):189-212.
  10.  80
    Extrapolating Human Probability Judgment.Daniel Osherson, Edward E. Smith, Tracy S. Myers, Eldar Shafir & Michael Stob - 1994 - Theory and Decision 36 (2):103-129.
    We advance a model of human probability judgment and apply it to the design of an extrapolation algorithm. Such an algorithm examines a person's judgment about the likelihood of various statements and is then able to predict the same person's judgments about new statements. The algorithm is tested against judgments produced by thirty undergraduates asked to assign probabilities to statements about mammals.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  11. A Universal Inductive Inference Machine.Daniel N. Osherson, Michael Stob & Scott Weinstein - 1991 - Journal of Symbolic Logic 56 (2):661-672.
    A paradigm of scientific discovery is defined within a first-order logical framework. It is shown that within this paradigm there exists a formal scientist that is Turing computable and universal in the sense that it solves every problem that any scientist can solve. It is also shown that universal scientists exist for no regular logics that extend first-order logic and satisfy the Löwenheim-Skolem condition.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  12.  23
    Friedberg Splittings of Recursively Enumerable Sets.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 59 (3):175-199.
    A splitting A1A2 = A of an r.e. set A is called a Friedberg splitting if for any r.e. set W with W — A not r.e., W — Ai≠0 for I = 1,2. In an earlier paper, the authors investigated Friedberg splittings of maximal sets and showed that they formed an orbit with very interesting degree-theoretical properties. In the present paper we continue our investigations, this time analyzing Friedberg splittings and in particular their orbits and degrees for various classes (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  13.  9
    Lv Welch.Sg Simpson, Ta Slaman, Steel Jr, Wh Woodin, Ri Soare, M. Stob, C. Spector & Am Turing - 1999 - In Edward R. Griffor (ed.), Handbook of Computability Theory. Elsevier. pp. 153.
    No categories
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark   2 citations  
  14. An Analysis of a Learning Paradigm.Daniel Osherson, M. Stob & S. Weinstein - 1986 - In William Demopoulos (ed.), Language Learning and Concept Acquisition. Ablex. pp. 103.
     
    Export citation  
     
    Bookmark  
  15.  43
    Social Learning and Collective Choice.D. N. Osherson, M. Stob & S. Weinstein - 1987 - Synthese 70 (3):319 - 347.
    To be pertinent to democratic practice, collective choice functions need not apply to all possible constellations of individual preference, but only to those that are humanly possible in an appropriate sense. The present paper develops a theory of humanly possible preference within the context of the mathematical theory of learning. The theory of preference is then exploited in an attempt to resolve Arrow's voting paradox through restriction of the domain of majoritarian choice functions.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  16.  14
    Wolf Robert S.. A Tour Through Mathematical Logic, The Carus Mathematical Monographs, Number 30. The Mathematical Association of America, Washington, DC, 2005, Xv+ 397 Pp. [REVIEW]Michael Stob - 2006 - Bulletin of Symbolic Logic 12 (1):141-142.
  17.  29
    Ideal Learning Machines.Daniel N. Osherson, Michael Stob & Scott Weinstein - 1982 - Cognitive Science 6 (3):277-290.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  18.  12
    Index Sets and Degrees of Unsolvability.Michael Stob - 1982 - Journal of Symbolic Logic 47 (2):241-248.
  19.  2
    Major Subsets and the Lattice of Recursively Enumerable Sets.Michael Stob - 1985 - In Anil Nerode & Richard A. Shore (eds.), Recursion Theory. American Mathematical Society. pp. 107.