Search

The Compton Spectrometer and Imager (COSI) is an upcoming NASA Small Explorer satellite mission scheduled for launch in 2027 and designed to conduct an all-sky survey in the energy range of 0.2-5 MeV. Its instrument consists of an array of germanium detectors surrounded on four sides and underneath by active shields that work as anticoincidence system (ACS) to reduce the contribution of background events in the detectors. These shields are composed of bismuth germanium oxide (BGO), a scintillator material, coupled with Silicon photomultipliers, aimed to collect optical photons produced from interaction of ionizing particles in the BGO and convert them into an electric signal. The reference simulation framework for COSI is MEGAlib, a set of software tools based on the Geant4 toolkit. The interaction point of the incoming radiation, the design of the ACS modules and the BGO surface treatment change the light collection and the overall shielding accuracy. The use of the Geant4 optical physics library, with the simulation of the scintillation process, is mandatory for a more realistic evaluation of the ACS performances. However, including the optical processes in MEGAlib would dramatically increase the computing time of the COSI simulations. We propose the use of a response function encoding the energy resolution and 3D light yield correction based on a separate Geant4 simulation of the ACS that includes the full optical interaction. We present the verification of the Geant4 optical physics library against analytical computations and available laboratory measurements obtained using PMTs as readout device, as a preparatory phase for the simulation of the COSI ACS response., Comment: Proceedings Volume 13093, Space Telescopes and Instrumentation 2024: Ultraviolet to Gamma Ray, Yokohama, Japan

We present SBTrust, a logical framework designed to formalize decision trust. Our logic integrates a doxastic modality with a novel non-monotonic conditional operator that establishes a positive support relation between statements, and is closely related to a known dyadic deontic modality. For SBTrust, we provide semantics, proof theory and complexity results, as well as motivating examples. Compared to existing approaches, our framework seamlessly accommodates the integration of multiple factors in the emergence of trust.

Using time as an additional design parameter in electromagnetism, photonics, and wave physics is attracting considerable research interest, motivated by the possibility to explore physical phenomena and engineering opportunities beyond the physical limits of time-invariant systems. However, despite substantial theoretical promise, the practical realization and observation of many new effects and capabilities leveraging such temporal degrees of freedom have remained elusive. Here, we report the first experimental demonstration of enhanced broadband absorption of electromagnetic waves in a continuously modulated time-varying system, exceeding one of the key theoretical limits of linear time-invariant absorbers. This is achieved by harnessing the frequency-wavevector transitions and enhanced interference effects enabled by breaking both continuous space- and time-translation symmetries in a periodically time-modulated absorbing structure operating at radio-frequencies. Furthermore, we demonstrate broadband coherent wave absorption using a secondary control wave, observing a nearly perfect, reconfigurable, anti-reflection effect over a broad continuous bandwidth. Our findings provide new insights to challenge existing paradigms on the limits of wave absorption and may pave the way to the development of devices that operate in a regime fundamentally beyond the reach of any linear time-invariant system., Comment: 20 pages, 4 figures

The basic system E of dyadic deontic logic proposed by {\AA}qvist offers a simple solution to contrary-to-duty paradoxes and allows to represent norms with exceptions. We investigate E from a proof-theoretical viewpoint. We propose a hypersequent calculus with good properties, the most important of which is cut-elimination, and the consequent subformula property. The calculus is refined to obtain a decision procedure for E and an effective countermodel computation in case of failure of proof search. Using the refined calculus, we prove that validity in E is Co-NP and countermodels have polynomial size.

This paper gives a broad account of the various sequent-based proof formalisms in the proof-theoretic literature. We consider formalisms for various modal and tense logics, intuitionistic logic, conditional logics, and bunched logics. After providing an overview of the logics and proof formalisms under consideration, we show how these sequent-based formalisms can be placed in a hierarchy in terms of the underlying data structure of the sequents. We then discuss how this hierarchy can be traversed using translations. Translating proofs up this hierarchy is found to be relatively easy while translating proofs down the hierarchy is substantially more difficult. Finally, we inspect the prevalent distinction in structural proof theory between 'internal calculi' and 'external calculi'. It is observed that these classes resist a rigorous separation, and we critically assess the properties that (calculi from) these classes are purported to possess.

