Results 101 to 110 of about 785,300 (287)
Lewis meets Brouwer: constructive strict implication
C. I. Lewis invented modern modal logic as a theory of "strict implication". Over the classical propositional calculus one can as well work with the unary box connective.
Litak, Tadeusz, Visser, Albert
core +1 more source
Decidable quasivarieties of p‐algebras
Abstract We show that for quasivarieties of p‐algebras the properties of (i) having decidable first‐order theory and (ii) having decidable first‐order theory of the finite members, coincide. The only two quasivarieties with these properties are the trivial variety and the variety of Boolean algebras. This contrasts sharply, even for varieties, with the
Tomasz Kowalski, Katarzyna Słomczyńska
wiley +1 more source
Breaking barriers toward a net‐zero economy
Abstract Following The Paris Agreement and United Nations Sustainable Development Goals (SDGs), a significant number of nations globally have pledged to achieve net‐zero emissions by 2050. The goal is to lower emissions while emphasizing economically and socially sustainable practices.
Rajan Kumar Gangadhari +2 more
wiley +1 more source
Characterizing intermediate tense logics in terms of Galois connections
We propose a uniform way of defining for every logic ${\sf L}$ intermediate between intuitionistic and classical logics, the corresponding intermediate minimal tense logic ${\sf LK_t}$.
Dzik, Wojciech +2 more
core +1 more source
Systematic Mapping of AI‐Based Approaches for Requirements Prioritization
Context and Motivation: Requirements prioritization (RP) is a main concern of requirements engineering (RE). Traditional prioritization techniques, while effective, often involve manual effort and are time‐consuming. In recent years, thanks to the advances in AI‐based techniques and algorithms, several promising alternatives have emerged to optimize ...
María-Isabel Limaylla-Lunarejo +3 more
wiley +1 more source
Stable Formulas in Intuitionistic Logic
In 1995 Visser, van Benthem, de Jongh, and Renardel de Lavalette introduced NNIL-formulas, showing that these are (up to provable equivalence) exactly the formulas preserved under taking submodels of Kripke models. In this article we show that NNIL-formulas are up to frame equivalence the formulas preserved under taking subframes of (descriptive and ...
Bezhanishvili, N., de Jongh, D.
openaire +5 more sources
Geneza intuicjonistycznego rachunku zdań i Twierdzenie Gliwienki
Among the non-classical logics, the intuitionistic one stands out in many ways. First of all, because of its properties, it is grateful subject of formal analysis.
Piotr Urbańczyk
doaj
Focusing and Polarization in Intuitionistic Logic [PDF]
A focused proof system provides a normal form to cut-free proofs that structures the application of invertible and non-invertible inference rules. The focused proof system of Andreoli for linear logic has been applied to both the proof search and the proof normalization approaches to computation.
Liang, Chuck, Miller, Dale
openaire +4 more sources
A Logic for Quantum Register Measurements
We know that quantum logics are the most prominent logical systems associated to the lattices of closed Hilbert subspaces. However, what happen if, following a quantum computing perspective, we want to associate a logic to the process of quantum ...
Andrea Masini, Margherita Zorzi
doaj +1 more source
A Galois connection between classical and intuitionistic logics. I: Syntax
In a 1985 commentary to his collected works, Kolmogorov remarked that his 1932 paper "was written in hope that with time, the logic of solution of problems [i.e., intuitionistic logic] will become a permanent part of a [standard] course of logic.
Melikhov, Sergey A.
core

