Results 61 to 70 of about 722,619 (215)
Intuitionistic computability logic
Acta Cybern., 2004 Computability logic (CL) is a systematic formal theory of computational tasks and resources, which, in a sense, can be seen as a semantics-based alternative to (the syntactically introduced) linear logic. With its expressive and flexible language, where formulas represent computational problems and "truth" is understood as algorithmic solvability, CL ...
openaire +3 more sources
The Friedman-Sheard programme in intuitionistic logic [PDF]
, 2012 This paper compares the roles classical and intuitionistic logic play in restricting the free use of truth principles in arithmetic. We consider fifteen of the most commonly used axiomatic principles of truth and classify every subset of them as either ...
Rathjen, M +3 more
core +1 more source
From Translations to Non-Collapsing Logic Combinations
Bulletin of the Section of LogicPrawitz suggested expanding a natural deduction system for intuitionistic logic to include rules for classical logic constructors, allowing both intuitionistic and classical elements to coexist without losing their inherent characteristics.
João Rasga, Cristina Sernadas
doaj +1 more source
A Critical Analysis of Optimization Algorithms for Cultural Heritage Conservation and Management
Engineering Reports, Volume 8, Issue 10, October 2026.Methodological framework and decision‐support roadmap for optimization algorithms in cultural heritage conservation and management. ABSTRACT Heritage buildings symbolize cultural identity, architectural character, and historical epitome of communities.
Eslam Mohammed Abdelkader +6 more
wiley +1 more source
The Complexity of Disjunction in Intuitionistic Logic
Journal of Logic and Computation, 2015 AbstractWe study procedures for the derivability problem of fragments of intuitionistic logic. Intuitionistic logic is known to be PSPACE-complete, with implication being one of the main contributors to this complexity. In fact, with just implication alone, we still have a PSPACE-complete logic.
R. Ramanujam 0001 +2 more
openaire +2 more sources
A Distributed Kripke Semantics
, 2004 An intuitionistic, hybrid modal logic suitable for reasoning about distribution of resources was introduced in [10]. We extend the Kripke semantics of intuitionistic logic, enriching each possible Kripke state with a set of places, and show that this ...
Chadha, R., Macedonio, D., Sassone, V.
core +1 more source
Classical Logic and Neutrosophic Logic. Answers to K. Georgiev [PDF]
Neutrosophic Sets and Systems, 2016 In this paper, we make distinctions between Classical Logic (where the propositions are 100% true, or 100 false) and the Neutrosophic Logic (where one deals with partially true, partially indeterminate and partially false propositions) in order to ...
Florentin Smarandache
doaj +1 more source
Engineering Reports, Volume 8, Issue 9, September 2026.Selecting build‐to‐suit telecom contractors is a high‐stakes decision shaped by vague expert judgments. This study develops an interval type‐3 fuzzy Analytic Hierarchy Process whose secondary credibility grade models uncertainty about the judgments themselves.
Leah‐Maria Ndokezi, Haryson Nyobuya
wiley +1 more source
Intuitionistic modal logic made explicit [PDF]
, 2016 Previous intuitionistic justification logics included explicit justifications for all admissible rules of intuitionistic logic in order to get completeness with respect to provability semantics.
Marti, Michel, Studer, Thomas
core
Intuitionistic fuzzy interpretation of a classical propositional logic formula [PDF]
Notes on IFSThe formula ¬A = (A → ((A → A) ∧ ¬(A → A))) is a tautology in the classical propositional logic. In this paper, we determine all intuitionistic fuzzy implications that satisfy this formula together with the classical intuitionistic fuzzy negation or with
Krassimir Atanassov +2 more
doaj +1 more source