Results 61 to 70 of about 5,071,272 (326)
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
A Fuzzy Grammar for Evaluating Universality and Complexity in Natural Language
Mathematics, 2022 The paper focuses on linguistic complexity and language universals, which are two important and controversial issues in language research. A Fuzzy Property Grammar for determining the degree of universality and complexity of a natural language is ...
Adrià Torrens-Urrutia +3 more
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).
Paul Beame, Trinh Huynh, Toniann Pitassi
openaire +5 more sources
Modelling stem cell differentiation related processes—A practical overview for biologists
FEBS Letters, EarlyView.Stem cell differentiation is complex and difficult to control experimentally. This review introduces suitable computational modelling approaches that can support stem cell research, from mechanistic ODE and abstract models to multiscale and deep learning methods.
Ricco Zeegelaar +4 more
wiley +1 more source
How to Prove Work: With Time or Memory
IEEE Access, 2022 Proposed by Dwork and Naor (Crypto’ 92) as an anti-spam technique, proof-of-work is attracting more attention with the boom of cryptocurrencies. A proof-of-work scheme involves two types of participants, $\textit {i.e.}$ , provers and verifiers ...
Xiangyu Su +2 more
doaj +1 more source
On the Complexity of Finding Narrow Proofs [PDF]
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 2012 Full version of the FOCS 2012 ...
openaire +2 more sources
An epithelial GPR35 isoform supports tumor‐associated transcriptional and metabolic phenotypes
FEBS Letters, EarlyView.GPR35 generates two functionally distinct isoforms with previously unresolved roles. GPR35‐short mediates immune‐cell chemotaxis, while GPR35‐long is enriched in colorectal cancer epithelium, where it supports increased metabolism, proliferation, and tumor‐associated transcriptional programs.
Jørgen D. Rønneberg +14 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
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
Proof complexity of intuitionistic implicational formulas [PDF]
Annals of Pure and Applied Logic, 2015 We study implicational formulas in the context of proof complexity of intuitionistic propositional logic (IPC). On the one hand, we give an efficient transformation of tautologies to implicational tautologies that preserves the lengths of intuitionistic ...
Emil Jeřábek
semanticscholar +1 more source