相关论文: A proof of strong normalisation using domain theor…
Strong typicality and the Markov lemma have been used in the proofs of several multiterminal source coding theorems. Since these two tools can be applied to finite alphabets only, the results proved by them are subject to the same…
We present an extension of the second-order logic AF2 with iso-style inductive and coinductive definitions specifically designed to extract programs from proofs a la Krivine-Parigot by means of primitive (co)recursion principles. Our logic…
We propose a set theory strong enough to interpret powerful type theories underlying proof assistants such as LEGO and also possibly Coq, which at the same time enables program extraction from its constructive proofs. For this purpose, we…
We provide a self-contained introduction to Gr\"obner bases of submodules of $R[x_1, \ldots, x_n]^k$, where $R$ is a Euclidean domain, and explain how to use these bases to solve linear systems over $R[x_1, \ldots, x_n]$.
We introduce a new topological invariant of a rigidly-compactly generated tensor-triangulated category and two new notions of support. The first is based on smashing subcategories: it is unknown whether the frame of smashing subcategories…
The theory revision problem is the problem of how best to go about revising a deficient domain theory using information contained in examples that expose inaccuracies. In this paper we present our approach to the theory revision problem for…
Automated Theorem Proving (ATP) deals with the development of computer programs being able to show that some conjectures (queries) are a logical consequence of a set of axioms (facts and rules). There exists several successful ATPs where…
Usually such area of mathematics as differential equations acts as a consumer of results given by functional analysis. This article will give an example of the reverse interaction of these two fields of knowledge. Namely, the derivation and…
In the framework of explicit substitutions there is two termination properties: preservation of strong normalization (PSN), and strong normalization (SN). Since there are not easily proved, only one of them is usually established (and…
Binary classifiers are often employed as discriminators in GAN-based unsupervised style transfer systems to ensure that transferred sentences are similar to sentences in the target domain. One difficulty with this approach is that the error…
Convolutional Neural Networks (CNNs) show impressive performance in the standard classification setting where training and testing data are drawn i.i.d. from a given domain. However, CNNs do not readily generalize to new domains with…
Even though modularity has been studied extensively in conventional logic programming, there are few approaches on how to incorporate modularity into Answer Set Programming, a prominent rule-based declarative programming paradigm. A major…
We propose a new bi-intuitionistic type theory called Dualized Type Theory (DTT). It is a simple type theory with perfect intuitionistic duality, and corresponds to a single-sided polarized sequent calculus. We prove DTT strongly…
We explore the application of transformer-based language models to automated theorem proving. This work is motivated by the possibility that a major limitation of automated theorem provers compared to humans -- the generation of original…
We prove a generalization of the polarization identity of linear algebra expressing the inner product of a complex inner product space in terms of the norm, where the field of scalars is extended to an associative algebra equipped with an…
Current methods for Black-Box NLP interpretability, like LIME or SHAP, are based on altering the text to interpret by removing words and modeling the Black-Box response. In this paper, we outline limitations of this approach when using…
In this article, we prove a generalisation of the Mertens theorem for prime numbers to number fields and algebraic varieties over finite fields, paying attention to the genus of the field (or the Betti numbers of the variety), in order to…
The Agda Universal Algebra Library (agda-algebras) 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…
We describe several views of the semantics of a simple programming language as formal documents in the calculus of inductive constructions that can be verified by the Coq proof system. Covered aspects are natural semantics, denotational…
Reflection positivity constitutes an integral prerequisite in the Osterwalder-Schrader reconstruction theorem which relates quantum field theories defined on Euclidean space to their Lorentzian signature counterparts. In this work we…