Related papers: Kolmogorov-Veloso Problems and Dialectica Categori…

Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satisfiability threshold has centered around the structure and…

Modelling concept representation is a foundational problem in the study of cognition and linguistics. This work builds on the confluence of conceptual tools from G\"ardenfors semantic spaces, categorical compositional linguistics, and…

This paper describes a computational framework for a grammar architecture in which different linguistic domains such as morphology, syntax, and semantics are treated not as separate components but compositional domains. Word and phrase…

This thesis splits into two major parts. The connection between the two parts is the notion of "categorification" which we shortly explain/recall in the introduction. In the first part of this thesis we extend Bar-Natan's cobordism based…

The paper provides an introduction to the field of Algebraic Set Theory (AST). AST is a flexible categorical framework for studying different kinds of set theories: both classical and constructive, predicative and impredicative. We discuss…

The Fa\`a di Bruno construction, introduced by Cockett and Seely, constructs a comonad $\mathsf{Fa{\grave{a}}}$ whose coalgebras are precisely Cartesian differential categories. In other words, for a Cartesian left additive category…

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.…

This research introduces a new method for the transition from partial to ordinary differential equations that is based on the Kolmogorov superposition theorem. In this paper, we discuss the numerical implementation of the Kolmogorov theorem…

In a 1985 commentary to his collected works, Kolmogorov remarked that his 1932 paper "was written in hope that with time, the logic of solution of problems [i.e., intuitionistic logic] will become a permanent part of a [standard] course of…

For logarithmic conformal field theories whose monodromy data is given by a not necessarily semisimple modular category, we solve the problem of constructing and classifying the consistent systems of correlators. The correlator construction…

Choice and independence of premise principles play an important role in characterizing Kreisel's modified realizability and G\"odel's Dialectica interpretation. In this paper we show that a great many intuitionistic set theories are closed…

We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method. Example results are: (i) the mean and variance…

A structure called a decision making problem is considered. The set of outcomes (consequences) is partially ordered according to the decision maker's preferences. The problem is how these preferences affect a decision maker to prefer one of…

Denotational semantics can be based on algebras with additional structure (order, metric, etc.) which makes it possible to interpret recursive specifications. It was the idea of Elgot to base denotational semantics on iterative theories…

For a set-endofunctor $F$, we extend the notion of universal $F$-coalgebras to $F$-graphs. These generalized coalgebras are models for various types of graphs, such as (un)directed (hyper)graphs, relational structures or fuzzy graphs. The…

F-systems are digraphs that enable to model sentences that predicate the falsity of other sentences. Paradoxes like the Liar and Yablo's can be analyzed with that tool to find graph-theoretic patterns. In this paper we present the F-systems…

Alternative partial Boolean structures, implicit in the discussion of classical representability of sets of quantum mechanical predictions, are characterized, with definite general conclusions on the equivalence of the approaches going back…

We define a general concept of pseudo algebras over theories and 2-theories. A more restrictive such notion was introduced by Hu and Kriz, but as noticed by M. Gould, did not capture the desired examples. The approach taken in this paper…

The Axiom-Based Atlas is a novel framework that structurally represents mathematical theorems as proof vectors over foundational axiom systems. By mapping the logical dependencies of theorems onto vectors indexed by axioms - such as those…

The aim of the paper is to build a connection between two approaches towards categorical language theory: the coalgebraic and algebraic language theory for monads. For a pair of monads modelling the branching and the linear type we defined…