Results 51 to 60 of about 1,041,680 (279)
A Syntactic Proof of the Decidability of First-Order Monadic Logic
Bulletin of the Section of LogicDecidability of monadic first-order classical logic was established by Löwenheim in 1915. The proof made use of a semantic argument and a purely syntactic proof has never been provided.
Eugenio Orlandelli, Matteo Tesi
doaj +1 more source
Journal of Medical Internet Research, 2020 BackgroundThe language gap between health consumers and health professionals has been long recognized as the main hindrance to effective health information comprehension.
Yu, Biyang +3 more
doaj +1 more source
Towards a Proof Theory of G\"odel Modal Logics [PDF]
Logical Methods in Computer Science, 2011 Analytic proof calculi are introduced for box and diamond fragments of basic modal fuzzy logics that combine the Kripke semantics of modal logic K with the many-valued semantics of G\"odel logic.
George Metcalfe, Nicola Olivetti
doaj +1 more source
Proofs of Proofs of Work with Sublinear Complexity
, 2016 In the setting of blockchain based transaction ledgers we study the problem of “simplified payment verification” (SPV) which refers to the setting of a transaction verifier that wishes to examine the last k blocks of the blockchain (e.g., for the purpose of verification of a certain transaction) using as only advice the genesis block (or some ...
Kiayias, A., Lamprou, N., Stouka, A.-P.
openaire +2 more sources
Cell surface interactome analysis identifies TSPAN4 as a negative regulator of PD‐L1 in melanoma
Molecular Oncology, EarlyView.Using cell surface proximity biotinylation, we identified tetraspanin TSPAN4 within the PD‐L1 interactome of melanoma cells. TSPAN4 negatively regulates PD‐L1 expression and lateral mobility by limiting its interaction with CMTM6 and promoting PD‐L1 degradation.
Guus A. Franken +7 more
wiley +1 more source
On optimal heuristic randomized semidecision procedures, with application to proof complexity [PDF]
, 2009 The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist.
Hirsch, Edward A., Itsykson, Dmitry
core +7 more sources
Molecular Oncology, EarlyView.Single circulating tumor cells (sCTCs) from high‐grade serous ovarian cancer patients were enriched, imaged, and genomically profiled using WGA and NGS at different time points during treatment. sCTCs revealed enrichment of alterations in Chromosomes 2, 7, and 12 as well as persistent or emerging oncogenic CNAs, supporting sCTC identity.
Carolin Salmon +9 more
wiley +1 more source
A note on irreducible Heegaard diagrams
International Journal of Mathematics and Mathematical Sciences, 2006 We construct a Heegaard diagram of genus three for the real projective 3-space, which has no waves and pairs of complementary handles. The first example was given by Im and Kim but our diagram has smaller complexity.
Alberto Cavicchioli, Fulvia Spaggiari
doaj +1 more source
Proof Compression and NP Versus PSPACE II
Bulletin of the Section of Logic, 2020 We upgrade [3] to a complete proof of the conjecture NP = PSPACE that is known as one of the fundamental open problems in the mathematical theory of computational complexity; this proof is based on [2].
Lew Gordeev, Edward Hermann Haeusler
doaj +1 more source
Hardness amplification in proof complexity
Proceedings of the forty-second ACM symposium on Theory of computing, 2010 We present a general method for converting any family of unsatisfiable CNF formulas that is hard for one of the simplest proof systems, tree resolution, into formulas that require large rank in any proof system that manipulates polynomials or polynomial threshold functions of degree at most k (known as Th(k) proofs).
Beame, Paul +2 more
openaire +3 more sources