English
Related papers

Related papers: B-systems

200 papers

C-systems were defined by Cartmell as the algebraic structures that correspond exactly to generalised algebraic theories. B-systems were defined by Voevodsky in his quest to formulate and prove an initiality conjecture for type theories.…

Category Theory · Mathematics 2025-02-12 Benedikt Ahrens , Jacopo Emmenegger , Paige Randall North , Egbert Rijke

In this paper we consider the class of l-bijective C-systems, i.e., C-systems for which the length function is a bijection. The main result of the paper is a construction of an isomorphism between two categories - the category of…

Logic · Mathematics 2015-12-29 Vladimir Voevodsky

In this paper, we propose an abstract definition of dependent type theories as essentially algebraic theories. One of the main advantages of this definition is its composability: simple theories can be combined into more complex ones, and…

Logic · Mathematics 2017-03-28 Valery Isaev

Relational structures are emerging as ubiquitous mathematical machinery in the semantics of open systems of various kinds. Cartesian bicategories are a well-known categorical algebra of relations that has proved especially useful in recent…

Logic in Computer Science · Computer Science 2020-03-24 Filippo Bonchi , Jens Seeber , Pawel Sobocinski

Models of dependent type theories are contextual categories with some additional structure. We prove that if a theory $T$ has enough structure, then the category $T\text{-}\mathbf{Mod}$ of its models carries the structure of a model…

Category Theory · Mathematics 2016-07-26 Valery Isaev

Algebraic theories with dependency between sorts form the structural core of Martin-L\"of type theory and similar systems. Their denotational semantics are typically studied using categorical techniques; many different categorical…

Category Theory · Mathematics 2024-12-31 Benedikt Ahrens , Peter LeFanu Lumsdaine , Paige Randall North

Aromatic B-series are a generalization of B-series. Some of the operations defined for B-series can be defined analogically for aromatic B-series. This paper derives combinatorial formulas for the composition and substitution laws for…

Numerical Analysis · Mathematics 2019-11-14 Geir Bogfjellmo

We present an approach to type theory in which the typing judgments do not have explicit contexts. Instead of judgments of shape "Gamma |- A : B", our systems just have judgments of shape "A : B". A key feature is that we distinguish free…

Logic in Computer Science · Computer Science 2010-09-16 Herman Geuvers , Robbert Krebbers , James McKinna , Freek Wiedijk

A bialgebra is a structure which is simultaneously an algebra and a coalgebra, such that the algebraic and coalgebraic parts are "compatible". Bialgebras are normally studied over a field or commutative ring. In this paper, we show how to…

Rings and Algebras · Mathematics 2009-10-30 James Worthington

The aim of this paper is two-fold: (1) introduce four systems of equations called M-systems and dual M-systems of types $A_{n}$ and $B_{n}$ respectively; (2) make a connection between M-systems (dual M-systems) and cluster algebras and…

Quantum Algebra · Mathematics 2017-07-11 Qian-Qian Zhang , Bing Duan , Jian-Rong Li , Yan-Feng Luo

A thorough investigation of the foundations of paraconsistent logics. Relations between logical principles are formally studied, a novel notion of consistency is introduced, the logics of formal inconsistency, and the subclasses of…

Logic · Mathematics 2007-05-23 W. A. Carnielli , J. Marcos

We discuss the possibility of making the {\it initial} definitions of mutually different (possibly interacting, or even entangled) systems in the context of decoherence theory. We point out relativity of the concept of elementary physical…

Quantum Physics · Physics 2012-02-21 Miroljub Dugic

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

The T-systems and Y-systems are classes of algebraic relations originally associated with quantum affine algebras and Yangians. Recently the T-systems were generalized to quantum affinizations of a wide class of quantum Kac-Moody algebras…

Quantum Algebra · Mathematics 2010-01-15 Atsuo Kuniba , Tomoki Nakanishi , Junji Suzuki

Due to the increased complexity of software development projects more and more systems are described by models. The sheer size makes it impractical to describe these systems by a single model. Instead many models are developed that provide…

Software Engineering · Computer Science 2014-09-24 Christoph Herrmann , Holger Krahn , Bernhard Rumpe , Martin Schindler , Steven Völkel

Native type systems are those in which type constructors are derived from term constructors, as well as the constructors of predicate logic and intuitionistic type theory. We present a method to construct native type systems for a broad…

Logic in Computer Science · Computer Science 2022-11-04 Christian Williams , Michael Stay

Engineering safe and secure cyber-physical systems requires system engineers to develop and maintain a number of model views, both dynamic and static, which can be seen as algebras. We posit that verifying the composition of requirement,…

Systems and Control · Electrical Eng. & Systems 2021-12-28 Georgios Bakirtzis , Eswaran Subrahmanian , Cody H. Fleming

Category Theory provides us with a clear notion of what is an internal structure. This will allow us to focus our attention on a certain type of relationship between context and structure.

Category Theory · Mathematics 2022-10-04 Dominique Bourn

The problem of "what is 'system'?" is in the very foundations of modern quantum mechanics. Here, we point out the interest in this topic in the information-theoretic context. E.g., we point out the possibility to manipulate a pair of…

Quantum Physics · Physics 2012-02-21 M. Dugic , J. Jeknic-Dugic

We propose the concept of a system algebra with a parallel composition operation and an interface connection operation, and formalize composition-order invariance, which postulates that the order of composing and connecting systems is…

Other Computer Science · Computer Science 2018-09-25 Christian Matt , Ueli Maurer , Christopher Portmann , Renato Renner , Björn Tackmann
‹ Prev 1 2 3 10 Next ›