Undecidability of Some Substructural Logics
This thesis deals with the algorithmic undecidability (unsolvability) of provability in some non-classical logics. In fact, there are two natural variants of this problem.
Chvalovský, Karel
core
StrucGAP: a modular, streamlined and traceable data mining platform for structural and site-specific glycoproteomics. [PDF]
Yang M +9 more
europepmc +1 more source
The Tsetlin Machine: A "Third Way" in QSAR Modeling. [PDF]
Clarke PFA +5 more
europepmc +1 more source
GLIVENKO THEOREMS FOR SUBSTRUCTURAL LOGICS OVER FL
. It is well known that classical propositional logic can be interpreted in intuitionistic propositional logic. In particular Glivenko’s theorem states that a formula is provable in the former iff its double negation is provable in the latter.
Nikolaos Galatos, Hiroakira Ono
core
A comprehensive evaluation of advanced methods for identifying structural alerts using extensive toxicity data. [PDF]
Wang NN +6 more
europepmc +1 more source
SLICE (SMARTS and Logic In ChEmistry): fast generation of molecules using advanced chemical synthesis logic and modern coding style. [PDF]
Ilemo SN +6 more
europepmc +1 more source
We present a method of embedding substructural log-ics into ordinary first-order intuitionistic logic. This em-bedding is faithful in a very strong sense: not only does it preserve provability of sequents under translation, but it also preserves sets of ...
Jason Reed, Frank Pfenning
core
A comprehensive N-glycoproteome atlas reveals tissue-specific glycan remodeling but non-random structural microheterogeneities. [PDF]
Wu Y +9 more
europepmc +1 more source
Advancing Drug-Drug Interaction Prediction with Biomimetic Improvements: Leveraging the Latest Artificial Intelligence Techniques to Guide Researchers in the Field. [PDF]
Marqas RB +4 more
europepmc +1 more source

