相关论文: On Various Negative Translations

This contribution introduces a model order reduction approach for an advection-reaction problem with a parametrized reaction function. The underlying discretization uses an ultraweak formulation with an $L^2$-like trial space and an…

A new mathematical notation is proposed for the iteration of functions. It facilitates the application of the iteration of functions in mathematical and logical expressions, definitions of sets, and formulations of algorithms. Illustrations…

This is not standard in the sense that we understand a Springer map to be a collapsing of homogeneous bundles. Apart from that we use mostly techniques from Chriss and Ginzbergs book but we work in the equivariant derived category of…

The G\"odel translation provides an embedding of the intuitionistic logic $\mathsf{IPC}$ into the modal logic $\mathsf{Grz}$, which then embeds into the modal logic $\mathsf{GL}$ via the splitting translation. Combined with Solovay's…

In this paper, we build on a recent bicategorical model called thin spans of groupoids, introduced by Clairambault and Forest. Notably, thin spans feature a decomposition of symmetry into two sub-groupoids of polarized -- positive and…

Traditional approaches to modelling parallelism and algebraic structure in lambda calculi often rely on monads$\unicode{x2013}$as in Moggi's framework$\unicode{x2013}$or on rich categorical structures such as biproducts$\unicode{x2013}$as…

In a 1985 commentary to his collected works, Kolmogorov informed the reader that his 1932 paper 'On the interpretation of intuitionistic logic' "was written in hope that with time, the logic of solution of problems [i.e., intuitionistic…

The first order Plebanski formulation of (complex) general relativity (GR) in terms of self-dual 2-forms admits a generalization, proposed by Krasnov, that is qualitatively different from other possible generalizations of GR in terms of…

Computational effects are commonly modelled by monads, but often a monad can be presented by an algebraic theory of operations and equations. This talk is about monads and algebraic theories for languages for inference, and their…

Negation poses a challenge in many natural language understanding tasks. Inspired by the fact that understanding a negated statement often requires humans to infer affirmative interpretations, in this paper we show that doing so benefits…

Based on an analysis of the inference rules used, we provide a characterization of the situations in which classical provability entails intuitionistic provability. We then examine the relationship of these derivability notions to uniform…

The notion of minimal complements was introduced by Nathanson in 2011. Since then, the existence or the inexistence of minimal complements of sets have been extensively studied. Recently, the study of inverse problems, i.e., which sets can…

Under the extension of Curry-Howard's correspondence to classical logic, Gentzen's NK and LK systems can be seen as syntax-directed systems of simple types respectively for Parigot's Lambda Mu Calculus and Curien-Herbelin's Lambda Bar Mu Mu…

We propose another interpretation of well-known derivatives computations from regular expressions, due to Brzozowski, Antimirov or Lombardy and Sakarovitch, in order to abstract the underlying data structures (e.g. sets or linear…

Many automatic theorem provers are restricted to untyped logics, and existing translations from typed logics are bulky or unsound. Recent research proposes monotonicity as a means to remove some clutter when translating monomorphic to…

Answering a question by Honsell and Plotkin, we show that there are two equations between lambda terms, the so-called subtractive equations, consistent with lambda calculus but not simultaneously satisfied in any partially ordered model…

Let G be a reductive complex algebraic group and V a finite-dimensional G-module. From elements of the invariant algebra C[V]^G we obtain by polarization elements of C[kV]^G, where k\geq 1 and kV denotes the direct sum of k copies of V. For…

In this paper an asymmetrical operator of generalised translation is introduced, the generalised modulus of smoothness is defined by its means and the direct and inverse theorems in approximation theory are proved for that modulus. ----- V…

The correspondence principle states that classical mechanics emerges from quantum mechanics in the appropriate limits. However, beyond this heuristic rule, an information-theoretic perspective reveals that classical mechanics is a…

We describe a method for inverting Gentzen's cut-elimination in classical first-order logic. Our algorithm is based on first computign a compressed representation of the terms present in the cut-free proof and then cut-formulas that realize…