Results 61 to 70 of about 785,300 (287)

On Affine Logic and {\L}ukasiewicz Logic [PDF]

open access: yes, 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  

Model pluralism for logic

open access: yesNoûs, EarlyView.
Abstract It is well‐recognized in the sciences that a multitude of nonequivalent models are used by researchers to fulfill a range of goals, even for the same target system, a result known broadly as model pluralism. The possibility of the same form of pluralism occurring in logic, however, has not been adequately considered.
Ben Martin
wiley   +1 more source

The Expressive Power of Modal Dependence Logic [PDF]

open access: yes, 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  

The basic intuitionistic logic of proofs [PDF]

open access: yesJournal of Symbolic Logic, 2007
AbstractThe language of the basic logic of proofs extends the usual propositional language by forming sentences of the sort x is a proof of F for any sentence F. In this paper a complete axiomatization for the basic logic of proofs in Heyting Arithmetic HA was found.
Artemov, Sergei, Iemhoff, Rosalie
openaire   +5 more sources

Kripke's Reduction of Löb's Theorem to the Second Incompleteness Theorem

open access: yesTheoria, 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 Combining Intuitionistic and S4 Modal Logic

open access: yesBulletin of the Section of Logic
We 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

On Natural Deduction for Herbrand Constructive Logics III: The Strange Case of the Intuitionistic Logic of Constant Domains [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2018
The logic of constant domains is intuitionistic logic extended with the so-called forall-shift axiom, a classically valid statement which implies the excluded middle over decidable formulas.
Federico Aschieri
doaj   +1 more source

Pitfalls, benefits, and comparative analysis of artificial intelligence ChatBots in the systematic review process

open access: yesInternational 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

Designing and developing Intuitionistic Fuzzy Logic Toolbox in MATLAB: Membership and non-membership functions gallery [PDF]

open access: yesNotes on IFS
The authors have designed and developed algorithms for pattern recognition and clustering techniques using intuitionistic fuzzy (IF) sets, IF operators, IF logic (IFL) – shortest path in networks using IF graphs and IF hypergraphs – video processing ...
Kaviranjanii G., Parvathi Rangasamy
doaj   +1 more source

Certified undecidability of intuitionistic linear logic via binary stack machines and Minsky machines

open access: yesCertified Programs and Proofs, 2019
We formally prove the undecidability of entailment in intuitionistic linear logic in Coq. We reduce the Post correspondence problem (PCP) via binary stack machines and Minsky machines to intuitionistic linear logic.
Y. Forster, Dominique Larchey-Wendling
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy