The Computational Complexity of Propositional Cirquent Calculus

Introduced in 2006 by Japaridze, cirquent calculus is a refinement of sequent calculus. The advent of cirquent calculus arose from the need for a deductive system with a more explicit ability to reason about resources. Unlike the more traditional proof-theoretic approaches that manipulate tree-like objects (formulas, sequents, etc.), cirquent calculus is based on circuit-style structures called cirquents, in which different "peer" (sibling, cousin, etc.) substructures may share components. It is this resource sharing mechanism to which cirquent calculus owes its novelty (and its virtues). From its inception, cirquent calculus has been paired with an abstract resource semantics. This semantics allows for reasoning about the interaction between a resource provider and a resource user, where resources are understood in the their most general and intuitive sense. Interpreting resources in a more restricted computational sense has made cirquent calculus instrumental in axiomatizing various fundamental fragments of Computability Logic, a formal theory of (interactive) computability. The so-called "classical" rules of cirquent calculus, in the absence of the particularly troublesome contraction rule, produce a sound and complete system CL5 for Computability Logic. In this paper, we investigate the computational complexity of CL5, showing it is $\Sigma_2^p$-complete. We also show that CL5 without the duplication rule has polynomial size proofs and is NP-complete

An Infinite Class of Sparse-Yao Spanners

We show that, for any integer k > 5, the Sparse-Yao graph YY_{6k} (also known as Yao-Yao) is a spanner with stretch factor 11.67. The stretch factor drops down to 4.75 for k > 7.Comment: 17 pages, 12 figure

On the Weak Computability of Continuous Real Functions

In computable analysis, sequences of rational numbers which effectively converge to a real number x are used as the (rho-) names of x. A real number x is computable if it has a computable name, and a real function f is computable if there is a Turing machine M which computes f in the sense that, M accepts any rho-name of x as input and outputs a rho-name of f(x) for any x in the domain of f. By weakening the effectiveness requirement of the convergence and classifying the converging speeds of rational sequences, several interesting classes of real numbers of weak computability have been introduced in literature, e.g., in addition to the class of computable real numbers (EC), we have the classes of semi-computable (SC), weakly computable (WC), divergence bounded computable (DBC) and computably approximable real numbers (CA). In this paper, we are interested in the weak computability of continuous real functions and try to introduce an analogous classification of weakly computable real functions. We present definitions of these functions by Turing machines as well as by sequences of rational polygons and prove these two definitions are not equivalent. Furthermore, we explore the properties of these functions, and among others, show their closure properties under arithmetic operations and composition

Infrared regulators and SCETII

We consider matching from SCETI, which includes ultrasoft and collinear particles, onto SCETII with soft and collinear particles at one loop. Keeping the external fermions off their mass shell does not regulate all IR divergences in both theories. We give a new prescription to regulate infrared divergences in SCET. Using this regulator, we show that soft and collinear modes in SCETII are sufficient to reproduce all the infrared divergences of SCETI. We explain the relationship between IR regulators and an additional mode proposed for SCETII.Comment: 9 pages. Added discussion about relationship between IR regulators and messenger mode

Improving jet distributions with effective field theory

We obtain perturbative expressions for jet distributions using soft-collinear effective theory (SCET). By matching SCET onto QCD at high energy, tree level matrix elements and higher order virtual corrections can be reproduced in SCET. The resulting operators are then evolved to lower scales, with additional operators being populated by required threshold matchings in the effective theory. We show that the renormalization group evolution and threshold matchings reproduce the Sudakov factors and splitting functions of QCD, and that the effective theory naturally combines QCD matrix elements and parton showers. The effective theory calculation is systematically improvable and any higher order perturbative effects can be included by a well defined procedure.Comment: 4 pages, 1 figure; typos corrected and notation updated to match hep-ph/060729

Absent Physical Invasion, Governmental Interference with Private Property Will Not Likely Violate the Fifth Amendment\u27s Takings Clause: \u3cem\u3eMachipongo Land and Coal Company, Inc. v. Commonwealth of Pennsylvania\u3c/em\u3e

Supreme Court of Pennsylvania no longer Recognizes Pennsylvania\u27s use of Three Estates within a Single Parcel of Land by adopting the United States Supreme Court\u27s Vertical Segmentation Rule. Machipongo Land and Coal Company, Inc. v. Commonwealth of Pennsylvania, 799 A.2d 751 (Pa. 2002