Top Quark Mass Measurements

Preliminary results on the measurement of the top quark mass (mt) at the Tevatron Collider are presented. In the dilepton decay channel, the CDF Collaboration measures mt=175.0(+17.4)(-16.9)(stat.)+/-8.4(syst.) GeV/c2, using a sample of ~126 pb-1 of proton-antiproton collision data at sqrt(s)=1.96 TeV (Run II). In the lepton plus jets channel, the CDF Collaboration measures 177.5(+12.7)(-9.4)(stat.)+/-7.1(syst.) GeV/c2, using a sample of ~102 pb-1 at sqrt(s)=1.96 TeV. The D0 Collaboration has newly applied a likelihood technique to improve the analysis of ~125 pb-1 of proton-antiproton collisions at sqrt(s)=1.8 TeV (Run I), with the result: mt=180.1+/-3.6(stat.)+/-3.9(syst.) GeV/c2. The latter is combined with all the measurements based on the data collected in Run I to yield the most recent and comprehensive experimental determination of the top quark mass: mt=178.0+/-2.7(stat.)+/-3.3(syst.) GeV/c2Comment: Contribution to the proceedings of the XXXIXth Rencontres de Moriond, "QCD and High Energy Hadronic Interactions", March 200

Discriminating Z' signals in semileptonic top pair production at the LHC

We investigate the sensitivity of top pair production to the properties of different Beyond the Standard Model theories embedding a new neutral boson. We include six-fermion decay, and account for the full tree-level Standard Model ttbar interference, with all intermediate particles allowed off-shell. We focus on those observables best suited to the lepton-plus-jets final state at the LHC, and simulate the resulting experimental conditions, including kinematic requirements and top quark pair reconstruction in the presence of missing transverse energy and combinatorial ambiguity in quark-top assignment. In particular, we demonstrate the use of asymmetry observables to probe the coupling structure of a new neutral resonance, in addition to cases in which these asymmetries may even form complementary discovery observables in combination with the differential cross section.Comment: 4 pages, 1 figure, 1 table. arXiv admin note: substantial text overlap with arXiv:1610.0407

A linear axiomatization of negation as failure

AbstractThis paper is concerned with the axiomatization of success and failure in propositional logic programming. It deals with the actual implementation of SLDNF in PROLOG, as opposed to the general nondeterministic SLDNF evaluation method. Given any propositional program P, a linear theory LTP is defined (the linear translation of P) and the following results are proved for any literal A: soundness of PROLOG evaluation (if the goal A PROLOG-succeeds on P, then LTP⊢lin A, and if A PROLOG-fails on P, then LTP⊢lin A⊥), and completeness of PROLOG evaluation (if LTP⊢lin A, then the goal A PROLOG-succeeds on P, and if LTP⊢lin A⊥, then A PROLOG-fails on P). Here ⊢lin means provability in linear logic, and A⊥ is the linear negation of A

Partial Model Checking and Partial Model Synthesis in LTL Using a Tableau-Based Approach

In the process of designing a computer system S and checking whether an abstract model ? of S verifies a given specification property ?, one might have only a partial knowledge of the model, either because ? has not yet been completely defined (constructed) by the designer, or because it is not completely observable by the verifier. This leads to new verification problems, subsuming satisfiability and model checking as special cases. We state and discuss these problems in the case of LTL specifications, and develop a uniform tableau-based approach for their solutions