Related papers: Three Equivalent Ordinal Notation Systems in Cubic…
A classical question of propositional logic is one of the shortest proof of a tautology. A related fundamental problem is to determine the relative efficiency of standard proof systems, where the relative complexity is measured using the…
A minimal Cantor system is said to be self-induced whenever it is conjugate to one of its induced systems. Substitution subshifts and some odometers are classical examples, and we show that these are the only examples in the equicontinuous…
In this paper, we give two proofs of the wellfoundedness of recursive notation systems for $\Pi_N$-reflecting ordinals. One is based on $\Pi_{N-1}^0$-inductive definitions, and the other is based on distinguished classes.
We show that given a rigid C*-tensor category, there is an equivalence of categories between normalized irreducible Q-systems, also known as connected unitary Frobenius algebra objects, and compact connected W*-algebra objects. Although…
We construct a model of type theory enjoying parametricity from an arbitrary one. A type in the new model is a semi-cubical type in the old one, illustrating the correspondence between parametricity and cubes. Our construction works not…
The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) we developed to formalize the foundations of universal algebra in dependent type theory using the Agda programming language and proof…
We contribute XTT, a cubical reconstruction of Observational Type Theory which extends Martin-L\"of's intensional type theory with a dependent equality type that enjoys function extensionality and a judgmental version of the unicity of…
Nominal automata models serve as a formalism for data languages, and in fact often relate closely to classical register models. The paradigm of name allocation in nominal automata helps alleviate the pervasive computational hardness of…
This paper studies the transfinite propositional provability logics $\glp_\Lambda$ and their corresponding algebras. These logics have for each ordinal $\xi< \Lambda$ a modality $\la \alpha \ra$. We will focus on the closed fragment of…
We present an extension of System F with higher-order context-free session types. The mixture of functional types with session types has proven to be a challenge for type equivalence formalization: whereas functional type equivalence is…
We introduce ordinal collapsing principles that are inspired by proof theory but have a set theoretic flavor. These principles are shown to be equivalent to iterated $\Pi^1_1$-comprehension and the existence of admissible sets, over weak…
In this survey article (which hitherto is an ongoing work-in-progress) we present the formulation of the induction and coinduction principles using the language and conventions of each of order theory, set theory, programming languages'…
Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. In this paper,…
In the former article "Formal mathematical systems including a structural induction principle" we have presented a unified theory for formal mathematical systems including recursive systems closely related to formal grammars, including the…
We study subsystems of open induction which are strongly connected to methods of automated inductive theorem proving. Specifically, we consider systems obtained from restricting induction to atoms, literals, clauses, and dual clauses. We…
We show that the category of corings over a fixed base ring with local units is equivalent to the category of comonads in (right) unital modules whose underlying functors preserve inductive limits. Changing base rings, we prove a…
We demonstrate a family of propositional formulas in conjunctive normal form so that a formula of size $N$ requires size $2^{\Omega(\sqrt[7]{N/logN})}$ to refute using the tree-like OBDD refutation system of Atserias, Kolaitis and Vardi…
In this paper we have investigated enumeration orders of elements of r.e. sets enumerated by means of Turing machines. We have defined a reducibility based on enumeration orders named "Enumeration Order Reducibility" on computable functions…
We present a systematic development of inductive limits in the categories of ordered *-vector spaces, Archimedean order unit spaces, matrix ordered spaces, operator systems and operator C*-systems. We show that the inductive limit…
We classify order $3$ linear difference operators over $\mathbb{C}(x)$ that are solvable in terms of lower order difference operators. To prove this result, we introduce the notion of absolute irreducibility for difference modules, and…