Related papers: On the Compatibility of Constructive Predicative M…
We employ the Zermelo-Fraenkel Axioms that characterize sets as mathematical primitives. The Anti-foundation Axiom plays a significant role in our development, since among other of its features, its replacement for the Axiom of Foundation…
This paper introduces an alternative approach to proving the existence of choice functions for specific families of sets within Zermelo-Fraenkel set theory (ZF) without assuming any form on the Axiom of Choice (AC). Traditional methods of…
The existence of apparently coincidental equalities (also called Wilf-equivalences) between the enumeration sequences, or generating functions, of various hereditary classes of combinatorial structures has attracted significant interest. We…
Computational functionalism about consciousness is often criticized for relying on observer-relative interpretations of physical systems. This paper proposes a mathematical refinement of functionalism that avoids this problem. The central…
This paper deals with certain fundamental results about affine hulls and simplices in a real normed linear space. The framework of the paper is Bishop's constructive mathematics, which, with its characteristic interpretation of existence as…
The paper deals with Henselian valued field with analytic structure. Actually, we are focused on separated analytic structures, but the results remain valid for strictly convergent analytic ones as well. A classical example of the latter is…
A class of models is presented, in the form of continuation monads polymorphic for first-order individuals, that is sound and complete for minimal intuitionistic predicate logic. The proofs of soundness and completeness are constructive and…
We introduce a notion of the ``explanation" of one (generalized) probabilistic model by another as particular kind of span in the category $\Prob$ of probabilistic models and morphisms. We show that explanations compose under a standard…
We present a family of minimal modal logics (namely, modal logics based on minimal propositional logic) corresponding each to a different classical modal logic. The minimal modal logics are defined based on their classical counterparts in…
For a complexity class $C$ and language $L$, a constructive separation of $L \notin C$ gives an efficient algorithm (also called a refuter) to find counterexamples (bad inputs) for every $C$-algorithm attempting to decide $L$. We study the…
A Weyl structure is usually defined by an equivalence class of pairs $({\bf g}, \boldsymbol{\omega})$ related by Weyl transformations, which preserve the relation $\nabla {\bf g}=\boldsymbol{\omega}\otimes{\bf g}$, where ${\bf g}$ and…
Non-wellfounded material sets have been modelled in Martin-L\"of type theory by Lindstr\"om using setoids. In this paper we construct models of non-wellfounded material sets in Homotopy Type Theory (HoTT) where equality is interpreted as…
The classical ``computation'' methods in Algebraic Topology most often work by means of highly infinite objects and in fact +are_not+ constructive. Typical examples are shown to describe the nature of the problem. The Rubio-Sergeraert…
Let $W$ be an affine Weyl group, and let $\Bbbk$ be a field of characteristic $p>0$. The diagrammatic Hecke category $\mathcal{D}$ for $W$ over $\Bbbk$ is a categorification of the Hecke algebra for $W$ with rich connections to modular…
This paper exposes a contradiction in the Zermelo-Fraenkel set theory with the axiom of choice (ZFC). While Godel's incompleteness theorems state that a consistent system cannot prove its consistency, they do not eliminate proofs using a…
We study three related topics in representation theory of classical Lie superalgebras. The first one is classification of primitive ideals, i.e. annihilator ideals of simple modules, and inclusions between them. The second topic concerns…
Starting from certain rational varieties blown-up from (P^1)^N, we construct a tropical, i.e., subtraction-free birational, representation of Weyl groups as a group of pseudo isomorphisms of the varieties. Furthermore, we develop an…
Four types of discrete transforms of Weyl orbit functions on the finite point sets are developed. The point sets are formed by intersections of the dual-root lattices with the fundamental domains of the affine Weyl groups. The finite sets…
Homotopy type theory is a modern foundation for mathematics that introduces the univalence axiom and is particularly suitable for the study of homotopical mathematics and its formalization via proof assistants. In order to better comprehend…
"Church's thesis" ($\mathsf{CT}$) as an axiom in constructive logic states that every total function of type $\mathbb{N} \to \mathbb{N}$ is computable, i.e. definable in a model of computation. $\mathsf{CT}$ is inconsistent in both…