Related papers: Functorial Semantics of Second-Order Algebraic The…
The notion of a real-valued function is central to mathematics, computer science, and many other scientific fields. Despite this importance, there are hardly any positive results on decision procedures for predicate logical theories that…
We consider the termination/non-termination property of a class of loops. Such loops are commonly used abstractions of real program pieces. Second-order logic is a convenient language to express non-termination. Of course, such property is…
Cantor's ordinal numbers, a powerful extension of the natural numbers, are a cornerstone of set theory. They can be used to reason about the termination of processes, prove the consistency of logical systems, and justify some of the core…
We define sound and adequate denotational and operational semantics for the stochastic lambda calculus. These two semantic approaches build on previous work that used similar techniques to reason about higher-order probabilistic programs,…
We give an introduction to the $\mathbb{Z}$-graded representation theory of the BGG category $\mathcal{O}$ of a complex semisimple Lie algebras, with an emphasis on Soergel's combinatorial $\mathbb{V}$ functor, definitions of…
The classical theory of free analysis generalizes the noncommutative (nc) polynomials and rational functions, easily providing such results as an nc analogue of the Jacobian conjecture. However, the classical theory misses out on important…
We show that any multiple-valued function can be represented by a linear lambda term typed in a second-order polymorphic type system, using two distinct styles. The first is a circuit style, which mimics combinational circuits in switching…
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…
This paper reveals a categorical equivalence connecting two distinct quantum logic structures. The first is the orthomodular lattice, an algebraic system designed to formalize the properties of quantum systems. The second is a finitary…
We present generalization of the Bloom variety theorem of ordered algebras in fuzzy setting. We introduce algebras with fuzzy orders which consist of sets of functions which are compatible with particular binary fuzzy relations called fuzzy…
We provide a categorical interpretation of a well-known identity from linear algebra as an isomorphism of certain functors between triangulated categories arising from finite dimensional algebras. As a consequence, we deduce that the Serre…
We show that the De Donder form for second order gravity, defined in terms of Ostrogradski's version of the Legendre transformation applied to all independent variables, is globally defined by its local coordinate descriptions. It is a…
The notion of (symmetric) coloured operad or "multicategory" can be obtained from the notion of commutative algebra through a certain general process which we call "theorization" (where our term comes from an analogy with William Lawvere's…
We adapt the notion of an algebraic theory to work in the setting of quasicategories developed recently by Joyal and Lurie. We develop the general theory at some length. We study one extended example in detail: the theory of commutative…
The purpose of this paper is to show that the dual notions of elements & distinctions are the basic analytical concepts needed to unpack and analyze morphisms, duality, and universal constructions in the Sets, the category of sets and…
The well-known difficulties arising in a classification which is not set-theoretically trivial---involving what is sometimes called a non-smooth quotient---have been overcome in a striking way in the theory of operator algebras by the use…
There exists a dispute in philosophy, going back at least to Leibniz, whether is it possible to view the world as a network of relations and relations between relations with the role of objects, between which these relations hold, entirely…
The Univalent Foundations requires a logic that allows us to define structures on homotopy types, similar to how first-order logic with equality ($\text{FOL}_=$) allows us to define structures on sets. We develop the syntax, semantics and…
We define the notion of a multi-sorted algebraic theory, which is a generalization of an algebraic theory in which the objects are of different "sorts." We prove a rigidification result for simplicial algebras over these theories, showing…
Second-order polynomials generalize classical first-order ones in allowing for additional variables that range over functions rather than values. We are motivated by their applications in higher-order computational complexity theory,…