English
Related papers

Related papers: Affine logic for constructive mathematics

200 papers

It is standard to regard the intuitionistic restriction of a classical logic as increasing the expressivity of the logic because the classical logic can be adequately represented in the intuitionistic logic by double-negation, while the…

Logic in Computer Science · Computer Science 2010-06-17 Kaustuv Chaudhuri

With help of a compact Prolog-based theorem prover for Intuitionistic Propositional Logic, we synthesize minimal assumptions under which a given formula formula becomes a theorem. After applying our synthesis algorithm to cover basic…

Logic in Computer Science · Computer Science 2022-05-13 Paul Tarau

We give an analysis and generalizations of some long-established constructive completeness results in terms of categorical logic and pre-sheaf and sheaf semantics. The purpose is in no small part conceptual and organizational: from a few…

Logic · Mathematics 2017-09-19 Henrik Forssell , Christian Espíndola

Systems of deontic logic suffer either from being too expressive and therefore hard to mechanize, or from being too simple to capture relevant aspects of normative reasoning. In this article we look for a suitable way in between: the…

Artificial Intelligence · Computer Science 2018-10-24 Tomer Libal , Matteo Pascucci

Affine logic is a fragment of continuous logic, introduced by Bagheri, in which only affine functions are allowed as connectives. This has the effect of endowing type spaces with the structure of compact convex sets. We study extremal…

Logic · Mathematics 2024-12-03 Itaï Ben Yaacov , Tomás Ibarlucía , Todor Tsankov

The multi-valued logic of {\L}ukasiewicz is a substructural logic that has been widely studied and has many interesting properties. It is classical, in the sense that it admits the axiom schema of double negation, [DNE]. However, our…

Logic in Computer Science · Computer Science 2014-08-18 Rob Arthan , Paulo Oliva

NF set theory using intuitionistic logic is called iNF. We develop the theories of finite sets and their power sets and mappings, finite cardinals and their ordering, cardinal exponentiation, addition, and multiplication. We follow Rosser…

Logic · Mathematics 2025-10-31 Michael Beeson

An age-old controversy in mathematics concerns the necessity and the possibility of constructive proofs. The controversy has been rekindled by recent advances which demonstrate the feasibility of a fully constructive mathematics. This…

History and Overview · Mathematics 2024-04-10 Mark Mandelkern

Intuitionistic grammar logics fuse constructive and multi-modal reasoning while permitting the use of converse modalities, serving as a generalization of standard intuitionistic modal logics. In this paper, we provide definitions of these…

Logic in Computer Science · Computer Science 2025-12-04 Tim S. Lyon

Constructive arithmetic, or the Markov arithmetic MA, is obtained from intuitionistic arithmetic HA by adding the following two principles: the Markov principle M which distinguishes constructivism from intuitionism, and the so-called…

Logic · Mathematics 2022-09-23 V. E. Plisko

We define a family of propositional constructive modal logics corresponding each to a different classical modal system. The logics are defined in the style of Wijesekera's constructive modal logic, and are both proof-theoretically and…

Logic · Mathematics 2022-10-19 Tiziano Dalmonte

This work contributes to the theory of judgment aggregation by discussing a number of significant non-classical logics. After adapting the standard framework of judgment aggregation to cope with non-classical logics, we discuss in…

Logic in Computer Science · Computer Science 2017-11-13 Daniele Porello

In a previous publication, we introduced an abstract logic via an abstract notion of quantifier. Drawing upon concepts from categorical logic, this abstract logic interprets formulas from context as subobjects in a specific category, e.g.,…

Logic in Computer Science · Computer Science 2024-07-08 Marc Aiguier , Isabelle Bloch , Romain Pascual

In this work, we show that both logic programming and abstract argumentation frameworks can be interpreted in terms of Nelson's constructive logic N4. We do so by formalizing, in this logic, two principles that we call non-contradictory…

Artificial Intelligence · Computer Science 2022-03-29 Jorge Fandinno , Luis Fariñas del Cerro

We generalise the correspondence between $\aleph 0$-categorical theories and their automorphism groups to arbitrary complete theories in classical logic, and to some theories (including, in particular, all $\aleph 0$-categorical ones) in…

Logic · Mathematics 2021-02-04 Itaï Ben Yaacov

Bi-intuitionistic logic is the conservative extension of intuitionistic logic with a connective dual to implication. It is sometimes presented as a symmetric constructive subsystem of classical logic. In this paper, we compare three sequent…

Logic in Computer Science · Computer Science 2011-01-31 Luís Pinto , Tarmo Uustalu

In this paper I show, with a rich and systematized diet of examples, that many contra-classical logics can be presented as variants of FDE, obtained by modifying at least one of the truth or falsity conditions of some connective. Then I…

Logic in Computer Science · Computer Science 2022-04-15 Luis Estrada-González

We apply some tools developed in categorical logic to give an abstract description of constructions used to formalize constructive mathematics in foundations based on intensional type theory. The key concept we employ is that of a Lawvere…

Logic · Mathematics 2013-12-04 Maria Emilia Maietti , Giuseppe Rosolini

The need for rigorous process composition is encountered in many situations pertaining to the development and analysis of complex systems. We discuss the use of Classical Linear Logic (CLL) for correct-by-construction resource-based process…

Programming Languages · Computer Science 2018-12-04 Petros Papapanagiotou , Jacques Fleuriot

Modern categorical logic as well as the Kripke and topological models of intuitionistic logic suggest that the interpretation of ordinary "propositional" logic should in general be the logic of subsets of a given universe set. Partitions on…

Logic · Mathematics 2009-12-30 David Ellerman