English
Related papers

Related papers: Affine logic for constructive mathematics

200 papers

We present the intuitionistic version of PUC-Logic. After that, we present a constructive approach to Lewis' counterfactual abstraction to show that it does not require the classical absurd rule.

Logic in Computer Science · Computer Science 2014-05-22 Ricardo Q. A. Fernandes , Edward H. Haeusler , Luiz Carlos Pereira

We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus for an impredicative logic -- in our case a sequent calculus for…

Logic in Computer Science · Computer Science 2019-03-14 Christoph Benzmueller , Chad E. Brown , Michael Kohlhase

We propose a categorial grammar based on classical multiplicative linear logic. This can be seen as an extension of abstract categorial grammars (ACG) and is at least as expressive. However, constituents of {\it linear logic grammars (LLG)}…

Logic · Mathematics 2020-08-04 Sergey Slavnov

We describe a new cognitive ability, i.e., functional conceptual substratum, used implicitly in the generation of several mathematical proofs and definitions. Furthermore, we present an initial (first-order) formalization of this mechanism…

Logic · Mathematics 2017-10-12 Danny A. J. Gomez-Ramirez , Stefan Hetzl

Consider a binary classification problem solved using a feed-forward artificial neural network (ANN). Let the ANN be composed of a ReLU layer and several linear layers (convolution, sum-pooling, or fully connected). We assume the network…

Logic in Computer Science · Computer Science 2024-08-27 Ingo Schmitt

We obtain, for the first time, a modular many-valued semantics for combined logics, which is built directly from many-valued semantics for the logics being combined, by means of suitable universal operations over partial non-deterministic…

Logic · Mathematics 2024-05-22 Carlos Caleiro , Sérgio Marcelino

Taking an algebraic perspective on the basic structures of Rough Concept Analysis as the starting point, in this paper we introduce some varieties of lattices expanded with normal modal operators which can be regarded as the natural rough…

The theory of abstract argumentation frameworks (afs) has, in the main, focused on finite structures, though there are many significant contexts where argumentation can be regarded as a process involving infinite objects. To address this…

Artificial Intelligence · Computer Science 2018-10-12 Pietro Baroni , Federico Cerutti , Paul E. Dunne , Massimiliano Giacomin

In this paper we propose a way to construct an analytic space over a non-archimedean field, starting with a real manifold with an affine structure which has integral monodromy. Our construction is motivated by the junction of Homological…

Algebraic Geometry · Mathematics 2007-05-23 Maxim Kontsevich , Yan Soibelman

Non-classical generalizations of classical modal logic have been developed in the contexts of constructive mathematics and natural language semantics. In this paper, we discuss a general approach to the semantics of non-classical modal…

Logic · Mathematics 2024-06-25 Wesley H. Holliday

We introduce a new logic that combines Adjoint Logic with Graded Necessity Modalities. This results in a very expressive system capable of controlling when and how structural rules are used. We give a sequent calculus, natural deduction,…

Logic in Computer Science · Computer Science 2020-06-17 Harley Eades , Dominic Orchard

We introduce a notion of Kripke model for classical logic for which we constructively prove soundness and cut-free completeness. We discuss the novelty of the notion and its potential applications.

Logic · Mathematics 2014-11-04 Danko Ilik , Gyesik Lee , Hugo Herbelin

We introduce and develop propositional continuous intuitionistic logic and propositional continuous affine logic via complete algebraic semantics. Our approach centres on AC-algebras, which are algebras $USC(\mathcal{L})$ of sup-preserving…

Logic in Computer Science · Computer Science 2026-02-06 Guillaume Geoffroy

The constructive approach to mathematics has the advantage that witnesses can be extracted from statements of existence and theorems can be unwound to give algorithms. Even better, constructive theorems can be interpreted in any topos,…

General Topology · Mathematics 2024-11-26 Graham Manuell

A new syntactic characterization of problems complete via Turing reductions is presented. General canonical forms are developed in order to define such problems. One of these forms allows us to define complete problems on ordered…

Computational Complexity · Computer Science 2014-11-25 Vladimir Naidenko

This paper has several purposes. We present through a critical review the results from already published papers on the constructive semigroup theory, and contribute to its further development by giving solutions to open problems. We also…

General Mathematics · Mathematics 2023-06-22 Melanija Mitrovic , Mahouton Norbert Hounkonnou , Marian Alexandru Baroni

Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…

Logic in Computer Science · Computer Science 2021-01-26 Michał R. Przybyłek

We give a constructive treatment of some basic concepts and results in semigroup theory. Focusing on semigroups equipped with an apartness relation, we give analogues, from the point of view of apartness, of several classical constructions…

Group Theory · Mathematics 2021-09-07 Erik Darpö , Melanija Mitrović

Smooth manifolds have been always understood intuitively as spaces with an affine geometry on the infinitesimal scale. In Synthetic Differential Geometry this can be made precise by showing that a smooth manifold carries a natural structure…

Differential Geometry · Mathematics 2023-04-05 Filip Bár

The categorical compositional approach to meaning has been successfully applied in natural language processing, outperforming other models in mainstream empirical language processing tasks. We show how this approach can be generalized to…

Logic in Computer Science · Computer Science 2017-10-02 Joe Bolt , Bob Coecke , Fabrizio Genovese , Martha Lewis , Dan Marsden , Robin Piedeleu