Search

While there is a well developed theory of locally solid topologies, many important convergences in vector lattice theory are not topological. Yet they share many properties with locally solid topologies. Building upon the theory of convergence structures, we develop a theory of locally solid convergences, which generalize locally solid topologies but also includes many important non-topological convergences on a vector lattice. We consider some natural modifications of such structures: unbounded, bounded, and Choquet. We also study some specific convergences in vector lattices from the perspective of locally solid convergence structures., Comment: 71 pages

Graph-based frames have been introduced as a logical framework which internalizes an inherent boundary to knowability. They also support the interpretation of lattice-based (modal) logics as hyper-constructive logics of evidential reasoning. Conceptually, the present paper proposes graph-based frames as a formal framework suitable for generalizing Pawlak's rough set theory to a setting in which inherent limits to knowability need to be considered. Technically, the present paper establishes systematic connections between the first-order correspondents of Sahlqvist modal reduction principles on Kripke frames, and on the more general relational environments of graph-based and polarity-based frames. This work is part of a research line aiming at: (a) comparing and inter-relating the various (first-order) conditions corresponding to a given (modal) axiom in different relational semantics (b) recognizing when first-order sentences in the frame-correspondence languages of different relational structures encode the same modal content (c) meaningfully transferring relational properties across different semantic contexts. The present paper develops these results for the graph-based semantics, polarity-based semantics, and all Sahlqvist modal reduction principles. As an application, we study well known modal axioms in rough set theory on graph-based frames and show that, although these axioms correspond to different first-order conditions on graph-based frames, their intuitive meaning is retained.This allows us to introduce the notion of hyperconstructivist approximation spaces as the subclass of graph-based frames defined by the first-order conditions corresponding to the same modal axioms defining classical generalized approximation spaces, and to transfer the properties and the intuitive understanding of different approximation spaces to graph-based frames.

We have measured the gamma-ray line production cross sections in proton-induced nuclear reactions on various target nuclei abundant in astrophysical sites over the incident energy range of Ep = 30 - 200 MeV. We carried out experimental campaigns in joint collaboration at the K = 200 cyclotron of iThemba LABS using a high-energy resolution, high-efficiency detection array composed of 8 Compton-suppressed clover detectors comprising 32 HP-Ge crystals for recording the gamma-ray spectra. In the current paper, we focus on de-excitation lines produced in proton irradiations of natC and Mylar targets. In particular, on the prominent 4.439 and 6.129 MeV lines of $^{12}$C and $^{16}$O which are among the strongest lines emitted in solar flares and in interactions of low-energy cosmic rays with the gas and dust of the inner galaxy. We report new gamma-ray production experimental cross section data for ten nuclear lines that we compare to previous low-energy data sets from the literature, to the predictions of the TALYS code of modern nuclear reactions and to a semi-empirical compilation. In first approach, performing calculations with default input parameters of TALYS we observed substantial deviations between the predicted cross sections and experimental data. Then, using modified optical model potential and nuclear level deformation parameters as input data we generated theoretical excitation functions for the above two main lines fully consistent with experimental data. In contrast, the experimental data sets for the other eight analyzed lines from the two proton-irradiated targets exhibit significant deviations with the predicted cross section values. We also report line-shape experimental data for the line complex observed at $E_g$ = 4.44 MeV in irradiations of the two targets. Finally, we emphasize the astrophysical implications of our results., Comment: 44 pages, 7 tables, 13 figures

By exploiting the algebraic and order theoretic mechanisms behind Sahlqvist correspondence, the theory of unified correspondence provides powerful tools for correspondence and canonicity across different semantics and signatures, covering all the logics whose algebraic semantics are given by normal (distributive) lattice expansions (referred to as (D)LEs). In particular, the algorithm ALBA, parametric in each (D)LE, effectively computes the first order correspondents of (D)LE-inductive formulas. We present an algorithm that makes use of ALBA's rules and algebraic language to invert its steps in the DLE setting; therefore effectively computing an inductive formula starting from its first order correspondent.

