Related papers: A Coherence Construction for the Propositional Uni…
We show that the space of sections of any line bundle on the augmented wonderful variety of a hyperplane arrangement has the structure of a coalgebra. These coalgebras correspond to the hyperplane arrangement power ideals of Ardila and…
This article re-examines Lawvere's abstract, category-theoretic proof of the fixed-point theorem whose contrapositive is a `universal' diagonal argument. The main result is that the necessary axioms for both the fixed-point theorem and the…
We develop the theory of linear algebra over a (Z_2)^n-commutative algebra (n in N), which includes the well-known super linear algebra as a special case (n=1). Examples of such graded-commutative algebras are the Clifford algebras, in…
Sorkin's coevents can be thought of as the `beables' of a quantum histories theory; in this paper we study the 'logical' implications of taking this claim at face value, constructing a propositional lattice for the space of coevents…
Several approaches to the matter creation problem in the context of cosmological models are summarily reviewed. A covariant formulation of the general relativistic imperfect simple fluid endowed with a process of matter creation is…
We show that propositional logic and its extensions can support answer-set programming in the same way stable logic programming and disjunctive logic programming do. To this end, we introduce a logic based on the logic of propositional…
We extend Bourke and Garner's idempotent adjunction between monads and pretheories to the framework of $\infty$-categories and we use this to prove many classical results about monads in the $\infty$-categorical framework. Amongst other…
In this note we provide an algorithm for translating relational structures into "proper" relational structures, i.e., those such that there is no pair of worlds w and u such that w is accessible from u for every agent. In particular, our…
We produce a highly structured way of associating a simplicial category to a model category which improves on work of Dwyer and Kan and answers a question of Hovey. We show that model categories satisfying a certain axiom are Quillen…
A holistic extension of classical propositional logic is introduced in the framework of quantum computation with mixed states. The concepts of tautology and contradiction are investigated in this extensions. A special family of quantum…
The paper presents a method for obtaining problems whose conclusions contain disjunctive propositions. These problems constitute a version of inverse problems with a given logical structure. The logical models in the groups of problems…
We develop a `universal' support theory for derived categories of constructible (analytic or \'etale) sheaves, holonomic D-modules, mixed Hodge modules and others. As applications we classify such objects up to the tensor triangulated…
We consider a universe with an arbitrary number of extra dimensions, $N$. We present a new method for constructing the cosmological equations of motion and find analytic solutions with an explicit dependence on $N$. When we take the…
This article tackles categorical coherence within a two-dimensional generalization of Lawvere's functorial semantics. 2-theories, a syntactical way of describing categories with structure, are presented. From the perspective here afforded,…
In this paper, we explore a connection between type universes and memory allocation. Type universe hierarchies are used in dependent type theories to ensure consistency, by forbidding a type from quantifying over all types. Instead, the…
We show that single-variable polynomial functors over the category $\mathcal{S}$ of infinity groupoids, as defined by Gepner-Haugseng-Kock, are exactly colimits of representable copresheaves indexed by infinity groupoid. This allows us to…
This is the third in a series of papers extending Martin-L\"of's meaning explanations of dependent type theory to a Cartesian cubical realizability framework that accounts for higher-dimensional types. We extend this framework to include a…
Is the universe computable? If so, it may be much cheaper in terms of information requirements to compute all computable universes instead of just ours. I apply basic concepts of Kolmogorov complexity theory to the set of possible…
We establish the universal properties of the bicategory of polynomials, considering both cartesian and general morphisms between these polynomials. A direct proof of these universal properties would be impractical due to the complicated…
A semantic tableau method, called an argumentation tableau, that enables the derivation of arguments, is proposed. First, the derivation of arguments for standard propositional and predicate logic is addressed. Next, an extension that…