English
Related papers

Related papers: The modal theory of linear orders

200 papers

Inspired by the classical theory of modules over a monoid, we give a first account of the natural notion of module over a monad. The associated notion of morphism of left modules ("Linear" natural transformations) captures an important…

Logic in Computer Science · Computer Science 2007-05-23 André Hirschowitz , Marco Maggesi

We initiate the study of model structures on (categories induced by) lattice posets, a subject we dub homotopical combinatorics. In the case of a finite total order $[n]$, we enumerate all model structures, exhibiting a rich combinatorial…

Algebraic Topology · Mathematics 2023-04-20 Scott Balchin , Kyle Ormsby , Angélica M. Osorno , Constanze Roitzheim

If $R$ is a rational map, the Main Result is a uniformization Theorem for the space of decompositions of the iterates of $R$. Secondly, we show that Fatou conjecture holds for decomposable rational maps.

Dynamical Systems · Mathematics 2011-07-01 Carlos Cabrera , Peter Makienko

Sequential word order is important when processing text. Currently, neural networks (NNs) address this by modeling word position using position embeddings. The problem is that position embeddings capture the position of individual words,…

Computation and Language · Computer Science 2020-06-30 Benyou Wang , Donghao Zhao , Christina Lioma , Qiuchi Li , Peng Zhang , Jakob Grue Simonsen

This paper is mainly concerned with applying the theory of M-regularity developed in the previous math.AG/0110003 to the study of linear series given by multiples of ample line bundles on abelian varieties. We define a new invariant of a…

Algebraic Geometry · Mathematics 2007-05-23 Giuseppe Pareschi , Mihnea Popa

A representation embedding between cartesian theories can be defined to be a functor between respective categories of models that preserves finitely-generated projective models and that preserves and reflects certain epimorphisms. This…

Representation Theory · Mathematics 2017-11-09 Michael Lambert

A general theorem on factorization of matrices with polynomial entries is proven and it is used to reduce polynomial Darboux matrices to linear ones. Some new examples of linear Darboux matrices are discussed.

Exactly Solvable and Integrable Systems · Physics 2009-11-11 F. Musso , A. Shabat

We prove a topological completeness theorem for the modal logic GLP containing operators $\langle\lambda\rangle$ for $\lambda \in$ Ord intended to capture progressively stronger notions of consistency in mathematical theories. We show that,…

Logic · Mathematics 2019-05-07 Juan P. Aguilera

This dissertation is a contribution to the project of second-order set theory, which has seen a revival in recent years. The approach is to understand second-order set theory by studying the structure of models of second-order set theories.…

Logic · Mathematics 2018-04-26 Kameryn J Williams

Natural linear and coalgebra transformations of tensor algebras are studied. The representations of certain combinatorial groups are given. These representations are connected to natural transformations of tensor algebras and to the groups…

Algebraic Topology · Mathematics 2009-06-30 Jelena Grbic , Jie Wu

We give an introduction to logic tailored for algebraists, explaining how proofs in linear logic can be viewed as algorithms for constructing morphisms in symmetric closed monoidal categories with additional structure. This is made explicit…

Logic · Mathematics 2017-01-05 Daniel Murfet

A basic problem in the theory of partially ordered vector spaces is to characterise those cones on which every order-isomorphism is linear. We show that this is the case for every Archimedean cone that equals the inf-sup hull of the sum of…

Functional Analysis · Mathematics 2023-11-27 Bas Lemmens , Hent van Imhoff , Onno van Gaans

In the interleaving model of concurrency, where events are totally ordered, linearizability is compositional: the composition of two linearizable objects is guaranteed to be linearizable. However, linearizability is not compositional when…

Logic in Computer Science · Computer Science 2018-02-07 Simon Doherty , John Derrick , Brijesh Dongol , Heike Wehrheim

In this paper we expound some basic ideas of proof theory for theories of ordinals such that there are many stable ordinals below the ordinals.

Logic · Mathematics 2011-04-12 Toshiyasu Arai

The linear transport theory is developed to describe the time dependence of the number density of tracer particles in porous media. The advection is taken into account. The transport equation is numerically solved by the analytical discrete…

Computational Physics · Physics 2020-05-26 Kenji Amagai , Yuko Hatano , Manabu Machida

Intuitionistic grammar logics fuse constructive and multi-modal reasoning while permitting the use of converse modalities, serving as a generalization of standard intuitionistic modal logics. In this paper, we provide definitions of these…

Logic in Computer Science · Computer Science 2025-12-04 Tim S. Lyon

Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…

Logic · Mathematics 2008-06-04 Wesley Calvert

Structures based on polarities have been used to provide relational semantics for propositional logics that are modelled algebraically by non-distributive lattices with additional operators. This article develops a first order notion of…

Logic · Mathematics 2023-11-08 Robert Goldblatt

This work provides a complete characterization of the solutions of a linear interpolation problem for vector polynomials. The interpolation problem consists in finding n scalar polynomials such that an equation involving a linear…

Classical Analysis and ODEs · Mathematics 2015-06-24 Mikhail Kudryavtsev , Sergio Palafox , Luis O. Silva

This article consists in two independent parts. In the first one, we investigate the geometric properties of almost periodicity of model sets (or cut-and-project sets, defined under the weakest hypotheses); in particular we show that they…

Dynamical Systems · Mathematics 2015-12-03 Pierre-Antoine Guihéneuf
‹ Prev 1 8 9 10 Next ›