7,148 research outputs found

    On paths-based criteria for polynomial time complexity in proof-nets

    Get PDF
    Girard's Light linear logic (LLL) characterized polynomial time in the proof-as-program paradigm with a bound on cut elimination. This logic relied on a stratification principle and a "one-door" principle which were generalized later respectively in the systems L^4 and L^3a. Each system was brought with its own complex proof of Ptime soundness. In this paper we propose a broad sufficient criterion for Ptime soundness for linear logic subsystems, based on the study of paths inside the proof-nets, which factorizes proofs of soundness of existing systems and may be used for future systems. As an additional gain, our bound stands for any reduction strategy whereas most bounds in the literature only stand for a particular strategy.Comment: Long version of a conference pape

    A feasible algorithm for typing in Elementary Affine Logic

    Full text link
    We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction. Following previous references on this topic, the variant of EAL type system we consider (denoted EAL*) is a variant without sharing and without polymorphism. Our algorithm improves over the ones already known in that it offers a better complexity bound: if a simple type derivation for the term t is given our algorithm performs EAL* type inference in polynomial time.Comment: 20 page

    Ludics and its Applications to natural Language Semantics

    Get PDF
    Proofs, in Ludics, have an interpretation provided by their counter-proofs, that is the objects they interact with. We follow the same idea by proposing that sentence meanings are given by the counter-meanings they are opposed to in a dialectical interaction. The conception is at the intersection of a proof-theoretic and a game-theoretic accounts of semantics, but it enlarges them by allowing to deal with possibly infinite processes

    Mental health care in Montana: A system of mistrust

    Get PDF

    Alien Registration- Girard, Ludger V. (Lewiston, Androscoggin County)

    Get PDF
    https://digitalmaine.com/alien_docs/29934/thumbnail.jp

    Beta Irradiation of a Geometrically Metastable Superconducting Strip Detector with a Magnetic Flux Penetration Read-Out

    Full text link
    Geometrical metastability, observed in superconducting type I tin flat strips, has been previously proposed as a principle for particle detection. The energy deposition of an incoming beta-particle induces the rupture of the metastability and consequently the penetration of multiquantum flux tubes into a superconducting tin strip. We present here the first absorption spectra from two beta sources, which demonstrate the linearity and energy-resolution of these detectors (presented at the 6th International Workshop on Low Temperature Detectors for Dark Matter and Neutrinos (LTD-6), Interlaken, Switzerland, Sept. 1995)Comment: Compressed PostScript (filename.ps.Z), 8 pages, 2 figure

    A Logical Product Approach to Zonotope Intersection

    Full text link
    We define and study a new abstract domain which is a fine-grained combination of zonotopes with polyhedric domains such as the interval, octagon, linear templates or polyhedron domain. While abstract transfer functions are still rather inexpensive and accurate even for interpreting non-linear computations, we are able to also interpret tests (i.e. intersections) efficiently. This fixes a known drawback of zonotopic methods, as used for reachability analysis for hybrid sys- tems as well as for invariant generation in abstract interpretation: intersection of zonotopes are not always zonotopes, and there is not even a best zonotopic over-approximation of the intersection. We describe some examples and an im- plementation of our method in the APRON library, and discuss some further in- teresting combinations of zonotopes with non-linear or non-convex domains such as quadratic templates and maxplus polyhedra

    Model-independent Limits from Spin-dependent WIMP Dark Matter Experiments

    Full text link
    Spin-dependent WIMP searches have traditionally presented results within an odd group approximation and by suppressing one of the spin-dependent interaction cross sections. We here elaborate on a model-independent analysis in which spin-dependent interactions with both protons and neutrons are simultaneously considered. Within this approach, equivalent current limits on the WIMP-nucleon interaction at WIMP mass of 50 GeV/c2^{2} are either σp0.7\sigma_{p}\leq0.7 pb, σn0.2\sigma_{n}\leq0.2 pb or ap0.4|a_{p}|\leq0.4, an0.7|a_{n}|\leq0.7 depending on the choice of cross section or coupling strength representation. These limits become less restrictive for either larger or smaller masses; they are less restrictive than those from the traditional odd group approximation regardless of WIMP mass. Combination of experimental results are seen to produce significantly more restrictive limits than those obtained from any single experiment. Experiments traditionally considered spin-independent are moreover found to severely limit the spin-dependent phase space. The extension of this analysis to the case of positive signal experiments is explored.Comment: 12 pages, 12 figures, submitted to Phys. Rev.

    Some Remarks on the Model Theory of Epistemic Plausibility Models

    Full text link
    Classical logics of knowledge and belief are usually interpreted on Kripke models, for which a mathematically well-developed model theory is available. However, such models are inadequate to capture dynamic phenomena. Therefore, epistemic plausibility models have been introduced. Because these are much richer structures than Kripke models, they do not straightforwardly inherit the model-theoretical results of modal logic. Therefore, while epistemic plausibility structures are well-suited for modeling purposes, an extensive investigation of their model theory has been lacking so far. The aim of the present paper is to fill exactly this gap, by initiating a systematic exploration of the model theory of epistemic plausibility models. Like in 'ordinary' modal logic, the focus will be on the notion of bisimulation. We define various notions of bisimulations (parametrized by a language L) and show that L-bisimilarity implies L-equivalence. We prove a Hennesy-Milner type result, and also two undefinability results. However, our main point is a negative one, viz. that bisimulations cannot straightforwardly be generalized to epistemic plausibility models if conditional belief is taken into account. We present two ways of coping with this issue: (i) adding a modality to the language, and (ii) putting extra constraints on the models. Finally, we make some remarks about the interaction between bisimulation and dynamic model changes.Comment: 19 pages, 3 figure

    Time-dependent photoionization of azulene: Competition between ionization and relaxation in highly excited states

    Get PDF
    Pump-probe photoionization has been used to map the relaxation processes taking place from highly vibrationally excited levels of the S2 state of azulene, populated directly or via internal conversion from the S4 state. Photoelectron spectra obtained by 1+2’ two-color time-resolved photoelectron imaging are invariant (apart from in intensity) to the pump-probe time delay and to pump wavelength. This reveals a photoionization process which is driven by an unstable electronic state (e.g. doubly excited state) lying below the ionization potential. This state is postulated to be populated by a probe transition from S2 and to rapidly relax via an Auger like process onto highly vibrationally excited Rydberg states. This accounts for the time invariance of the photoelectron spectrum. The intensity of the photoelectron spectrum is proportional to the population in S2. An exponential energy gap law is used to describe the internal conversion rate from S2 to S0. The vibronic coupling strength is found to be larger than 60±5 μeV
    corecore