163 research outputs found

    Topological partition relations to the form omega^*-> (Y)^1_2

    Full text link
    Theorem: The topological partition relation omega^{*}-> (Y)^{1}_{2} (a) fails for every space Y with |Y| >= 2^c ; (b) holds for Y discrete if and only if |Y| <= c; (c) holds for certain non-discrete P-spaces Y ; (d) fails for Y= omega cup {p} with p in omega^{*} ; (e) fails for Y infinite and countably compact

    A Generalization of Martin's Axiom

    Get PDF
    We define the 1.5\aleph_{1.5} chain condition. The corresponding forcing axiom is a generalization of Martin's Axiom and implies certain uniform failures of club--guessing on ω1\omega_1 that don't seem to have been considered in the literature before.Comment: 36 page

    Quantum energy inequalities and local covariance II: Categorical formulation

    Full text link
    We formulate Quantum Energy Inequalities (QEIs) in the framework of locally covariant quantum field theory developed by Brunetti, Fredenhagen and Verch, which is based on notions taken from category theory. This leads to a new viewpoint on the QEIs, and also to the identification of a new structural property of locally covariant quantum field theory, which we call Local Physical Equivalence. Covariant formulations of the numerical range and spectrum of locally covariant fields are given and investigated, and a new algebra of fields is identified, in which fields are treated independently of their realisation on particular spacetimes and manifestly covariant versions of the functional calculus may be formulated.Comment: 27 pages, LaTeX. Further discussion added. Version to appear in General Relativity and Gravitatio

    Changing a semantics: opportunism or courage?

    Full text link
    The generalized models for higher-order logics introduced by Leon Henkin, and their multiple offspring over the years, have become a standard tool in many areas of logic. Even so, discussion has persisted about their technical status, and perhaps even their conceptual legitimacy. This paper gives a systematic view of generalized model techniques, discusses what they mean in mathematical and philosophical terms, and presents a few technical themes and results about their role in algebraic representation, calibrating provability, lowering complexity, understanding fixed-point logics, and achieving set-theoretic absoluteness. We also show how thinking about Henkin's approach to semantics of logical systems in this generality can yield new results, dispelling the impression of adhocness. This paper is dedicated to Leon Henkin, a deep logician who has changed the way we all work, while also being an always open, modest, and encouraging colleague and friend.Comment: 27 pages. To appear in: The life and work of Leon Henkin: Essays on his contributions (Studies in Universal Logic) eds: Manzano, M., Sain, I. and Alonso, E., 201

    Determinacy analysis for logic programs using mode and type information

    Get PDF
    We propose an analysis for detecting procedures and goals that are deterministic (i.e. that produce at most one solution), or predicates whose clause tests are mutually exclusive (which implies that at most one of their clauses will succeed) even if they are not deterministic (because they cali other predicates that can produce more than one solution). Applications of such determinacy information include detecting programming errors, performing certain high-level program transformations for improving search efñciency, optimizing low level code generation and parallel execution, and estimating tighter upper bounds on the computational costs of goals and data sizes, which can be used for program debugging, resource consumption and granularity control, etc. We have implemented the analysis and integrated it in the CiaoPP system, which also infers automatically the mode and type information that our analysis takes as input. Experiments performed on this implementation show that the analysis is fairly accurate and efncient
    corecore