Related papers: A Report on Realizability
We study associative multiplications in semi-simple associative algebras over C compatible with the usual one. An interesting class of such multiplications is related to the affine Dynkin diagrams of A, D, E-type. In this paper we…
We investigate the computational properties of basic mathematical notions pertaining to $\mathbb{R}\rightarrow \mathbb{R}$-functions and subsets of $\mathbb{R}$, like finiteness, countability, (absolute) continuity, bounded variation,…
A new class of integrable maps, obtained as lattice versions of polynomial dynamical systems is introduced. These systems are obtained by means of a discretization procedure that preserves several analytic and algebraic properties of a…
We extend unified correspondence theory to Kripke frames with impossible worlds and their associated regular modal logics. These are logics the modal connectives of which are not required to be normal: only the weaker properties of…
This paper is devoted to the classification and studying properties of complex unital $3$-dimensional structurable algebras. We provide a complete list of non-isomorphic classes, identifying five algebras for type $(2, 1)$ and two algebras…
A computable structure $\mathcal{A}$ has degree of categoricity $\mathbf{d}$ if $\mathbf{d}$ is exactly the degree of difficulty of computing isomorphisms between isomorphic computable copies of $\mathcal{A}$. Fokina, Kalimullin, and Miller…
We give a method to transform into programs, classical proofs using a well ordering of the reals. The technics uses a generalization of Cohen's forcing and the theory of classical realizability introduced by the author.
We associate with any simplicial complex $\K$ and any integer $m$ a system of linear equations and inequalities. If $\K$ has a simplicial embedding in $\R^m$ then the system has an integer solution. This result extends the work of I. Novik…
Following a line of research initiated in \cite{BBNN}, I describe a general framework for turning reduction concepts of relative computability into diagrams forming an analogy with the Cicho\'n diagram for cardinal characteristics of the…
Given a compact basic semi-algebraic set $K\subset R^n\times R^m$, a simple set $B$ (box or ellipsoid), and some semi-algebraic function $f$, we consider sets defined with quantifiers, of the form $R_f:=\{x\in B: \mbox{$f(x,y)\leq 0$ for…
Knowledge can be represented compactly in a multitude ways, from a set of propositional formulas, to a Kripke model, to a database. In this paper we study the aggregation of information coming from multiple sources, each source submitting a…
We consider filtered or graded algebras $A$ over a field $K$. Assume that there is a discrete valuation $O_v$ of $K$ with $m_v$ its maximal ideal and $k_v:=O_v/m_v$ its residue field. Let $\Lambda$ be $O_v$-order such that $\Lambda K=A$ and…
Operating envelope is an important concept in industrial operations. Accurate identification for operating envelope can be extremely beneficial to stakeholders as it provides a set of operational parameters that optimizes some key…
By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In…
In this paper we consider transfinite provability logics where for each ordinal in some recursive well-order we have a corresponding modal provability operator. The modality [xi] will be interpreted as "provable in ACA_0 together with at…
We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…
In applications that use knowledge representation (KR) techniques, in particular those that combine data-driven and logic methods, the domain of objects is not an abstract unstructured domain, but it exhibits a dedicated, deep structure of…
We give a notation of Krichever-Novikov vertex algebras on compact Riemann surfaces which is a bit weaker, but quite similar to vertex algebras. As example, we construct Krichever-Novikov vertex algebras of generalized Heisenberg algebras…
A class of nets in constructive (in A.A.Markov's sense) topological space for which the convergence is equivalent to convergence of all subsequences, is described. B.A.Kushner's theorem about coincidence of strong and weak constructive…
We introduce the chain geometry $\Sigma(K,R)$ over a ring $R$ with a distinguished subfield $K$, thus extending the usual concept where $R$ has to be an algebra over $K$. A chain is uniquely determined by three of its points, if, and only…