Results 111 to 120 of about 696 (191)

Undecidability of Some Substructural Logics

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

The Tsetlin Machine: A "Third Way" in QSAR Modeling. [PDF]

open access: yesJ Chem Inf Model
Clarke PFA   +5 more
europepmc   +1 more source

GLIVENKO THEOREMS FOR SUBSTRUCTURAL LOGICS OVER FL

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

Focus-preserving embeddings of substructural logics in intuitionistic logic. Draft manuscript, available from http://www.cs.cmu.edu/~fp/papers/ substruct10.pdf

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

Naïve validity. [PDF]

open access: yesSynthese, 2021
Murzi J, Rossi L.
europepmc   +1 more source

Home - About - Disclaimer - Privacy