English
Related papers

Related papers: Nelson's Logic S

200 papers

This introduction begins with a section on fundamental notions of mathematical logic, including propositional logic, predicate or first-order logic, completeness, compactness, the L\"owenheim-Skolem theorem, Craig interpolation, Beth's…

Logic · Mathematics 2023-11-28 Anton Freund

Motivated by Kalman residuated lattices, Nelson residuated lattices and Nelson paraconsistent residuated lattices, we provide a natural common generalization of them. Nelson conucleus algebras unify these examples and further extend them to…

Rings and Algebras · Mathematics 2021-07-30 Manuela Busaniche , Nikolaos Galatos , Miguel Andrés Marcos

We present natural deduction systems and associated modal lambda calculi for the necessity fragments of the normal modal logics K, T, K4, GL and S4. These systems are in the dual-context style: they feature two distinct zones of…

Logic in Computer Science · Computer Science 2023-06-22 G. A. Kavvos

We introduce the $L_!^S$-calculus, a linear lambda-calculus extended with scalar multiplication and term addition, that acts as a proof language for intuitionistic linear logic (ILL). These algebraic operations enable the direct expression…

Logic in Computer Science · Computer Science 2025-12-22 Alejandro Díaz-Caro , Malena Ivnisky , Octavio Malherbe

This report first shows the equivalence bewteen several formulations of classical logic in intuitionistic logic (tertium non datur, reductio ad absurdum, Pierce's law). Then it establishes the correctness of the G\"odel-Kolmogorov…

Logic · Mathematics 2016-02-26 Richard Moot , Christian Retoré

In our previous work, we proposed the logic obtained from full non-associative Lambek calculus by adding a sort of linear-logical modality. We call this logic non-associative non-commutative intuitionistic linear logic ($\mathbf{NACILL}$,…

Logic · Mathematics 2020-03-04 Hiromi Tanaka

A grammar logic refers to an extension to the multi-modal logic K in which the modal axioms are generated from a formal grammar. We consider a proof theory, in nested sequent calculus, of grammar logics with converse, i.e., every modal…

Logic in Computer Science · Computer Science 2012-04-12 Alwen Tiu , Egor Ianovski , Rajeev Gore

This paper introduces two sequent calculi for intuitionistic strong L\"ob logic ${\sf iSL}_\Box$: a terminating sequent calculus ${\sf G4iSL}_\Box$ based on the terminating sequent calculus ${\sf G4ip}$ for intuitionistic propositional…

Logic · Mathematics 2023-03-07 Iris van der Giessen , Rosalie Iemhoff

Expectation is a central notion in probability theory. The notion of expectation also makes sense for other notions of uncertainty. We introduce a propositional logic for reasoning about expectation, where the semantics depends on the…

Artificial Intelligence · Computer Science 2007-05-23 Joseph Y. Halpern , Riccardo Pucella

This work is the first exploration of proof-theoretic semantics for a substructural logic. It focuses on the base-extension semantics (B-eS) for intuitionistic multiplicative linear logic (IMLL). The starting point is a review of…

Logic in Computer Science · Computer Science 2024-11-13 Alexander V. Gheorghiu , Tao Gu , David J. Pym

Lorenzen's ``Algebraische und logistische Untersuchungen \"uber freie Verb\"ande'' appeared in 1951 in The journal of symbolic logic. These ``Investigations'' have immediately been recognised as a landmark in the history of infinitary proof…

Logic · Mathematics 2023-09-22 Paul Lorenzen

The work is devoted to Computability Logic (CoL) -- the philosophical/mathematical platform and long-term project for redeveloping classical logic after replacing truth} by computability in its underlying semantics (see…

Logic in Computer Science · Computer Science 2012-08-03 Giorgi Japaridze

In this paper we demonstrate decidability for the intuitionistic modal logic S4 first formulated by Fischer Servi. This solves a problem that has been open for almost thirty years since it had been posed in Simpson's PhD thesis in 1994. We…

Logic in Computer Science · Computer Science 2023-08-01 Marianna Girlando , Roman Kuznets , Sonia Marin , Marianela Morales , Lutz Straßburger

Beginning with a simple semantics for propositions, based on counting observations, it is shown that probabilistic and fuzzy logic correspond to two different heuristic assumptions regarding the combination of propositions whose evidence…

Artificial Intelligence · Computer Science 2020-09-29 Ben Goertzel

We extend to natural deduction the approach of Linear Nested Sequents and of 2-sequents. Formulas are decorated with a spatial coordinate, which allows a formulation of formal systems in the original spirit of natural deduction -- only one…

Logic in Computer Science · Computer Science 2021-04-27 Simone Martini , Andrea Masini , Margherita Zorzi

The foundations of formal models for epistemic and doxastic logics often rely on certain logical aspects of modal logics such as S4 and S4.2 and their semantics; however, the corresponding mathematical results are often stated in papers or…

Logic in Computer Science · Computer Science 2024-04-24 Laura P. Gamboa Guzman , Kristin Y. Rozier

The intersection type assignment system has been designed directly as deductive system for assigning formulae of the implicative and conjunctive fragment of the intuitionistic logic to terms of lambda-calculus. But its relation with the…

Logic in Computer Science · Computer Science 2011-01-25 Simona Ronchi Della Rocca , Alexis Saurin , Yiorgos Stavrinos , Anastasia Veneti

In many situations humans have to reason with inconsistent knowledge. These inconsistencies may occur due to not fully reliable sources of information. In order to reason with inconsistent knowledge, it is not possible to view a set of…

Artificial Intelligence · Computer Science 2024-12-16 Nico Roos

Logic has its origins in basic questions about the nature of the real world and how we describe it. This article seeks to bring out the physical and epistemological relevance of some of the more recent technical work in logic and…

Logic · Mathematics 2011-09-08 S. Barry Cooper

We provide a version of first-order hybrid tense logic with predicate abstracts and definite descriptions as the only non-rigid terms. It is formalised by means of a tableau calculus working on sat-formulas. A particular theory of DD…

Logic in Computer Science · Computer Science 2024-12-03 Andrzej Indrzejczak , Michał Zawidzki