Related papers: Syntactic approaches to opetopes
\texttt{DiscoTEX} is a highly accurate numerical algorithm for computing numerical weak-form solutions to distributionally sourced partial differential equations (PDE)s. The aim of this second paper, succeeding \cite{da2024discotex}, is to…
We develop a theory of weak omega categories that will be accessible to anyone who is familiar with the language of categories and functors and who has encountered the definition of a strict 2-category. The most remarkable feature of this…
We develop a direct method to recover an orthoalgebra from its poset of Boolean subalgebras. For this a new notion of direction is introduced. Directions are also used to characterize in purely order-theoretic terms those posets that are…
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…
This work presents the tessellations and polytopes from the perspective of both n-dimensional geometry and abstract symmetry groups. It starts with a brief introduction to the terminology and a short motivation. In the first part, it…
Integrable systems in low dimensions, constructed through the symmetry reduction method, are studied using phase portrait and variable separation techniques. In particular, invariant quantities and explicit periodic solutions are…
We investigate a special kind of contraction of symmetric spaces (respectively, of Lie triple systems), called homotopy. In this first part of a series of two papers we construct such contractions for classical symmetric spaces in an…
A standard informal method for analyzing the asymptotic complexity of a program is to extract a recurrence that describes its cost in terms of the size of its input, and then to compute a closed-form upper bound on that recurrence. We give…
We show that the positive zoom complexes, with fairly natural morphisms, form a dual category to the category of positive opetopes with contraction epimorphisms. We also show how this duality can be extended to opetopic cardinals.
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction. These proof principles…
Abduction is a fundamental and important form of non-monotonic reasoning. Given a knowledge base explaining how the world behaves it aims at finding an explanation for some observed manifestation. In this paper we focus on propositional…
This paper proposes a definition of what it means for one system description language to encode another one, thereby enabling an ordering of system description languages with respect to expressive power. I compare the proposed definition…
We introduce judgemental theories and their calculi as a general framework to present and study deductive systems. As an exemplification of their expressivity, we approach dependent type theory and natural deduction as special kinds of…
We study the $2$-categories BIon, of (generalized) bounded ionads, and $\text{Acc}_\omega$, of accessible categories with directed colimits, as an abstract framework to approach formal model theory. We relate them to topoi and (lex)…
The present work is dedicated to searching parameters, alternative to entropy, applicable for description of highly organized systems. The general concept has been offered, in which the system complexity and order are functions of the order…
The primary goal of this paper is to present a unified way to transform the syntax of a logic system into certain initial algebraic structure so that it can be studied algebraically. The algebraic structures which one may choose for this…
Categorification is the process of finding category-theoretic analogs of set-theoretic concepts by replacing sets with categories, functions with functors, and equations between functions by natural isomorphisms between functors, which in…
We develop a theory for the representation of opaque solids as volumes. Starting from a stochastic representation of opaque solids as random indicator functions, we prove the conditions under which such solids can be modeled using…
Superposition is an established decision procedure for a variety of first-order logic theories represented by sets of clauses. A satisfiable theory, saturated by superposition, implicitly defines a minimal term-generated model for the…
Diagrammatic sets are presheaves on a rich category of shapes, whose definition is motivated by combinatorial topology and higher-dimensional diagram rewriting. These shapes include representatives of oriented simplices, cubes, and positive…