English
Related papers

Related papers: Subspaces of an arithmetic universe via type theor…

200 papers

We define a concept which we call multiplicity. First, multiplicity of a morphism is defined. Then the multiplicity of an object over another object is defined to be the minimum of the multiplicities of all morphisms from one to another.…

Category Theory · Mathematics 2015-03-17 Kouki Taniyama

We first give a characterization for Mathieu subspaces of univariate polynomial algebras over fields in terms of their radicals. We then deduce that for some classes of classical univariate orthogonal polynomials the Image Conjecture is…

Commutative Algebra · Mathematics 2022-08-12 Arno van den Essen , Wenhua Zhao

We construct a topological space to study contextuality in quantum mechanics. The resulting space is a classifying space in the sense of algebraic topology. Cohomological invariants of our space correspond to physical quantities relevant to…

Quantum Physics · Physics 2021-06-07 Cihan Okay , Daniel Sheinbaum

We give a combinatorial description of shape theory using finite topological $T_0$-spaces (finite partially ordered sets). This description may lead to a sort of computational shape theory. Then we introduce the notion of core for inverse…

General Topology · Mathematics 2022-05-09 Pedro J. Chocano , Manuel A. Morón , Francisco R. Ruiz del Portal

In this paper we present the set of intervals as a normed vector space. We define also a four-dimensional associative algebra whose product gives the product of intervals in any cases. This approach allows to give a notion of divisibility…

Numerical Analysis · Computer Science 2009-10-22 Nicolas Goze , Elisabeth Remm

Computability theory is used to evaluate the complexity of classifying various kinds of Lebesgue spaces and associated isometric isomorphism problems.

Logic · Mathematics 2019-07-01 Tyler Brown , Alexander G. Melnikov , Timothy H. McNicholl

The concept of $typed$ $topology$ is introduced. In a typed topological space, some open sets are assigned "types", and topological concepts such as closure, connectedness can be defined using types. A finite data set in $R^2$ is a…

General Topology · Mathematics 2024-02-13 Wanjun Hu

A hierarchy of type universes is a rudimentary ingredient in the type theories of many proof assistants to prevent the logical inconsistency resulting from combining dependent functions and the type-in-type rule. In this work, we argue that…

Programming Languages · Computer Science 2024-04-09 Jonathan Chan , Stephanie Weirich

The nature of the change in perspective that accompanies the proposal of a unified physical theory deriving from the single dimension of time is elaborated. On expressing a temporal interval in a multi-dimensional form, via a direct…

General Physics · Physics 2018-04-03 David J. Jackson

In dependent type theory, being able to refer to a type universe as a term itself increases its expressive power, but requires mechanisms in place to prevent Girard's paradox from introducing logical inconsistency in the presence of…

Programming Languages · Computer Science 2025-03-03 Jonathan Chan , Stephanie Weirich

We study finite systems of subspaces of a complex Hilbert space such that each pair of subspaces satisfies a certain condition as described in the following. For each subspace excepting the first one an angle between this subspace and the…

Functional Analysis · Mathematics 2012-01-18 Ivan Feshchenko , Alexander Strelets

Modalities in homotopy type theory are used to create and access subuniverses of a given type universe. These have significant applications throughout mathematics and computer science, and in particular can be used to create universes in…

Logic in Computer Science · Computer Science 2025-02-03 Mark Damuni Williams

We define a monoidal semantics for algebraic theories. The basis for the definition is provided by the analysis of the structural rules in the term calculus of algebraic languages. Models are described both explicitly, in a form that…

Logic · Mathematics 2017-05-26 Luca Mauri

Dividing the world into subsystems is an important component of the scientific method. The choice of subsystems, however, is not defined a priori. Typically, it is dictated by experimental capabilities, which may be different for different…

Quantum Physics · Physics 2018-05-11 Giulio Chiribella

The study of homotopy theoretic phenomena in the language of type theory is sometimes loosely called `synthetic homotopy theory'. Homotopy theory in type theory is only one of the many aspects of homotopy type theory, which also includes…

Logic · Mathematics 2019-06-25 Egbert Rijke

We dwell on how a definition of a theoretical concept of an operating system, suitable to be incorporated in a mathematical theory of operating systems, could look like. This is considered a valuable preparation for the development of a…

Operating Systems · Computer Science 2010-06-07 J. A. Bergstra , C. A. Middelburg

One approach to ease the construction of frames is to first construct local components and then build a global frame from these. In this paper we will show that the study of the relation between a frame and its local components leads to the…

Functional Analysis · Mathematics 2007-05-23 Peter G. Casazza , Gitta Kutyniok

In this paper, we analyze the definition Andr\'e proposed for near-vector spaces to make it more transparent. We also study the class of near-vector spaces over division rings and give a characterization of regularity that gives a new…

Rings and Algebras · Mathematics 2019-12-17 Karin-Therese Howell , Sophie Marques

Both algebraic and computational approaches for dealing with similarity spaces are well known in generalized rough set theory. However, these studies may be said to have been confined to particular perspectives of distinguishability in the…

Logic · Mathematics 2009-05-14 A. Mani

We develop the usage of certain type theories as specification languages for algebraic theories and inductive types. We observe that the expressive power of dependent type theories proves useful in the specification of more complicated…

Logic in Computer Science · Computer Science 2023-09-12 András Kovács
‹ Prev 1 3 4 5 6 7 10 Next ›