Sciweavers

    JSYML
    2007
    41views more  JSYML 2007»
    NP search problems in low fragments of bounded arithmetic
    13 years 4 months ago
    NP search problems in low fragments of bounded arithmetic
    Download  www.newton.ac.uk
    Jan Krajícek, Alan Skelley, Neil Thapen
    claim paper
    Read More »
    JSYML
    2007
    85views more  JSYML 2007»
    Substructural fuzzy logics
    13 years 4 months ago
    Substructural fuzzy logics
    Download  sitemason.vanderbilt.edu
    Substructural fuzzy logics are substructural logics that are complete with respect to algebras whose lattice reduct is the real unit interval [0, 1]. In this paper, we introduce Un...
    George Metcalfe, Franco Montagna
    claim paper
    Read More »
    JSYML
    2007
    52views more  JSYML 2007»
    Maximal chains in the Turing degrees
    13 years 4 months ago
    Maximal chains in the Turing degrees
    Download  math.nju.edu.cn
    We study the problem of existence of maximal chains in the Turing degrees. We show that:
    Chi Tat Chong, Liang Yu
    claim paper
    Read More »
    JSYML
    2007
    74views more  JSYML 2007»
    A power function with a fixed finite gap everywhere
    13 years 4 months ago
    A power function with a fixed finite gap everywhere
    Download  www2.mta.ac.il
    We give an application of the extender based Radin forcing to cardinal arithmetic. Assuming κ is a large enough cardinal we construct a model satisfying 2κ = κ+n together with 2...
    Carmi Merimovich
    claim paper
    Read More »
    JSYML
    2007
    51views more  JSYML 2007»
    Approximate counting in bounded arithmetic
    13 years 4 months ago
    Approximate counting in bounded arithmetic
    Download  www.newton.ac.uk
    Emil Jerábek
    claim paper
    Read More »
    JSYML
    2007
    62views more  JSYML 2007»
    A reduction of the NF consistency problem
    13 years 4 months ago
    A reduction of the NF consistency problem
    Download  users.auth.gr
    We give a necessary and sufficient condition in order that a typeshifting automorphism be constructed on a model of the Theory of Simple Types (TST) by forcing. Namely it is prove...
    Athanassios Tzouvaras
    claim paper
    Read More »
    JSYML
    2007
    51views more  JSYML 2007»
    Forcing indestructibility of set-theoretic axioms
    13 years 4 months ago
    Forcing indestructibility of set-theoretic axioms
    Download  www.math.toronto.edu
    Various theorems for the preservation of set-theoretic axioms under forcing are proved, regarding both forcing axioms and axioms true in the L´evy collapse. These show in particul...
    Bernhard König
    claim paper
    Read More »
    JSYML
    2007
    75views more  JSYML 2007»
    Stable definability and generic relations
    13 years 4 months ago
    Stable definability and generic relations
    Download  www.math.uwaterloo.ca
    Abstract. An amalgamation base p in a simple theory is stably definable if its canonical base is interdefinable with the set of canonical parameters for the φ-definitions of p ...
    Byunghan Kim, Rahim Moosa
    claim paper
    Read More »
    « first‹ previous1234
    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.