Sciweavers

    14084 search results - page 168 / 2817
    » A Theory for Game Theories
    Sort
    View
    ITP
    2006
    101views Mathematics» more  ITP 2006»
    Toward a complexity theory of information systems development
    13 years 8 months ago
    Toward a complexity theory of information systems development
    Download  www.billmckelvey.org
    Purpose
    Hind Benbya, Bill McKelvey
    claim paper
    Read More »
    MLQ
    2006
    84views more  MLQ 2006»
    A note on Bar Induction in Constructive Set Theory
    13 years 8 months ago
    A note on Bar Induction in Constructive Set Theory
    Download  www.amsta.leeds.ac.uk
    Bar Induction occupies a central place in Brouwerian mathematics. This note is concerned with the strength of Bar Induction on the basis of Constructive ZermeloFraenkel Set Theory...
    Michael Rathjen
    claim paper
    Read More »
    AML
    2002
    66views more  AML 2002»
    A primer of simple theories
    13 years 8 months ago
    A primer of simple theories
    Download  www.math.cmu.edu
    We present a self-contained exposition of the basic aspects of simple theories while developing the fundamentals of forking calculus. We expound also the deeper aspects of S. Shela...
    Rami P. Grossberg, José Iovino, Olivier Les...
    claim paper
    Read More »
    JOLLI
    1998
    86views more  JOLLI 1998»
    On the Logic of Theory Change: Contraction without Recovery
    13 years 8 months ago
    On the Logic of Theory Change: Contraction without Recovery
    Download  dme.uma.pt
    The postulate of Recovery, among the six postulates for theory contraction, formulated and studied by Alchourr´on, G¨ardenfors and Makinson is the one that has provoked most cont...
    Eduardo L. Fermé
    claim paper
    Read More »
    RSA
    1998
    59views more  RSA 1998»
    Random unary predicates: Almost sure theories and countable models
    13 years 8 months ago
    Random unary predicates: Almost sure theories and countable models
    Download  comet.lehman.cuny.edu
    Let Un,p be the random unary predicate and Tk the almost sure first-order theory of Un,p under the linear ordering, where k is a positive integer and n−1/k p(n) n−1/(k+1) . F...
    Joel Spencer, Katherine St. John
    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.