English
Related papers

Related papers: Parametricity and Semi-Cubical Types

200 papers

The interpretation of parasitic gaps is an ostensible case of non-linearity in natural language composition. Existing categorial analyses, both in the typelogical and in the combinatory traditions, rely on explicit forms of syntactic…

Computation and Language · Computer Science 2020-07-08 Michael Moortgat , Mehrnoosh Sadrzadeh , Gijs Wijnholds

The class of generic structures among those consisting of the measure algebra of a probability space equipped with an automorphism is axiomatizable by positive sentences interpreted using an approximate semantics. The separable generic…

Logic · Mathematics 2007-05-23 Alexander Berenstein , C. Ward Henson

Integrable two-dimensional models which possess an integral of motion cubic or quartic in velocities are governed by a single prepotential, which obeys a nonlinear partial differential equation. Taking into account the latter's invariance…

Mathematical Physics · Physics 2015-06-16 Anton Galajinsky , Olaf Lechtenfeld

We present a version of arithmetic in all finite types which allows for a definition of equality at higher types for which all congruence are derivable, for which the soundness of the Dialectica interpretation is provable inside the system…

Logic · Mathematics 2016-09-21 Benno van den Berg

We define and study the theory of derivation-based connections on a recently introduced class of bimodules over an algebra which reduces to the category of modules whenever the algebra is commutative. This theory contains, in particular, a…

q-alg · Mathematics 2009-10-28 Michel Dubois-Violette , Peter W. Michor

Substructural type systems, such as affine (and linear) type systems, are type systems which impose restrictions on copying (and discarding) of variables, and they have found many applications in computer science, including quantum…

Logic in Computer Science · Computer Science 2021-01-27 Vladimir Zamdzhiev

We present an approach to support partiality in type-level computation without compromising expressiveness or type safety. Existing frameworks for type-level computation either require totality or implicitly assume it. For example, type…

Programming Languages · Computer Science 2017-06-30 J. Garrett Morris , Richard Eisenberg

Polynomial functors are useful in the theory of data types, where they are often called containers. They are also useful in algebra, combinatorics, topology, and higher category theory, and in this broader perspective the polynomial aspect…

Logic in Computer Science · Computer Science 2014-07-15 Joachim Kock

We study atom canonicity for several varieties of cylindric like algebras that contain properly the variety of representable algebras. The algebras in such varieties have relativized representations, and we thereby obtain many omitting…

Logic · Mathematics 2013-08-29 Tarek Sayed Ahmed

We consider an intermediate category between the category of finite quivers and a certain category of pseudocompact associative algebras whose objects include all pointed finite dimensional algebras. We define the completed path algebra and…

Rings and Algebras · Mathematics 2017-08-04 Kostiantyn Iusenko , John MacQuarrie

We present a complete computational classification of the combinatorial types of hyperplane sections, or slices, of the regular cube up to dimension six. For each dimension, we determine the exact number of distinct combinatorial types.…

Combinatorics · Mathematics 2025-10-13 Marie-Charlotte Brandenburg , Chiara Meroni

In this paper we review important aspects of semiparametric theory and empirical processes that arise in causal inference problems. We begin with a brief introduction to the general problem of causal inference, and go on to discuss…

Statistics Theory · Mathematics 2016-07-25 Edward H. Kennedy

For an arbitrary category, we consider the least class of functors con- taining the projections and closed under finite products, finite coproducts, parameterized initial algebras and parameterized final coalgebras, i.e. the class of…

Logic in Computer Science · Computer Science 2016-10-21 Luigi Santocanale

In quantum logical terms, Hardy-type arguments can be uniformly presented and extended as collections of intertwined contexts and their observables. If interpreted classically those structures serve as graph-theoretic "gadgets" that enforce…

Quantum Physics · Physics 2023-06-29 Karl Svozil

A quotient construction defines an abstract type from a concrete type, using an equivalence relation to identify elements of the concrete type that are to be regarded as indistinguishable. The elements of a quotient type are…

Logic in Computer Science · Computer Science 2019-07-18 Lawrence C. Paulson

We extend the comatrix coring to the case of a quasi-finite bicomodule. We also generalize some of its interesting properties. We study equivalences between categories of comodules over rather general corings. We particularize to the case…

Rings and Algebras · Mathematics 2007-05-23 Mohssin Zarouali-Darkaoui

In this paper we introduce a new formalism for $K$-theory, called squares $K$-theory. This formalism allows us to simultaneously generalize the usual three-term relation $[B] = [A] + [C]$ for an exact sequence $A \hookrightarrow B…

K-Theory and Homology · Mathematics 2026-02-11 Jonathan Campbell , Josefien Kuijper , Mona Merling , Inna Zakharevich

We construct a fully faithful functor from the category of graphs to the category of fields. Using this functor, we resolve a longstanding open problem in computable model theory, by showing that for every nontrivial countable structure S,…

Logic · Mathematics 2015-10-27 Russell Miller , Bjorn Poonen , Hans Schoutens , Alexandra Shlapentokh

We study associative multiplications in semi-simple associative algebras over C compatible with the usual one or, in other words, linear deformations of semi-simple associative algebras over C. It turns out that these deformations are in…

Quantum Algebra · Mathematics 2007-05-23 Alexander Odesskii , Vladimir Sokolov

There are many contexts in algebraic geometry, algebraic topology, and homological algebra where one encounters a functor that has both a left and right adjoint, with the right adjoint being isomorphic to a shift of the left adjoint…

Algebraic Topology · Mathematics 2007-05-23 H. Fausk , P. Hu , J. P. May
‹ Prev 1 8 9 10 Next ›