English
Related papers

Related papers: Dyadic obligations: proofs and countermodels via h…

200 papers

Proofs (sequent calculus, natural deduction) and imperative algorithms (pseudocodes) are two well-known coexisting concepts. Then what is their relationship? Our answer is that \[ imperative\ algorithms\ =\ proofs\ with\ cuts \] This…

Logic in Computer Science · Computer Science 2022-02-15 Keehang Kwon , Hyung Joon Kwon

Warning: This paper contains a mistake, rendering the proof of the main theorem invalid. The logic of Bunched Implications (BI) combines both additive and multiplicative connectives, which include two primitive intuitionistic implications.…

Logic in Computer Science · Computer Science 2024-04-15 Alexander Gheorghiu , Simon Docherty , David Pym

This paper presents a plausible reasoning system to illustrate some broad issues in knowledge representation: dualities between different reasoning forms, the difficulty of unifying complementary reasoning styles, and the approximate nature…

Artificial Intelligence · Computer Science 2013-03-26 Wray L. Buntine

Let $E_1,\ldots,E_k$ be a collection of linear series on an algebraic variety $X$ over $\mathbb{C}$. That is, $E_i\subset H^0(X, \mathcal{L}_i)$ is a finite dimensional subspace of the space of regular sections of line bundles $…

Algebraic Geometry · Mathematics 2020-01-03 Leonid Monin

In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems---such as for instance natural deduction---are applied. Therefore, the…

Logic in Computer Science · Computer Science 2019-03-14 Guillaume Burel

In our previous research, we provided a reasoning system (called LeSAC) based on argumentation theory to provide legal support to designers during the design process. Building on this, this paper explores how to provide designers with…

Artificial Intelligence · Computer Science 2024-09-19 Zhe Yu , Yiwei Lu

We develop a second-order extension of intuitionistic modal logic, allowing quantification over propositions, both syntactically and semantically. A key feature of second-order logic is its capacity to define positive connectives from the…

Logic in Computer Science · Computer Science 2026-02-09 Justus Becker , Anupam Das , Sonia Marin , Paaras Padhiar

We investigate non-wellfounded proof systems based on parsimonious logic, a weaker variant of linear logic where the exponential modality ! is interpreted as a constructor for streams over finite data. Logical consistency is maintained at a…

Logic in Computer Science · Computer Science 2025-09-03 Matteo Acclavio , Gianluca Curzi , Giulio Guerrieri

It is shown how Dedekind cuts can be used to introduce the extended real numbers along with sound arithmetic laws via one simple rule for the addition of sets. The crucial idea is that the use of the lower and the upper part of the cuts,…

Optimization and Control · Mathematics 2026-01-06 Andreas H Hamel

Counterfactuals answer questions of what would have been observed under altered circumstances and can therefore offer valuable insights. Whereas the classical interventional interpretation of counterfactuals has been studied extensively,…

Artificial Intelligence · Computer Science 2024-08-13 Klaus-Rudolf Kladny , Julius von Kügelgen , Bernhard Schölkopf , Michael Muehlebach

We give a simple and direct proof that super-consistency implies the cut elimination property in deduction modulo. This proof can be seen as a simplification of the proof that super-consistency implies proof normalization. It also takes…

Logic in Computer Science · Computer Science 2023-04-24 Gilles Dowek , Olivier Hermant

In this paper I will show the problems that are encountered when dealing with uniqueness of connectives in a bilateralist setting within the larger framework of proof-theoretic semantics and suggest a solution. Therefore, the logic 2Int is…

Logic in Computer Science · Computer Science 2022-10-04 Sara Ayhan

In \cite{Lyon24} the question of the decidability of quasi-dense modal logics is answered, and an upper bound in $\EXPSPACE$ is given. Unfortunately, authors' intricate proof seems to contain a major flaw that cannot be fixed, leaving the…

Logic in Computer Science · Computer Science 2025-08-11 Olivier Gasquet

Given a closed two dimensional manifold, we prove a general existence result for a class of elliptic PDEs with exponential nonlinearities and negative Dirac deltas on the right-hand side, extending a theory recently obtained for the regular…

Analysis of PDEs · Mathematics 2011-09-30 Alessandro Carlotto , Andrea Malchiodi

We establish a supercongruence conjectured by Almkvist and Zudilin, by proving a corresponding $q$-supercongruence. Similar $q$-supercongruences are established for binomial coefficients and the Ap\'{e}ry numbers, by means of a general…

Number Theory · Mathematics 2019-12-03 Ofir Gorodetsky

We present a family of paraconsistent counterparts of the constructive modal logic CK. These logics aim to formalise reasoning about contradictory but non-trivial propositional attitudes like beliefs or obligations. We define their…

Logic in Computer Science · Computer Science 2025-08-26 Han Gao , Daniil Kozhemiachenko , Nicola Olivetti

For large classes of systems of polynomial nonlinear PDEs necessary and sufficient conditions are given for the existence of solutions which are discontinuous across hyper-surfaces. These PDEs contain the Navier-Stokes equations, as well as…

General Mathematics · Mathematics 2007-05-23 Elemer E Rosinger

It is believed arXiv:0808.2762, arXiv:math/9904055 that, among the coefficients entering Kontsevich's formality quasi-isomorphism arXiv:q-alg/9709040, there are irrational (possibly even transcendental) numbers. In this paper, we prove that…

K-Theory and Homology · Mathematics 2017-02-10 Vasily Dolgushev

Given a bicovariant differential calculus $(\mathcal{E}, d)$ such that the braiding map is diagonalisable in a certain sense, the bimodule of two-tensors admits a direct sum decomposition into symmetric and anti-symmetric tensors. This is…

Quantum Algebra · Mathematics 2020-08-13 Jyotishman Bhowmick , Sugato Mukhopadhyay

Counterfactual explanations offer an intuitive and straightforward way to explain black-box models and offer algorithmic recourse to individuals. To address the need for plausible explanations, existing work has primarily relied on…

Machine Learning · Computer Science 2023-12-19 Patrick Altmeyer , Mojtaba Farmanbar , Arie van Deursen , Cynthia C. S. Liem
‹ Prev 1 8 9 10 Next ›