1,300 research outputs found

    On the length of chains of proper subgroups covering a topological group

    Full text link
    We prove that if an ultrafilter L is not coherent to a Q-point, then each analytic non-sigma-bounded topological group G admits an increasing chain <G_a : a of its proper subgroups such that: (i) U_{a in b(L)} G_a=G; and (ii)(ii) For every sigma-bounded subgroup H of G there exists a such that H is a subset of G_a. In case of the group Sym(w) of all permutations of w with the topology inherited from w^w this improves upon earlier results of S. Thomas

    The ultrafilter number for singular cardinals

    Full text link
    We prove the consistency of a singular cardinal λ\lambda with small value of the ultrafilter number uλu_\lambda, and arbitrarily large value of 2λ2^\lambda.Comment: 8 page

    Semantics and Proof Theory of the Epsilon Calculus

    Full text link
    The epsilon operator is a term-forming operator which replaces quantifiers in ordinary predicate logic. The application of this undervalued formalism has been hampered by the absence of well-behaved proof systems on the one hand, and accessible presentations of its theory on the other. One significant early result for the original axiomatic proof system for the epsilon-calculus is the first epsilon theorem, for which a proof is sketched. The system itself is discussed, also relative to possible semantic interpretations. The problems facing the development of proof-theoretically well-behaved systems are outlined.Comment: arXiv admin note: substantial text overlap with arXiv:1411.362

    Explicit Evidence Systems with Common Knowledge

    Full text link
    Justification logics are epistemic logics that explicitly include justifications for the agents' knowledge. We develop a multi-agent justification logic with evidence terms for individual agents as well as for common knowledge. We define a Kripke-style semantics that is similar to Fitting's semantics for the Logic of Proofs LP. We show the soundness, completeness, and finite model property of our multi-agent justification logic with respect to this Kripke-style semantics. We demonstrate that our logic is a conservative extension of Yavorskaya's minimal bimodal explicit evidence logic, which is a two-agent version of LP. We discuss the relationship of our logic to the multi-agent modal logic S4 with common knowledge. Finally, we give a brief analysis of the coordinated attack problem in the newly developed language of our logic

    A Vernacular for Coherent Logic

    Full text link
    We propose a simple, yet expressive proof representation from which proofs for different proof assistants can easily be generated. The representation uses only a few inference rules and is based on a frag- ment of first-order logic called coherent logic. Coherent logic has been recognized by a number of researchers as a suitable logic for many ev- eryday mathematical developments. The proposed proof representation is accompanied by a corresponding XML format and by a suite of XSL transformations for generating formal proofs for Isabelle/Isar and Coq, as well as proofs expressed in a natural language form (formatted in LATEX or in HTML). Also, our automated theorem prover for coherent logic exports proofs in the proposed XML format. All tools are publicly available, along with a set of sample theorems.Comment: CICM 2014 - Conferences on Intelligent Computer Mathematics (2014

    Adding many Baumgartner clubs

    Get PDF
    I define a homogeneous ℵ2–c.c. proper product forcing for adding many clubs of ω1 with finite conditions. I use this forcing to build models of b(ω1)=ℵ2, together with d(ω1) and 2ℵ0 large and with very strong failures of club guessing at ω1

    Displaced but not replaced: the impact of e-learning on academic identities in higher education.

    Get PDF
    Challenges facing universities are leading many to implement institutional strategies to incorporate e-learning rather than leaving its adoption up to enthusiastic individuals. Although there is growing understanding about the impact of e-learning on the student experience, there is less understanding of academics’ perceptions of e-learning and its impact on their identities. This paper explores the changing nature of academic identities revealed through case study research into the implementation of e-learning at one UK university. By providing insight into the lived experiences of academics in a university in which technology is not only transforming access to knowledge but also influencing the balance of power between academic and student in knowledge production and use, it is suggested that academics may experience a jolt to their ‘trajectory of self’ when engaging with e-learning. The potential for e-learning to prompt loss of teacher presence and displacement as knowledge expert may appear to undermine the ontological security of their academic identity

    On the word problem for SP-categories, and the properties of two-way communication

    No full text
    International audienceThe word problem for categories with free products and coproducts (sums), SP-categories, is directly related to the problem of determining the equivalence of certain processes. Indeed, the maps in these categories may be directly interpreted as processes which communicate by two-way channels. The maps of an SP-category may also be viewed as a proof theory for a simple logic with a game theoretic intepretation. The cut-elimination procedure for this logic determines equality only up to certain permuting conversions. As the equality classes under these permuting conversions are finite, it is easy to see that equality between cut-free terms (even in the presence of the additive units) is decidable. Unfortunately, this does not yield a tractable decision algorithm as these equivalence classes can contain exponentially many terms. However, the rather special properties of these free categories -- and, thus, of two-way communication -- allow one to devise a tractable algorithm for equality. We show that, restricted to cut-free terms s,t : X --> A, the decision procedure runs in time polynomial on |X||A|, the product of the sizes of the domain and codomain type

    Deconvolving Instrumental and Intrinsic Broadening in Excited State X-ray Spectroscopies

    Full text link
    Intrinsic and experimental mechanisms frequently lead to broadening of spectral features in excited-state spectroscopies. For example, intrinsic broadening occurs in x-ray absorption spectroscopy (XAS) measurements of heavy elements where the core-hole lifetime is very short. On the other hand, nonresonant x-ray Raman scattering (XRS) and other energy loss measurements are more limited by instrumental resolution. Here, we demonstrate that the Richardson-Lucy (RL) iterative algorithm provides a robust method for deconvolving instrumental and intrinsic resolutions from typical XAS and XRS data. For the K-edge XAS of Ag, we find nearly complete removal of ~9.3 eV FWHM broadening from the combined effects of the short core-hole lifetime and instrumental resolution. We are also able to remove nearly all instrumental broadening in an XRS measurement of diamond, with the resulting improved spectrum comparing favorably with prior soft x-ray XAS measurements. We present a practical methodology for implementing the RL algorithm to these problems, emphasizing the importance of testing for stability of the deconvolution process against noise amplification, perturbations in the initial spectra, and uncertainties in the core-hole lifetime.Comment: 35 pages, 13 figure

    Offscreen and in the chair next to your: conversational agents speaking through actual human bodies

    Get PDF
    his paper demonstrates how to interact with a conversational agent that speaks through an actual human body face-to-face and in person (i.e., offscreen). This is made possible by the cyranoid method: a technique involving a human person speech shadowing for a remote third-party (i.e., receiving their words via a covert audio-relay apparatus and repeating them aloud in real-time). When a person shadows for an artificial conversational agent source, we call the resulting hybrid an “echoborg.” We report a study in which people encountered conversational agents either through a human shadower face-to-face or via a text interface under conditions where they assumed their interlocutor to be an actual person. Our results show that the perception of a conversational agent is dramatically altered when the agent is voiced by an actual, tangible person. We discuss the potential implications this methodology has for the development of conversational agents and general person perception research
    corecore