Sciweavers

    APAL
    2006
    118views more  APAL 2006»
    Final coalgebras and the Hennessy-Milner property
    13 years 4 months ago
    Final coalgebras and the Hennessy-Milner property
    Download  homepages.mcs.vuw.ac.nz
    The existence of a final coalgebra is equivalent to the existence of a formal logic with a set (small class) of formulas that has the Hennessy-Milner property of distinguishing co...
    Robert Goldblatt
    claim paper
    Read More »
    APAL
    2006
    57views more  APAL 2006»
    Heyting-valued interpretations for Constructive Set Theory
    13 years 4 months ago
    Heyting-valued interpretations for Constructive Set Theory
    Download  www.cs.le.ac.uk
    Nicola Gambino
    claim paper
    Read More »
    APAL
    2006
    52views more  APAL 2006»
    Compactly generated Hausdorff locales
    13 years 4 months ago
    Compactly generated Hausdorff locales
    Download  www.cs.bham.ac.uk
    Martín Hötzel Escardó
    claim paper
    Read More »
    APAL
    2006
    75views more  APAL 2006»
    On self-embeddings of computable linear orderings
    13 years 4 months ago
    On self-embeddings of computable linear orderings
    Download  www.math.uiuc.edu
    The Dushnik
    Rodney G. Downey, Carl G. Jockusch Jr., Joseph S. ...
    claim paper
    Read More »
    APAL
    2006
    67views more  APAL 2006»
    On partial randomness
    13 years 4 months ago
    On partial randomness
    Download  www.cs.auckland.ac.nz
    If x = x1x2
    Cristian S. Calude, Ludwig Staiger, Sebastiaan Ter...
    claim paper
    Read More »
    APAL
    2006
    67views more  APAL 2006»
    Pretopologies and a uniform presentation of sup-lattices, quantales and frames
    13 years 4 months ago
    Pretopologies and a uniform presentation of sup-lattices, quantales and frames
    Download  www.math.unipd.it
    We introduce the notion of infinitary preorder and use it to obtain a predicative presentation of sup-lattices by generators and relations. The method is uniform in that it extend...
    Giulia Battilotti, Giovanni Sambin
    claim paper
    Read More »
    APAL
    2006
    64views more  APAL 2006»
    What can be efficiently reduced to the Kolmogorov-random strings?
    13 years 4 months ago
    What can be efficiently reduced to the Kolmogorov-random strings?
    Download  ftp.cs.rutgers.edu
    We investigate the question of whether one can characterize complexity classes (such as PSPACE or NEXP) in terms of efficient reducibility to the set of Kolmogorovrandom strings R...
    Eric Allender, Harry Buhrman, Michal Koucký
    claim paper
    Read More »
    APAL
    2006
    52views more  APAL 2006»
    A globalisation of the Gelfand duality theorem
    13 years 4 months ago
    A globalisation of the Gelfand duality theorem
    Download  www.maths.sussex.ac.uk
    Bernhard Banaschewski, Christopher J. Mulvey
    claim paper
    Read More »
    « first‹ previous12345
    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.