Related papers: Weakly complete axiomatization of exogenous quantu…
Bernays introduced a method for proving underivability results in propositional calculi by truth tables. In general, this motivates an investigations of how to find, given a propositional logic, a finite-valued logic which has as few…
The existence of a positive entire weak solution to a singular quasi-linear elliptic system with convection terms is established, chiefly through perturbation techniques, fixed point arguments, and a priori estimates. Some regularity…
We describe an equivalent formulation of algebraic weak factorisation systems, not involving monads and comonads, but involving double categories of morphisms equipped with a lifting operation satisfying lifting and factorisation axioms.
We study $Q$-tableaux and axiom systems that they engender, producing a new proof that the Implicational Propositional Calculus is complete.
We study propositional logical systems arising from the language of Johansson's minimal logic and obtained by weakening the requirements for the negation operator. We present their semantics as a variant of neighbourhood semantics. We use…
We study representations of the quantum affine superalgebra associated with a general linear Lie superalgebra. In the spirit of Hernandez-Jimbo, we construct inductive systems of Kirillov-Reshetikhin modules based on a cyclicity result that…
We propose a modification of the weak Galerkin methods and show its equivalence to a new version of virtual element methods. We also show the original weak Galerkin method is equivalent to the non-conforming virtual element method. As a…
We study various formulations of the completeness of first-order logic phrased in constructive type theory and mechanised in the Coq proof assistant. Specifically, we examine the completeness of variants of classical and intuitionistic…
In this work we determine the critical exponent for a weakly coupled system of semilinear wave equations with distinct scale-invariant lower order terms, when these terms make both equations in some sense parabolic-like. For the blow-up…
We consider the question of extending propositional logic to a logic of plausible reasoning, and posit four requirements that any such extension should satisfy. Each is a requirement that some property of classical propositional logic be…
In this paper we prove that three of the main propositional logics of dependence (including propositional dependence logic and inquisitive logic), none of which is structural, are structurally complete with respect to a class of…
Vardanyan's Theorems state that $\mathsf{QPL}(\mathsf{PA})$ - the quantified provability logic of Peano Arithmetic - is $\Pi^0_2$ complete, and in particular that this already holds when the language is restricted to a single unary…
We give an extended review of recent work on the extended weak coupling limit. Background material on completely positive semigroups and their unitary dilations is given, as well as a particularly easy construction of `quadratic noises'.
Algebraic quantum field theory, or AQFT for short, is a rigorous analysis of the structure of relativistic quantum mechanics. It is formulated in terms of a net of operator algebras indexed by regions of a Lorentzian manifold. In several…
We give alternative proofs to certain results in the paper "Weak limits of almost invariant projections" by using ultraproducts of operators.
We axiomatize the provability logic of $\HA$ and prove its decidability. Furthermore, we axiomatize the preservativity and relative admissibility relations for several modal logics extending iK4. A principal technical tool is the…
We introduce proper display calculi for basic monotonic modal logic,the conditional logic CK and a number of their axiomatic extensions. These calculi are sound, complete, conservative and enjoy cut elimination and subformula property. Our…
We investigate the complexity of the model checking problem for intuitionistic and modal propositional logics over transitive Kripke models. More specific, we consider intuitionistic logic IPC, basic propositional logic BPL, formal…
The Cahill-Glauber approach for quantum mechanics on phase-space is extended to the finite dimensional case through the use of discrete coherent states. All properties and features of the continuous formalism are appropriately generalized.…
The lambda-PRK-calculus is a typed lambda-calculus that exploits the duality between the notions of proof and refutation to provide a computational interpretation for classical propositional logic. In this work, we extend lambda-PRK to…