Interpolation in Normal Extensions of the Brouwer Logic

The Craig interpolation property and interpolation property for deducibility are considered for special kind of normal extensions of the Brouwer logic

Unintegrated gluon distributions for forward jets at LHC

We test several BFKL-like evolution equations for unintegrated gluon distributions against forward-central dijet production at LHC. Our study is based on fitting the evolution scenarios to the LHC data using the high energy factorization approach. Thus, as a by-product, we obtain a set of LHC-motivated unintegrated gluon distributions ready to use. We utilize this application by calculating azimuthal decorrelations for forward-central dijet production and compare with existing data.Comment: 18 pages, 6 figures; small corrections in the text and reference

Universal Window for Two Dimensional Critical Exponents

Two dimensional condensed matter is realised in increasingly diverse forms that are accessible to experiment and of potential technological value. The properties of these systems are influenced by many length scales and reflect both generic physics and chemical detail. To unify their physical description is therefore a complex and important challenge. Here we investigate the distribution of experimentally estimated critical exponents, $\beta$, that characterize the evolution of the order parameter through the ordering transition. The distribution is found to be bimodal and bounded within a window $\sim 0.1 \le \beta \le 0.25$, facts that are only in partial agreement with the established theory of critical phenomena. In particular, the bounded nature of the distribution is impossible to reconcile with existing theory for one of the major universality classes of two dimensional behaviour - the XY model with four fold crystal field - which predicts a spectrum of non-universal exponents bounded only from below. Through a combination of numerical and renormalization group arguments we resolve the contradiction between theory and experiment and demonstrate how the "universal window" for critical exponents observed in experiment arises from a competition between marginal operators.Comment: 26 pages, 5 figures and 6 tables. Uses longtable packag

Extensions of modal logic KTB and other topics

This thesis covers four topics. They are the extensions of the modal logic KTB, the use of normal forms in modal logic, automated reasoning in the modal logic S4 and the problem of unavoidable words. Extensions of KTB: The modal logic KTB is the logic of reflexive and symmetric frames. Dually, KTB-algebras have a unary (normal) operator f that satisfies the identities f (x){u2265}x and {u231D}x{u2264}f ({u231D}f(x)). Extensions of KTB are subvarieties of the algebra KTB. Both of these form a lattice, and we investigate the structure of the bottom of the lattice of subvarieties. The unique atom is known to correspond to the modal logic whose frame is a single reflexive point. Yutaka demonstrated that this atom has a unique cover, corresponding to the frame of the two element chain. We construct covers of this element, and so demonstrate that there are a continuum of such covers. Normal Forms in Modal Logic: Fine proposed the use of normal forms as an alternative to traditional methods of determining Kripke completeness. We expand on this paper and demonstrate the application of normal forms to a number of traditional modal logics, and define new terms needed to apply normal forms in this situation. Automated reasoning in 84: History based methods for automated reasoning are well understood and accepted. Pliu{u0161}kevi{u010D}ius & Pliu{u0161}kevi{u010D}ien{u0117} propose a new, potentially revolutionary method of applying marks and indices to sequents. We show that the method is flawed, and empirically compare a different mark/index based method to the traditional methods instead. Unavoidable words: The unavoidable words problem is concerned with repetition in strings of symbols. There are two main ways to identify a word as unavoidable, one based on generalised pattern matching and one from an algorithm. Both methods are in NP, but do not appear to be in P. We define the simple unavoidable words as a subset of the standard unavoidable words that can be identified by the algorithm in P-time. We define depth separating IX x homomorphisms as an easy way to generate a subset of the unavoidable words using the pattern matching method. We then show that the two simpler problems are equivalent to each other

Electron Spin for Classical Information Processing: A Brief Survey of Spin-Based Logic Devices, Gates and Circuits

In electronics, information has been traditionally stored, processed and communicated using an electron's charge. This paradigm is increasingly turning out to be energy-inefficient, because movement of charge within an information-processing device invariably causes current flow and an associated dissipation. Replacing charge with the "spin" of an electron to encode information may eliminate much of this dissipation and lead to more energy-efficient "green electronics". This realization has spurred significant research in spintronic devices and circuits where spin either directly acts as the physical variable for hosting information or augments the role of charge. In this review article, we discuss and elucidate some of these ideas, and highlight their strengths and weaknesses. Many of them can potentially reduce energy dissipation significantly, but unfortunately are error-prone and unreliable. Moreover, there are serious obstacles to their technological implementation that may be difficult to overcome in the near term. This review addresses three constructs: (1) single devices or binary switches that can be constituents of Boolean logic gates for digital information processing, (2) complete gates that are capable of performing specific Boolean logic operations, and (3) combinational circuits or architectures (equivalent to many gates working in unison) that are capable of performing universal computation.Comment: Topical Revie

On Halldén Completeness of Modal Logics Determined by Homogeneous Kripke Frames

Halldén complete modal logics are defined semantically. They have a nice characterization as they are determined by homogeneous Kripke frames.Supported by the NCN, research grant DEC-2013/09/B/HS1/00701

IODP-ICDP Workshop examines challenges of fault zone drilling

No abstract available. doi:10.2204/iodp.sd.s01.12.2007</a

Knowledge base exchange: the case of OWL 2 QL

In this article, we define and study the problem of exchanging knowledge between a source and a target knowledge base (KB), connected through mappings. Differently from the traditional database exchange setting, which considers only the exchange of data, we are interested in exchanging implicit knowledge. As representation formalism we use Description Logics (DLs), thus assuming that the source and target KBs are given as a DL TBox+ABox, while the mappings have the form of DL TBox assertions. We define a general framework of KB exchange, and study the problem of translating the knowledge in the source KB according to the mappings expressed in OWL 2 QL, the profile of the standard Web Ontology Language OWL 2 based on the description logic DL-LiteR. We develop novel game- and automata-theoretic techniques, and we provide complexity results that range from NLogSpace to ExpTim