Results 41 to 50 of about 19,372 (208)
Decidability of quantified propositional intuitionistic logic and S4 on trees
, 2002 Quantified propositional intuitionistic logic is obtained from propositional intuitionistic logic by adding quantifiers \forall p, \exists p over propositions.
D. Gabbay +9 more
core +1 more source
European Management Review, EarlyView.Abstract This paper aims to encounter the scholarly demand for comprehensive identification and investigation of the factors that highlight the sense of the “workplace of the future.” Besides, this study sheds in‐depth qualitative and quantitative insights into analysing such drivers in international entrepreneurial small and medium enterprises of ...
Hannan Amoozad Mahdiraji +3 more
wiley +1 more source
Classical propositional logic and decidability of variables in intuitionistic propositional logic [PDF]
Logical Methods in Computer Science, 2014 We improve the answer to the question: what set of excluded middles for propositional variables in a formula suffices to prove the formula in intuitionistic propositional logic whenever it is provable in classical propositional logic.
Hajime Ishihara
doaj +1 more source
On Affine Logic and {\L}ukasiewicz Logic [PDF]
, 2014 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 understanding of {\L}
Arthan, Rob, Oliva, Paulo
core
Kripke's Reduction of Löb's Theorem to the Second Incompleteness Theorem
Theoria, EarlyView.ABSTRACT In this paper, we discuss Kripke's reduction of Löb's Principle to the Second Incompleteness Theorem. We have a closer look at the non‐constructive character of the reduction. We reflect on what the argument has to tell us. In the Appendix, We give a strengthening of Löb's Principle suggested by Kripke's reduction.
Albert Visser
wiley +1 more source
On density of truth of the intuitionistic logic in one variable [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 In this paper we focus on the intuitionistic propositional logic with one propositional variable. More precisely we consider the standard fragment $\{ \to ,\vee ,\bot \}$ of this logic and compute the proportion of tautologies among all formulas.
Zofia Kostrzycka
doaj +1 more source
International Transactions in Operational Research, Volume 33, Issue 2, Page 719-774, March 2026.Abstract The transformative potential of artificial intelligence (AI) ChatBots, leveraging natural language processing for information retrieval and knowledge synthesis, has garnered attention across diverse fields, including research. Recognizing AI's importance, researchers and policymakers are actively engaged in its development.
Cinzia Daraio +2 more
wiley +1 more source
On Combining Intuitionistic and S4 Modal Logic
Bulletin of the Section of LogicWe address the problem of combining intuitionistic and S4 modal logic in a non-collapsing way inspired by the recent works in combining intuitionistic and classical logic.
João Rasga, Cristina Sernadas
doaj +1 more source
The Expressive Power of Modal Dependence Logic [PDF]
, 2014 We study the expressive power of various modal logics with team semantics. We show that exactly the properties of teams that are downward closed and closed under team k-bisimulation, for some finite k, are definable in modal logic extended with ...
Hella, Lauri +3 more
core
On Equivalence of Infinitary Formulas under the Stable Model Semantics [PDF]
, 2014 Propositional formulas that are equivalent in intuitionistic logic, or in its extension known as the logic of here-and-there, have the same stable models. We extend this theorem to propositional formulas with infinitely long conjunctions and disjunctions
Harrison, Amelia +2 more
core +1 more source