Radio continuum imaging of the R CrA star-forming region with the ATCA

The aim of this study is to investigate the nature of radio sources associated with young stellar objects (YSOs) belonging to the R CrA cluster. By combining the centimetre radio data with the wealth of shorter wavelength data accumulated recently we wish to refine estimates of the evolutionary stages of the YSOs. Fluxes and spectral indices for the brightest radio sources were derived from the observations at 3, 6, and 20 cm using the ATCA. Seven of detected sources can be assigned to YSOs, which have counterparts in the X-rays, infrared or submm. One of the YSOs, Radio Source 9, is a Class 0 candidate, and another, IRS 7B, is suggested to be in the Class 0/I transition stage. IRS 7B is associated with extended radio lobes at 6 and 20 cm. The lobes may have a gyrosynchrotron emission component, which could be understood in terms of Fermi accleration in shocks. The Class I objects detected here seem to be a mixed lot. One of these, the wide binary IRS 5, shows a negative spectral index, rapid variability, and a high degree of circular polarisation with $V/I\approx33$ % on one of the days of observation. These signs of magnetic activity suggest that at least one of the binary components has advanced beyond the Class I stage. The radio source without YSO assigment, Radio Source 5, has been suggested to be a brown dwarf. The radio properties, in particular its persistent strong emission, do not support this classification. The radio characteristics of the detected YSOs roughly agree with the scheme where the dominant emission mechanism changes with age. The heterogeneity of the Class I group can possibly be explained by a drastic decline in the jet activity during this stage, which also changes the efficiency of free-free absorption around the protostar.Comment: Accepted for publication in A&A (8 pages, 4 figures, 4 tables

Polyteam Semantics

Team semantics is the mathematical framework of modern logics of dependence and independence in which formulae are interpreted by sets of assignments (teams) instead of single assignments as in first-order logic. In order to deepen the fruitful interplay between team semantics and database dependency theory, we define "Polyteam Semantics" in which formulae are evaluated over a family of teams. We begin by defining a novel polyteam variant of dependence atoms and give a finite axiomatisation for the associated implication problem. We also characterise the expressive power of poly-dependence logic by properties of polyteams that are downward closed and definable in existential second-order logic (ESO). The analogous result is shown to hold for poly-independence logic and all ESO-definable properties.Peer reviewe

Dependence Logic with Generalized Quantifiers: Axiomatizations

We prove two completeness results, one for the extension of dependence logic by a monotone generalized quantifier Q with weak interpretation, weak in the meaning that the interpretation of Q varies with the structures. The second result considers the extension of dependence logic where Q is interpreted as "there exists uncountable many." Both of the axiomatizations are shown to be sound and complete for FO(Q) consequences.Comment: 17 page

A remark on the expressivity of asynchronous TeamLTL and HyperLTL

Linear temporal logic (LTL) is used in system verification to write formal specifications for reactive systems. However, some relevant properties, e.g. non-inference in information flow security, cannot be expressed in LTL. A class of such properties that has recently received ample attention is known as hyperproperties. There are two major streams in the research regarding capturing hyperproperties, namely hyperlogics, which extend LTL with trace quantifiers (HyperLTL), and logics that employ team semantics, extending truth to sets of traces. In this article we explore the relation between asynchronous LTL under set-based team semantics (TeamLTL) and HyperLTL. In particular we consider the extensions of TeamLTL with the Boolean disjunction and a fragment of the extension of TeamLTL with the Boolean negation, where the negation cannot occur in the left-hand side of the Until-operator or within the Global-operator. We show that TeamLTL extended with the Boolean disjunction is equi-expressive with the positive Boolean closure of HyperLTL restricted to one universal quantifier, while the left-downward closed fragment of TeamLTL extended with the Boolean negation is expressively equivalent with the Boolean closure of HyperLTL restricted to one universal quantifier

Probabilistic Team Semantics

Team semantics is a semantical framework for the study of dependence and independence concepts ubiquitous in many areas such as databases and statistics. In recent works team semantics has been generalised to accommodate also multisets and probabilistic dependencies. In this article we study a variant of probabilistic team semantics and relate this framework to a Tarskian two-sorted logic. We also show that very simple quantifier-free formulae of our logic give rise to backslashmathrm NP NP -hard model checking problems.Peer reviewe

Complexity Thresholds in Inclusion Logic

Logics with team semantics provide alternative means for logical characterization of complexity classes. Both dependence and independence logic are known to capture non-deterministic polynomial time, and the frontiers of tractability in these logics are relatively well understood. Inclusion logic is similar to these team-based logical formalisms with the exception that it corresponds to deterministic polynomial time in ordered models. In this article we examine connections between syntactical fragments of inclusion logic and different complexity classes in terms of two computational problems: maximal subteam membership and the model checking problem for a fixed inclusion logic formula. We show that very simple quantifier-free formulae with one or two inclusion atoms generate instances of these problems that are complete for (non-deterministic) logarithmic space and polynomial time. Furthermore, we present a fragment of inclusion logic that captures non-deterministic logarithmic space in ordered models

Parametrised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic

In this paper, we initiate a systematic study of the parametrised complexity in the field of Dependence Logics which finds its origin in the Dependence Logic of V\"a\"an\"anen from 2007. We study a propositional variant of this logic (PDL) and investigate a variety of parametrisations with respect to the central decision problems. The model checking problem (MC) of PDL is NP-complete. The subject of this research is to identify a list of parametrisations (formula-size, treewidth, treedepth, team-size, number of variables) under which MC becomes fixed-parameter tractable. Furthermore, we show that the number of disjunctions or the arity of dependence atoms (dep-arity) as a parameter both yield a paraNP-completeness result. Then, we consider the satisfiability problem (SAT) showing a different picture: under team-size, or dep-arity SAT is paraNP-complete whereas under all other mentioned parameters the problem is in FPT. Finally, we introduce a variant of the satisfiability problem, asking for teams of a given size, and show for this problem an almost complete picture.Comment: Update includes refined result

Role of spinal cord glutamate transporter during normal sensory transmission and pathological pain states

Glutamate is a neurotransmitter critical for spinal excitatory synaptic transmission and for generation and maintenance of spinal states of pain hypersensitivity via activation of glutamate receptors. Understanding the regulation of synaptically and non-synaptically released glutamate associated with pathological pain is important in exploring novel molecular mechanisms and developing therapeutic strategies of pathological pain. The glutamate transporter system is the primary mechanism for the inactivation of synaptically released glutamate and the maintenance of glutamate homeostasis. Recent studies demonstrated that spinal glutamate transporter inhibition relieved pathological pain, suggesting that the spinal glutamate transporter might serve as a therapeutic target for treatment of pathological pain. However, the exact function of glutamate transporter in pathological pain is not completely understood. This report will review the evidence for the role of the spinal glutamate transporter during normal sensory transmission and pathological pain conditions and discuss potential mechanisms by which spinal glutamate transporter is involved in pathological pain

Undefinability in Inquisitive Logic with Tensor

Logics based on team semantics, such as inquisitive logic and dependence logic, are not closed under uniform substitution. This leads to an interesting separation between expressive power and definability: it may be that an operator O can be added to a language without a gain in expressive power, yet O is not definable in that language. For instance, even though propositional inquisitive logic and propositional dependence logic have the same expressive power, inquisitive disjunction and implication are not definable in propositional dependence logic. A question that has been open for some time in this area is whether the tensor disjunction used in propositional dependence logic is definable in inquisitive logic. We settle this question in the negative. In fact, we show that extending the logical repertoire of inquisitive logic by means of tensor disjunction leads to an independent set of connectives; that is, no connective in the resulting logic is definable in terms of the others.Peer reviewe