: Results of a search for the electroweak associated production of charginos and next-to-lightest neutralinos, pairs of charginos or pairs of tau sleptons are presented. These processes are characterised by final states with at least two hadronically decaying tau leptons, missing transverse momentum and low jet activity. The analysis is based on an integrated luminosity of 20.3 fb−1 of proton-proton collisions at recorded with the ATLAS experiment at the Large Hadron Collider. No significant excess is observed with respect to the (...) predictions from Standard Model processes. Limits are set at 95% confidence level on the masses of the lighter chargino and next-to-lightest neutralino for various hypotheses for the lightest neutralino mass in simplified models. In the scenario of direct production of chargino pairs, with each chargino decaying into the lightest neutralino via an intermediate tau slepton, chargino masses up to 345 GeV are excluded for a massless lightest neutralino. For associated production of mass-degenerate charginos and next-to-lightest neutralinos, both decaying into the lightest neutralino via an intermediate tau slepton, masses up to 410 GeV are excluded for a massless lightest neutralino.[Figure not available: see fulltext.]. (shrink)
In this book, Kathrin Gl¨uer carefully outlines Donald Davidson's principal claims and arguments, and discusses them in some detail, providing a concise, systematic introduction to all the main elements of Davidson's philosophy.
Q-valued sets are non-classical models of the formalized theory of identity with existence predicate based on the axioms of a non-commutative and non-idempotent logic. The singleton monad on the category of Q-valued sets is constructed, and elementary properties of T-algebras of the singleton monad are investigated.
We investigate the notion of conditional probability and the quantum mechanical concept of state reduction in the context of GL spaces satisfying the Alfsen-Shultz condition.
We introduce a first order extension of GL, called ML 3 , and develop its proof theory via a proxy cut-free sequent calculus GLTS. We prove the highly nontrivial result that cut is a derived rule in GLTS, a result that is unavailable in other known first-order extensions of GL. This leads to proofs of weak reflection and the related conservation result for ML 3 , as well as proofs for Craig’s interpolation theorem for GLTS. Turning to semantics we prove (...) that ML 3 is sound with respect to arithmetical interpretations and that it is also sound and complete with respect to converse well-founded and transitive finite Kripke models. This leads us to expect that a Solovay-like proof of arithmetical completeness of ML 3 is possible. (shrink)
Possibility studies is an emerging field of research including topics as diverse as creativity, imagination, innovation, anticipation, counterfactual thinking, wondering, the future, social change, hope, agency, and utopia. The Possible: A Sociocultural Theory contributes to this wide field by developing a sociocultural account of the possible grounded in the notions of difference, position, perspective, dialogue, action, and culture.
Reconstructing Popper's research programme for the Human Sciences, Noretta Koertge (Inquiry , Vol. 18 [1975]) has given a deductive-nomological account of explanations of actions by means of a Rationality Principle. It is argued here that such a Rationality Principle is fundamentally redundant. Neither is it logically necessary in order to deduce a cognitive action-explanandum, nor can it be given a semantic non-empty interpretation, at least not within Koertge's own syllogism. Any attempt to save the Rationality Principle as unfalsifiablc but nevertheless (...) indispensable for action explanations is rejected in the light of possible alternative action explanations by empirical and therefore in principle falsifiable psychological laws. (shrink)
This paper deals with the system of modal logicGL, in particular with a formulation of it in terms of sequents. We prove some proof theoretical properties ofGL that allow to get the cut-elimination theorem according to Gentzen's procedure, that is, by double induction on grade and rank.
THEN GO TO YOUR WORK WITH JOY - SOCIALITY AND SACRAMENTAILITY IN MARTIN LUTHER'S TEACHING OF THE CALLINGThe article investigates Martin Luther’s teaching of the calling in a social perspective. In the tradition following the pioneering work of Max Weber, the Reformation has often been interpreted a steppingstone towards processes of disenchantment, secularization and rationalization. In recent years, a growing body of literature has argued that this tradition overlooks crucial elements of reformation spirituality such as sacramentality, sociality and the affirmation (...) of ordinary life. With his conceptualization of work as a calling, Luther elevated and sanctified the everyday life and activities as a central component of the Christian life and the constitution of society. Here we might find the seed for the exceptionally high value ascribed to work in contemporary, Lutheran Nordic societies. (shrink)
This article studies the ambitions involved in founding the European Association of Experimental Social Psychology (EAESP) in the context of a differentiation between social psychology practised in Europe on the one hand and the United States on the other. To this end 8 key actors have been interviewed: 4 members of the very first Executive Committee (or Planning Committee as it was called then) as well as 4 key players of a second generation. Also the EAESP’s archives have been consulted. (...) Moreover, data regarding the developments of EAESP’s membership and EAESP’s house journal, the European Journal of Social Psychology (EJSP), were used to assess to what extent the ambitions in developing a European social psychology have been realized. The conclusion is that, despite various successes, it remains questionable whether the founders’ aims have been fulfilled. (shrink)
Reference [12] introduced a novel formula to formula translation tool that enables syntactic metatheoretical investigations of first-order modallogics, bypassing a need to convert them first into Gentzen style logics in order torely on cut elimination and the subformula property. In fact, the formulator tool,as was already demonstrated in loc. cit., is applicable even to the metatheoreticalstudy of logics such as QGL, where cut elimination is unavailable. This paper applies the formulator approach to show the independence of the axiom schema ☐A (...) → ☐∀ A of the logics M3and ML3 of [17, 18, 11, 13]. This leads to the conclusion that the two logics obtained by removing this axiom are incomplete, both with respect to their natural Kripke structures and to arithmetical interpretations. In particular, the so modified ML3 is, similarly to QGL, an arithmetically incomplete first-order extension of GL, but, unlike QGL, all its theorems have cut free proofs. We also establish here, via formulators, a stronger version of the disjunction property for GL and QGL without going through Gentzen versions of these logics. (shrink)
Normal forms for wide classes of closed IL formulas were given in Čačić and Vuković. Here we quantify asymptotically, in exact numbers, how wide those classes are. As a consequence, we show that the “majority” of closed IL formulas have GL-equivalents, and by that, they have the same normal forms as GL formulas. Our approach is entirely syntactical, except for applying the results of Čačić and Vuković. As a byproduct we devise a convenient way of computing asymptotic behaviors of somewhat (...) general classes of formulas given by their grammar rules. Its applications do not require any knowledge of the recurrence relations, generating functions, or the asymptotic enumeration methods, as all these are incorporated into two fundamental parameters. (shrink)
Sambin [6] proved the normalization theorem for GL, the modal logic of provability, in a sequent calculus version called by him GLS. His proof does not take into account the concept of reduction, commonly used in normalization proofs. Bellini [1], on the other hand, gave a normalization proof for GL using reductions. Indeed, Sambin's proof is a decision procedure which builds cut-free proofs. In this work we formalize this procedure as a recursive function and prove its recursiveness in an arithmetically (...) formalizable way, concluding that the normalization of GL can be formalized in PA. MSC: 03F05, 03B35, 03B45. (shrink)
Sambin [6] proved the normalization theorem for GL, the modal logic of provability, in a sequent calculus version called by him GLS. His proof does not take into account the concept of reduction, commonly used in normalization proofs. Bellini [1], on the other hand, gave a normalization proof for GL using reductions. Indeed, Sambin's proof is a decision procedure which builds cut-free proofs. In this work we formalize this procedure as a recursive function and prove its recursiveness in an arithmetically (...) formalizable way, concluding that the normalization of GL can be formalized in PA. MSC: 03F05, 03B35, 03B45. (shrink)
In a previous paper [ 21 ] all extensions of Johansson’s minimal logic J with the weak interpolation property WIP were described. It was proved that WIP is decidable over J. It turned out that the weak interpolation problem in extensions of J is reducible to the same problem over a logic Gl, which arises from J by adding tertium non datur. In this paper we consider extensions of the logic Gl. We prove that only finitely many logics over Gl (...) have the Craig interpolation property CIP, the restricted interpolation property IPR or the projective Beth property PBP. The full list of Gl-logics with the mentioned properties is found, and their description is given. We note that IPR and PBP are equivalent over Gl. It is proved that CIP, IPR and PBP are decidable over the logic Gl. (shrink)
