Sciweavers

    APAL
    1998
    51views more  APAL 1998»
    What's the Difference?
    14 years 11 days ago
    What's the Difference?
    Download  www.ptg.org
    James H. Schmerl
    claim paper
    Read More »
    APAL
    1998
    54views more  APAL 1998»
    Computable Isomorphisms, Degree Spectra of Relations, and Scott Families
    14 years 11 days ago
    Computable Isomorphisms, Degree Spectra of Relations, and Scott Families
    Download  www.math.cornell.edu
    Bakhadyr Khoussainov, Richard A. Shore
    claim paper
    Read More »
    APAL
    1998
    56views more  APAL 1998»
    Turing Degrees of Certain Isomorphic Images of Computable Relations
    14 years 11 days ago
    Turing Degrees of Certain Isomorphic Images of Computable Relations
    Download  home.gwu.edu
    A model is computable if its domain is a computable set and its relations and functions are uniformly computable. Let A be a computable model and let R be an extra relation on the ...
    Valentina S. Harizanov
    claim paper
    Read More »
    APAL
    1998
    71views more  APAL 1998»
    On the Finiteness of the Recursive Chromatic Number
    14 years 11 days ago
    On the Finiteness of the Recursive Chromatic Number
    Download  www.cs.umd.edu
    A recursive graph is a graph whose vertex and edges sets are recursive. A highly recursive graph is a recursive graph that also has the following property: one can recursively det...
    William I. Gasarch, Andrew C. Y. Lee
    claim paper
    Read More »
    APAL
    1998
    71views more  APAL 1998»
    Splitting Theorems and the Jump Operator
    14 years 11 days ago
    Splitting Theorems and the Jump Operator
    Download  www.math.cornell.edu
    We investigate the relationship of (jumps of) the degrees of splittings of a computably enumerable set and the degree of the set. We prove that there is a high computably enumerab...
    Rodney G. Downey, Richard A. Shore
    claim paper
    Read More »
    APAL
    1998
    121views more  APAL 1998»
    Computably Enumerable Sets and Quasi-Reducibility
    14 years 11 days ago
    Computably Enumerable Sets and Quasi-Reducibility
    Download  homepages.mcs.vuw.ac.nz
    We consider the computably enumerable sets under the relation of Qreducibility. We first give several results comparing the upper semilattice of c.e. Q-degrees, RQ, ≤Q , under ...
    Rodney G. Downey, Geoffrey LaForte, André N...
    claim paper
    Read More »
    APAL
    1998
    60views more  APAL 1998»
    Classifying Toposes for First-Order Theories
    14 years 11 days ago
    Classifying Toposes for First-Order Theories
    Download  www.brics.dk
    Carsten Butz, Peter Johnstone
    claim paper
    Read More »
    APAL
    1998
    88views more  APAL 1998»
    The Dense Simple Sets are Orbit Complete with Respect to the Simple Sets
    14 years 11 days ago
    The Dense Simple Sets are Orbit Complete with Respect to the Simple Sets
    Download  www.nd.edu
    We prove conjectures of Herrmann and Stob by showing that the dense simple sets are orbit complete w.r.t. the simple sets.
    Peter Cholak
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.