The present paper establishes systematic connections among the first-order correspondents of Sahlqvist modal reduction principles in various relational semantic settings which include crisp and many-valued Kripke frames, and crisp and many-valued polarity-based frames (aka enriched formal contexts). Building on unified correspondence theory, we aim at introducing a theoretical environment which makes it possible to: (a) compare and inter-relate the various frame correspondents (in different relational settings) of any given Sahlqvist modal reduction principle; (b) recognize when first-order sentences in the frame-correspondence languages of different types of relational structures encode the same "modal content"; (c) meaningfully transfer and represent well known relational properties such as reflexivity, transitivity, symmetry, seriality, confluence, density, across different semantic contexts. These results can be understood as a first step in a research program aimed at making correspondence theory not just (methodologically) unified, but also (effectively) parametric., Comment: This is a revision of the previous version

The non-deterministic algorithmic procedure PEARL (an acronym for `Propositional variables Elimination Algorithm for Relevance Logic') has been recently developed for computing first-order equivalents of formulas of the language of relevance logics RL in terms of the standard Routley-Meyer relational semantics. It succeeds on a large class of axioms of relevance logics, including all so-called inductive formulas. In the present work we re-interpret PEARL from an algebraic perspective, with its rewrite rules seen as manipulating quasi-inequalities interpreted over Urquhart's relevant algebras, and report on its recent Python implementation. We also show that all formulae on which PEARL succeeds are canonical, i.e., preserved under canonical extensions of relevant algebras. This generalizes the "canonicity via correspondence" result in Urquhart's 1996 paper. We also indicate that, with minor modifications, PEARL can be applied to bunched implication algebras and relation algebras., Comment: 27 pages

In this paper we characterize surjective isometries on certain classes of non-commutative spaces associated with semi-finite von Neumann algebras: the Lorentz spaces $L^{w,1}$, as well as the spaces $L^1+L^\infty$ and $L^1\cap L^\infty$. The technique used in all three cases relies on characterizations of the extreme points of the unit balls of these spaces. Of particular interest is that the representations of isometries obtained in this paper are global representations., Comment: arXiv admin note: substantial text overlap with arXiv:1907.07619

We discuss an ongoing line of research in the relational (non topological) semantics of non-distributive logics. The developments we consider are technically rooted in dual characterization results and insights from unified correspondence theory. However, they also have broader, conceptual ramifications for the intuitive meaning of non-distributive logics, which we explore., Comment: 36 pages

Gamma-ray production cross section excitation functions have been measured for $30$, $42$, $54$ and $66$ MeV proton beams accelerated onto targets of astrophysical interest, $^{nat}$C, C + O (Mylar), $^{nat}$Mg, $^{nat}$Si and $^{56}$Fe, at the Sector Separated Cyclotron (SSC) of iThemba LABS (near Cape Town, South Africa). The AFRODITE array equipped with 8 Compton suppressed HPGe clover detectors was used to record $\gamma$-ray data. For known, intense $\gamma$-ray lines the previously reported experimental data measured up to $E_{p}\simeq$ $25$ MeV at the Washington and Orsay tandem accelerators were extended to higher proton energies. Our experimental data for the last 3 targets are reported here and discussed with respect to previous data and the Murphy \textit{et al.} compilation [ApJS 183, 142 (2009)], as well as to predictions of the nuclear reaction code TALYS. The overall agreement between theory and experiment obtained in first-approach calculations using default input parameters of TALYS has been appreciably improved by using modified optical model potential (OMP), deformation, and level density parameters. The OMP parameters have been extracted from theoretical fits to available experimental elastic/inelastic nucleon scattering angular distribution data by means of the coupled-channels reaction code OPTMAN. Experimental data for several new $\gamma$-ray lines are also reported and discussed. The astrophysical implications of our results are emphasised., Comment: 22 pages, 10 figures, five tables; regular article submitted to Phys Rev C

New radio (MeerKAT and Parkes) and X-ray (XMM-Newton, Swift, Chandra, and NuSTAR) observations of PSR J1622-4950 indicate that the magnetar, in a quiescent state since at least early 2015, reactivated between 2017 March 19 and April 5. The radio flux density, while variable, is approximately 100x larger than during its dormant state. The X-ray flux one month after reactivation was at least 800x larger than during quiescence, and has been decaying exponentially on a 111+/-19 day timescale. This high-flux state, together with a radio-derived rotational ephemeris, enabled for the first time the detection of X-ray pulsations for this magnetar. At 5%, the 0.3-6 keV pulsed fraction is comparable to the smallest observed for magnetars. The overall pulsar geometry inferred from polarized radio emission appears to be broadly consistent with that determined 6-8 years earlier. However, rotating vector model fits suggest that we are now seeing radio emission from a different location in the magnetosphere than previously. This indicates a novel way in which radio emission from magnetars can differ from that of ordinary pulsars. The torque on the neutron star is varying rapidly and unsteadily, as is common for magnetars following outburst, having changed by a factor of 7 within six months of reactivation., Comment: Published in ApJ (2018 April 5); 13 pages, 4 figures

This paper continues the investigation of the logic of competing theories, be they scientific, social, political etc. We introduce a many-valued, multi-type modal language which we endow with relational semantics based on enriched reflexive graphs, inspired by Plo\v{s}\v{c}ica's representation of general lattices. We axiomatize the resulting many-valued, non-distributive modal logic of these structures and prove a completeness theorem. We illustrate the application of this logic through a case study in which we model competition among interacting political promises and social demands within an arena of political parties social groups., Comment: 24 pages

We introduce a complete many-valued semantics for basic normal lattice-based modal logic. This relational semantics is grounded on many-valued formal contexts from Formal Concept Analysis. We discuss an interpretation and possible applications of this logical framework for categorization theory to the formal analysis of multi-market competition., Comment: 24 pages

In this article we characterize the extreme points of the unit ball of a non-commutative (quantum) Lorentz space associated with a semi-finite von Neumann algebra. This enables us to show that surjective isometries between non-commutative Lorentz spaces are projection disjointness preserving and finiteness preserving, which facilitates a characterization of the structure of these isometries., Comment: The paper entitled "Extreme point methods in the study of isometries on certain non-commutative spaces" (arXiv identifier: 2007.02324) is a significantly revised, updated and extended version of this article

In this article we show that positive surjective isometries between symmetric spaces associated with semi-finite von Neumann algebras are projection disjointness preserving if they are finiteness preserving. This is subsequently used to obtain a structural description of such isometries. Furthermore, it is shown that if the initial symmetric space is a strongly symmetric space with absolutely continuous norm, then a similar structural description can be obtained without requiring positivity of the isometry.

The present paper proposes a novel way to unify Rough Set Theory and Formal Concept Analysis. Our method stems from results and insights developed in the algebraic theory of modal logic, and is based on the idea that Pawlak's original approximation spaces can be seen as special instances of enriched formal contexts, i.e. relational structures based on formal contexts from Formal Concept Analysis.

We introduce a complete many-valued semantics for two normal lattice-based modal logics. This semantics is based on reflexive many-valued graphs. We discuss an interpretation and possible applications of this logical framework in the context of the formal analysis of the interaction between (competing) scientific theories., Comment: To appear in the proceedings of EUSFLAT 2019. Pre-final version with expanded proofs

By 'informational entropy', we understand an inherent boundary to knowability, due e.g. to perceptual, theoretical, evidential or linguistic limits. In this paper, we discuss a logical framework in which this boundary is incorporated into the semantic and deductive machinery, and outline how this framework can be used to model various situations in which informational entropy arises., Comment: To appear in proceedings of WoLLIC 2019, Remark 1 added

We show that a map between projection lattices of semi-finite von Neumann algebras can be extended to a Jordan $*$-homomorphism between the von Neumann algebras if this map is defined in terms of the support projections of images (under the linear map) of projections and the images of orthogonal projections have orthogonal support projections. This has numerous fundamental applications in the study of isometries and composition operators on quantum symmetric spaces and is of independent interest, since it provides a partial generalization of Dye's Theorem without the requirement that the initial von Neumann algebra be free of type $I_2$ summands.

We prove a uniform version of the Goldblatt-Thomason theorem for logics algebraically captured by normal lattice expansions (normal LE-logics).

There are two natural and well-studied approaches to temporal ontology and reasoning: point-based and interval-based. Usually, interval-based temporal reasoning deals with points as a particular case of duration-less intervals. A recent result by Balbiani, Goranko, and Sciavicco presented an explicit two-sorted point-interval temporal framework in which time instants (points) and time periods (intervals) are considered on a par, allowing the perspective to shift between these within the formal discourse. We consider here two-sorted first-order languages based on the same principle, and therefore including relations, as first studied by Reich, among others, between points, between intervals, and inter-sort. We give complete classifications of its sub-languages in terms of relative expressive power, thus determining how many, and which, are the intrinsically different extensions of two-sorted first-order logic with one or more such relations. This approach roots out the classical problem of whether or not points should be included in a interval-based semantics. In this Part II, we deal with the cases of all dense and the case of all unbounded linearly ordered sets., Comment: This is Part II of the paper `An Integrated First-Order Theory of Points and Intervals over Linear Orders' arXiv:1805.08425v2. Therefore the introduction, preliminaries and conclusions of the two papers are the same. This version implements a few minor corrections and an update to the affiliation of the second author

Categorization systems are widely studied in psychology, sociology, and organization theory as information-structuring devices which are critical to decision-making processes. In the present paper, we introduce a sound and complete epistemic logic of categories and agents' categorical perception. The Kripke-style semantics of this logic is given in terms of data structures based on two domains: one domain representing objects (e.g. market products) and one domain representing the features of the objects which are relevant to the agents' decision-making. We use this framework to discuss and propose logic-based formalizations of some core concepts from psychological, sociological, and organizational research in categorization theory., Comment: In Proceedings TARK 2017, arXiv:1707.08250

The present paper contributes to the development of the mathematical theory of epistemic updates using the tools of duality theory. Here we focus on Probabilistic Dynamic Epistemic Logic (PDEL). We dually characterize the product update construction of PDEL-models as a certain construction transforming the complex algebras associated with the given model into the complex algebra associated with the updated model. Thanks to this construction, an interpretation of the language of PDEL can be defined on algebraic models based on Heyting algebras. This justifies our proposal for the axiomatization of the intuitionistic counterpart of PDEL, of which prove soundness and completeness with respect to algebraic probabilistic epistemic models., Comment: Final version of the paper

The present paper proposes a new introductory treatment of the very well known Sahlqvist correspondence theory for classical modal logic. The first motivation for the present treatment is {\em pedagogical}: classical Sahlqvist correspondence is presented in a uniform and modular way, and, unlike the existing textbook accounts, extends itself to a class of formulas laying outside the Sahlqvist class proper. The second motivation is {\em methodological}: the present treatment aims at highlighting the {\em algebraic} and {\em order-theoretic} nature of the correspondence mechanism. The exposition remains elementary and does not presuppose any previous knowledge or familiarity with the algebraic approach to logic. However, it provides the underlying motivation and basic intuitions for the recent developments in the Sahlqvist theory of nonclassical logics, which compose the so-called unified correspondence theory.

We introduce hybrid algebras as algebraic semantics for hybrid languages with nominals and, possibly, the satisfaction operator. We establish a duality between hybrid algebras and the descriptive two-sorted general frames of Ten Cate. We show that all axiomatic extensions of the basic hybrid logics, with or without the satisfaction operator, are complete with respect to their classes of hybrid algebras. Moreover, we show that by adding the usual non-orthodox rules to these logics, they become complete with respect to their classes of permeated hybrid algebras, corresponding to strongly descriptive two-sorted general frames., Comment: 25 pages

RS-frames were introduced by Gehrke as relational semantics for substructural logics. They are two-sorted structures, based on RS-polarities with additional relations used to interpret modalities. We propose an intuitive, epistemic interpretation of RS-frames for modal logic, in terms of categorization systems and agents' subjective interpretations of these systems. Categorization systems are a key to any decision-making process and are widely studied in the social and management sciences. A set of objects together with a set of properties and an incidence relation connecting objects with their properties forms a polarity which can be `pruned' into an RS-polarity. Potential categories emerge as the Galois-stable sets of this polarity, just like the concepts of Formal Concept Analysis. An agent's beliefs about objects and their properties (which might be partial) is modelled by a relation which gives rise to a normal modal operator expressing the agent's beliefs about category membership. Fixed-points of the iterations of the belief modalities of all agents are used to model categories constructed through social interaction., Comment: References updated

We extend the theory of unified correspondence to a very broad class of logics with algebraic semantics given by varieties of normal lattice expansions (LEs), also known as `lattices with operators'. Specifically, we introduce a very general syntactic definition of the class of Sahlqvist formulas and inequalities, which applies uniformly to each LE-signature and is given purely in terms of the order-theoretic properties of the algebraic interpretations of the logical connectives. Together with this, we introduce a variant of the algorithm ALBA, specific to the setting of LEs, which effectively computes first-order correspondents of LE-inequalities, and is guaranteed to succeed on a wide class of inequalities (the so-called inductive inequalities) which significantly extend the Sahlqvist class. Further, we show that every inequality on which ALBA succeeds is canonical. The projection of these results yields state-of-the-art correspondence theory for many well known substructural logics, such as the Lambek calculus and its extensions, the Lambek-Grishin calculus, the logic of (not necessarily distributive) de Morgan lattices, and the multiplicative-additive fragment of linear logic., Comment: This article is part of a research program called "Unified Correspondence". There is bound to be textual overlap with our paper on Constructive Canonicity of Inductive Inequalities (arXiv:1603.08341). The same proof strategy works in both cases, but there are many subtle yet crucial differences

We prove the canonicity of inductive inequalities in a constructive meta-theory, for classes of logics algebraically captured by varieties of normal and regular lattice expansions. This result encompasses Ghilardi-Meloni's and Suzuki's constructive canonicity results for Sahlqvist formulas and inequalities, and is based on an application of the tools of unified correspondence theory. Specifically, we provide an alternative interpretation of the language of the algorithm ALBA for lattice expansions: nominal and conominal variables are respectively interpreted as closed and open elements of canonical extensions of normal/regular lattice expansions, rather than as completely join-irreducible and meet-irreducible elements of perfect normal/regular lattice expansions. We show the correctness of ALBA with respect to this interpretation. From this fact, the constructive canonicity of the inequalities on which ALBA succeeds follows by an adaptation of the standard argument. The claimed result then follows as a consequence of the success of ALBA on inductive inequalities.

In recent years, unified correspondence has been developed as a generalized Sahlqvist theory which applies uniformly to all signatures of normal and regular (distributive) lattice expansions. This includes a general definition of the Sahlqvist and inductive formulas and inequalities in every such signature, based on order theory. This definition covers in particular all (bi-)intuitionistic modal logics. The theory of these logics has been intensively studied over the past seventy years in connection with classical polyadic modal logics, using suitable versions of Goedel-McKinsey-Tarski translations as main tools. It is therefore natural to ask (1) whether a general perspective on Goedel-McKinsey-Tarski translations can be attained, also based on order-theoretic principles like those underlying the general definition of Sahlqvist and inductive formulas and inequalities, which accounts for the known Goedel-McKinsey-Tarski translations and applies uniformly to all signatures of normal (distributive) lattice expansions; (2) whether this general perspective can be used to transfer correspondence and canonicity theorems for Sahlqvist and inductive formulas and inequalities in all signatures described above under Goedel-McKinsey-Tarski translations. In the present paper, we set out to answer these questions. We answer (1) in the affirmative; as to (2), we prove the transfer of the correspondence theorem for inductive inequalities of arbitrary signatures of normal distributive lattice expansions. We also prove the transfer of canonicity for inductive inequalities, but only restricted to arbitrary normal modal expansions of bi-intuitionistic logic. We also analyze the difficulties involved in obtaining the transfer of canonicity outside this setting, and indicate a route to extend the transfer of canonicity to all signatures of normal distributive lattice expansions.

We prove the algorithmic canonicity of two classes of $\mu$-inequalities in a constructive meta-theory of normal lattice expansions. This result simultaneously generalizes Conradie and Craig's canonicity for $\mu$-inequalities based on a bi-intuitionistic bi-modal language, and Conradie and Palmigiano's constructive canonicity for inductive inequalities (restricted to normal lattice expansions to keep the page limit). Besides the greater generality, the unification of these strands smoothes the existing treatments for the canonicity of $\mu$-formulas and inequalities. In particular, the rules of the algorithm ALBA used for this result have exactly the same formulation as those of Conradie and Palmigiano, with no additional rule added specifically to handle the fixed point binders. Rather, fixed points are accounted for by certain restrictions on the application of the rules, concerning the order-theoretic properties of the term functions associated with the formulas to which the rules are applied., Comment: arXiv admin note: text overlap with arXiv:1408.6367

We generalize Venema's result on the canonicity of the additivity of positive terms, from classical modal logic to a vast class of logics the algebraic semantics of which is given by varieties of normal distributive lattice expansions (normal DLEs), aka `distributive lattices with operators'. We provide two contrasting proofs for this result: the first is along the lines of Venema's pseudo-correspondence argument but using the insights and tools of unified correspondence theory, and in particular the algorithm ALBA; the second closer to the style of J\'onsson. Using insights gleaned from the second proof, we define a suitable enhancement of the algorithm ALBA, which we use prove the canonicity of certain syntactically defined classes of DLE-inequalities (called the meta-inductive inequalities), relative to the structures in which the formulas asserting the additivity of some given terms are valid.

We investigate the canonicity of inequalities of the intuitionistic mu-calculus. The notion of canonicity in the presence of fixed point operators is not entirely straightforward. In the algebraic setting of canonical extensions we examine both the usual notion of canonicity and what we will call tame canonicity. This latter concept has previously been investigated for the classical mu-calculus by Bezhanishvili and Hodkinson. Our approach is in the spirit of Sahlqvist theory. That is, we identify syntactically-defined classes of inequalities, namely the restricted inductive and tame inductive inequalities, which are, respectively, canonical or tame canonical. Our approach is to use an algorithm which processes inequalities with the aim of eliminating propositional variables. The algorithm we introduce is closely related to the algorithms ALBA and mu-ALBA studied by Conradie, Palmigiano, et al. It is based on a calculus of rewrite rules, the soundness of which rests upon the way in which algebras embed into their canonical extensions and the order-theoretic properties of the latter. We show that the algorithm succeeds on every restricted inductive inequality by means of a so-called proper run, and that this is sufficient to guarantee their canonicity. Likewise, we are able to show that the algorithm succeeds on every tame inductive inequality by means of a so-called tame run. In turn, this guarantees their tame canonicity.

Modal formulae express monadic second-order properties on Kripke frames, but in many important cases these have first-order equivalents. Computing such equivalents is important for both logical and computational reasons. On the other hand, canonicity of modal formulae is important, too, because it implies frame-completeness of logics axiomatized with canonical formulae. Computing a first-order equivalent of a modal formula amounts to elimination of second-order quantifiers. Two algorithms have been developed for second-order quantifier elimination: SCAN, based on constraint resolution, and DLS, based on a logical equivalence established by Ackermann. In this paper we introduce a new algorithm, SQEMA, for computing first-order equivalents (using a modal version of Ackermann's lemma) and, moreover, for proving canonicity of modal formulae. Unlike SCAN and DLS, it works directly on modal formulae, thus avoiding Skolemization and the subsequent problem of unskolemization. We present the core algorithm and illustrate it with some examples. We then prove its correctness and the canonicity of all formulae on which the algorithm succeeds. We show that it succeeds not only on all Sahlqvist formulae, but also on the larger class of inductive formulae, introduced in our earlier papers. Thus, we develop a purely algorithmic approach to proving canonical completeness in modal logic and, in particular, establish one of the most general completeness results in modal logic so far., Comment: 26 pages, no figures, to appear in the Logical Methods in Computer Science