86,144 research outputs found
Nominal Models of Linear Logic
PhD thesisMore than 30 years after the discovery of linear logic, a simple fully-complete model has still not been established. As of today, models of logics with type variables rely on di-natural transformations, with the intuition that a proof should behave uniformly at variable types. Consequently, the interpretations of the proofs are not concrete. The main goal of this thesis was to shift from a 2-categorical setting to a first-order category. We model each literal by a pool of resources of a certain type, that we encode thanks to sorted names. Based on this, we revisit a range of categorical constructions, leading to nominal relational models of linear logic. As these fail to prove fully-complete, we revisit the fully-complete game-model of linear logic established by Melliès. We give a nominal account of concurrent game semantics, with an emphasis on names as resources. Based on them, we present fully complete models of multiplicative additive tensorial, and then linear logics. This model extends the previous result by adding atomic variables, although names do not play a crucial role in this result. On the other hand, it provides a nominal structure that allows for a nominal relationship between the Böhm trees of the linear lambda-terms and the plays of the strategies. However, this full-completeness result for linear logic rests on a quotient. Therefore, in the final chapter, we revisit the concurrent operators model which was first developed by Abramsky and Melliès. In our new model, the axiomatic structure is encoded through nominal techniques and strengthened in such a way that full completeness still holds for MLL. Our model does not depend on any 2-categorical argument or quotient. Furthermore, we show that once enriched with a hypercoherent structure, we get a static fully complete model of MALL
Connected components of definable groups and o-minimality I
We give examples of groups G such that G^00 is different from G^000. We also
prove that for groups G definable in an o-minimal structure, G has a "bounded
orbit" iff G is definably amenable. These results answer questions of
Gismatullin, Newelski, Petrykovski. The examples also give new non G-compact
first order theories.Comment: 26 pages. This paper corrects the paper "Groups definable in
o-minimal structures: structure theorem, G^000, definable amenability, and
bounded orbits" by the first author which was posted in December
(1012.4540v1) and later withdraw
Weakly almost periodic functions, model-theoretic stability, and minimality of topological groups
We investigate the automorphism groups of -categorical structures
and prove that they are exactly the Roelcke precompact Polish groups. We show
that the theory of a structure is stable if and only if every Roelcke uniformly
continuous function on the automorphism group is weakly almost periodic.
Analysing the semigroup structure on the weakly almost periodic
compactification, we show that continuous surjective homomorphisms from
automorphism groups of stable -categorical structures to Hausdorff
topological groups are open. We also produce some new WAP-trivial groups and
calculate the WAP compactification in a number of examples
Dihedral coverings of trigonal curves
We classify and study trigonal curves in Hirzebruch surfaces admitting
dihedral Galois coverings. As a consequence, we obtain certain restrictions on
the fundamental group of a plane curve~ with a singular point of
multiplicity
Knot Tightening By Constrained Gradient Descent
We present new computations of approximately length-minimizing polygons with
fixed thickness. These curves model the centerlines of "tight" knotted tubes
with minimal length and fixed circular cross-section. Our curves approximately
minimize the ropelength (or quotient of length and thickness) for polygons in
their knot types. While previous authors have minimized ropelength for polygons
using simulated annealing, the new idea in our code is to minimize length over
the set of polygons of thickness at least one using a version of constrained
gradient descent.
We rewrite the problem in terms of minimizing the length of the polygon
subject to an infinite family of differentiable constraint functions. We prove
that the polyhedral cone of variations of a polygon of thickness one which do
not decrease thickness to first order is finitely generated, and give an
explicit set of generators. Using this cone we give a first-order minimization
procedure and a Karush-Kuhn-Tucker criterion for polygonal ropelength
criticality.
Our main numerical contribution is a set of 379 almost-critical prime knots
and links, covering all prime knots with no more than 10 crossings and all
prime links with no more than 9 crossings. For links, these are the first
published ropelength figures, and for knots they improve on existing figures.
We give new maps of the self-contacts of these knots and links, and discover
some highly symmetric tight knots with particularly simple looking self-contact
maps.Comment: 45 pages, 16 figures, includes table of data with upper bounds on
ropelength for all prime knots with no more than 10 crossings and all prime
links with no more than 9 crossing
- …