A Substructural Epistemic Resource Logic: Theory and Modelling Applications

We present a substructural epistemic logic, based on Boolean BI, in which the epistemic modalities are parametrized on agents' local resources. The new modalities can be seen as generalizations of the usual epistemic modalities. The logic combines Boolean BI's resource semantics --- we introduce BI and its resource semantics at some length --- with epistemic agency. We illustrate the use of the logic in systems modelling by discussing some examples about access control, including semaphores, using resource tokens. We also give a labelled tableaux calculus and establish soundness and completeness with respect to the resource semantics

A Labelled Analytic Theorem Proving Environment for Categorial Grammar

We present a system for the investigation of computational properties of categorial grammar parsing based on a labelled analytic tableaux theorem prover. This proof method allows us to take a modular approach, in which the basic grammar can be kept constant, while a range of categorial calculi can be captured by assigning different properties to the labelling algebra. The theorem proving strategy is particularly well suited to the treatment of categorial grammar, because it allows us to distribute the computational cost between the algorithm which deals with the grammatical types and the algebraic checker which constrains the derivation.Comment: 11 pages, LaTeX2e, uses examples.sty and a4wide.st

Towards an efficient prover for the C1 paraconsistent logic

The KE inference system is a tableau method developed by Marco Mondadori which was presented as an improvement, in the computational efficiency sense, over Analytic Tableaux. In the literature, there is no description of a theorem prover based on the KE method for the C1 paraconsistent logic. Paraconsistent logics have several applications, such as in robot control and medicine. These applications could benefit from the existence of such a prover. We present a sound and complete KE system for C1, an informal specification of a strategy for the C1 prover as well as problem families that can be used to evaluate provers for C1. The C1 KE system and the strategy described in this paper will be used to implement a KE based prover for C1, which will be useful for those who study and apply paraconsistent logics.Comment: 16 page

Emergent Phase Space Description of Unitary Matrix Model

We show that large $N$ phases of a $0$ dimensional generic unitary matrix model (UMM) can be described in terms of topologies of two dimensional droplets on a plane spanned by eigenvalue and number of boxes in Young diagram. Information about different phases of UMM is encoded in the geometry of droplets. These droplets are similar to phase space distributions of a unitary matrix quantum mechanics (UMQM) ($(0 + 1)$ dimensional) on constant time slices. We find that for a given UMM, it is possible to construct an effective UMQM such that its phase space distributions match with droplets of UMM on different time slices at large $N$. Therefore, large $N$ phase transitions in UMM can be understood in terms of dynamics of an effective UMQM. From the geometry of droplets it is also possible to construct Young diagrams corresponding to $U(N)$ representations and hence different large $N$ states of the theory in momentum space. We explicitly consider two examples : single plaquette model with $\text{Tr} U^2$ terms and Chern-Simons theory on $S^3$. We describe phases of CS theory in terms of eigenvalue distributions of unitary matrices and find dominant Young distributions for them.Comment: 52 pages, 15 figures, v2 Introduction and discussions extended, References adde