279 research outputs found
Lewis meets Brouwer: constructive strict implication
C. I. Lewis invented modern modal logic as a theory of "strict implication".
Over the classical propositional calculus one can as well work with the unary
box connective. Intuitionistically, however, the strict implication has greater
expressive power than the box and allows to make distinctions invisible in the
ordinary syntax. In particular, the logic determined by the most popular
semantics of intuitionistic K becomes a proper extension of the minimal normal
logic of the binary connective. Even an extension of this minimal logic with
the "strength" axiom, classically near-trivial, preserves the distinction
between the binary and the unary setting. In fact, this distinction and the
strong constructive strict implication itself has been also discovered by the
functional programming community in their study of "arrows" as contrasted with
"idioms". Our particular focus is on arithmetical interpretations of the
intuitionistic strict implication in terms of preservativity in extensions of
Heyting's Arithmetic.Comment: Our invited contribution to the collection "L.E.J. Brouwer, 50 years
later
Model theory of operator algebras III: Elementary equivalence and II_1 factors
We use continuous model theory to obtain several results concerning
isomorphisms and embeddings between II_1 factors and their ultrapowers. Among
other things, we show that for any II_1 factor M, there are continuum many
nonisomorphic separable II_1 factors that have an ultrapower isomorphic to an
ultrapower of M. We also give a poor man's resolution of the Connes Embedding
Problem: there exists a separable II_1 factor such that all II_1 factors embed
into one of its ultrapowers.Comment: 16 page
Convolution, Separation and Concurrency
A notion of convolution is presented in the context of formal power series
together with lifting constructions characterising algebras of such series,
which usually are quantales. A number of examples underpin the universality of
these constructions, the most prominent ones being separation logics, where
convolution is separating conjunction in an assertion quantale; interval
logics, where convolution is the chop operation; and stream interval functions,
where convolution is used for analysing the trajectories of dynamical or
real-time systems. A Hoare logic is constructed in a generic fashion on the
power series quantale, which applies to each of these examples. In many cases,
commutative notions of convolution have natural interpretations as concurrency
operations.Comment: 39 page
On Kirchberg's Embedding Problem
Kirchberg's Embedding Problem (KEP) asks whether every separable C
algebra embeds into an ultrapower of the Cuntz algebra . In this
paper, we use model theory to show that this conjecture is equivalent to a
local approximate nuclearity condition that we call the existence of good
nuclear witnesses. In order to prove this result, we study general properties
of existentially closed C algebras. Along the way, we establish a
connection between existentially closed C algebras, the weak expectation
property of Lance, and the local lifting property of Kirchberg. The paper
concludes with a discussion of the model theory of . Several
results in this last section are proven using some technical results concerning
tubular embeddings, a notion first introduced by Jung for studying embeddings
of tracial von Neumann algebras into the ultrapower of the hyperfinite II
factor.Comment: 42 pages; final version to appear in the Journal of Functional
Analysi
Deciding Predicate Logical Theories Of Real-Valued Functions
The notion of a real-valued function is central to mathematics, computer science, and many other scientific fields. Despite this importance, there are hardly any positive results on decision procedures for predicate logical theories that reason about real-valued functions. This paper defines a first-order predicate language for reasoning about multi-dimensional smooth real-valued functions and their derivatives, and demonstrates that - despite the obvious undecidability barriers - certain positive decidability results for such a language are indeed possible
- …