The rise of powerful AI technology for a range of applications that are sensitive to legal, social, and ethical norms demands decision-making support in presence of norms and regulations. Normative reasoning is the realm of deontic logics, that are challenged by well-known benchmark problems (deontic paradoxes), and lack efficient computational tools. In this paper, we use Answer Set Programming (ASP) for addressing these shortcomings and showcase how to encode and resolve several well-known deontic paradoxes utilizing weak constraints. By abstracting and generalizing this encoding, we present a methodology for translating normative systems in ASP with weak constraints. This methodology is applied to "ethical" versions of Pac-man, where we obtain a comparable performance with related works, but ethically preferable results., Comment: In Proceedings ICLP 2023, arXiv:2308.14898

The Compton Spectrometer and Imager (COSI) is a NASA Small Explorer (SMEX) satellite mission in development with a planned launch in 2027. COSI is a wide-field gamma-ray telescope designed to survey the entire sky at 0.2-5 MeV. It provides imaging, spectroscopy, and polarimetry of astrophysical sources, and its germanium detectors provide excellent energy resolution for emission line measurements. Science goals for COSI include studies of 0.511 MeV emission from antimatter annihilation in the Galaxy, mapping radioactive elements from nucleosynthesis, determining emission mechanisms and source geometries with polarization measurements, and detecting and localizing multimessenger sources. The instantaneous field of view for the germanium detectors is >25% of the sky, and they are surrounded on the sides and bottom by active shields, providing background rejection as well as allowing for detection of gamma-ray bursts and other gamma-ray flares over most of the sky. In the following, we provide an overview of the COSI mission, including the science, the technical design, and the project status., Comment: 8 pages

The Compton Spectrometer and Imager (COSI) is a selected Small Explorer (SMEX) mission launching in 2027. It consists of a large field-of-view Compton telescope that will probe with increased sensitivity the under-explored MeV gamma-ray sky (0.2-5 MeV). We will present the current status of cosipy, a Python library that will perform spectral and polarization fits, image deconvolution, and all high-level analysis tasks required by COSI's broad science goals: uncovering the origin of the Galactic positrons, mapping the sites of Galactic nucleosynthesis, improving our models of the jet and emission mechanism of gamma-ray bursts (GRBs) and active galactic nuclei (AGNs), and detecting and localizing gravitational wave and neutrino sources. The cosipy library builds on the experience gained during the COSI balloon campaigns and will bring the analysis of data in the Compton regime to a modern open-source likelihood-based code, capable of performing coherent joint fits with other instruments using the Multi-Mission Maximum Likelihood framework (3ML). In this contribution, we will also discuss our plans to receive feedback from the community by having yearly software releases accompanied by publicly-available data challenges.

Input/Output (I/O) logic is a general framework for reasoning about conditional norms and/or causal relations. We streamline Bochman's causal I/O logics via proof-search-oriented sequent calculi. Our calculi establish a natural syntactic link between the derivability in these logics and in the original I/O logics. As a consequence of our results, we obtain new, simple semantics for all these logics, complexity bounds, embeddings into normal modal logics, and efficient deduction methods. Our work encompasses many scattered results and provides uniform solutions to various unresolved problems.

Cut-elimination is the bedrock of proof theory with a multitude of applications from computational interpretations to proof analysis. It is also the starting point for important meta-theoretical investigations including decidability, complexity, disjunction property, and interpolation. Unfortunately cut-elimination does not hold for the sequent calculi of most non-classical logics. It is well-known that the key to applications is the subformula property (a typical consequence of cut-elimination) rather than cut-elimination itself. With this in mind we introduce cut-restriction, a procedure to restrict arbitrary cuts to analytic cuts (when elimination is not possible). The algorithm applies to all sequent calculi satisfying language-independent and simple-to-check conditions, and it is obtained by adapting age-old cut-elimination. Our work encompasses existing results in a uniform way, and establishes novel analytic subformula properties., Comment: 13 pages, conference preprint

Cut-elimination is the bedrock of proof theory. It is the algorithm that eliminates cuts from a sequent calculus proof that leads to cut-free calculi and applications. Cut-elimination applies to many logics irrespective of their semantics. Such is its influence that whenever cut-elimination is not provable in a sequent calculus the invariable response has been a move to a richer proof system to regain it. In this paper we investigate a radically different approach to the latter: adapting age-old cut-elimination to restrict the shape of the cut-formulas when elimination is not possible. We tackle the "first level" above cut-free: analytic cuts. Our methodology is applied to the sequent calculi for bi-intuitionistic logic and S5 where analytic cuts are already known to be required. This marks the first steps in a theory of cut-restriction., Comment: 18 pages