Results 51 to 60 of about 779,559 (291)
Computability of 1-manifolds [PDF]
Logical Methods in Computer Science, 2014 A semi-computable set S in a computable metric space need not be computable. However, in some cases, if S has certain topological properties, we can conclude that S is computable.
Konrad Burnik, Zvonko Iljazovic
doaj +1 more source
The Logic of Time: from Aristotle to Computer Science [PDF]
, 2017 Charla tipo conferencia-seminario dada para alumnos de un másterThis short course will explore that continuous thread which connects the discussion about time in philosophy with the modern use of temporal logic in computer science. It will go through the
Bresolin, Davide
core
Completeness of Flat Coalgebraic Fixpoint Logics
, 2010 Modal fixpoint logics traditionally play a central role in computer science, in particular in artificial intelligence and concurrency. The mu-calculus and its relatives are among the most expressive logics of this type.
Gastin, P. +3 more
core +1 more source
Higher-Order Termination: from Kruskal to Computability [PDF]
, 2006 Termination is a major question in both logic and computer science. In logic, termination is at the heart of proof theory where it is usually called strong normalization (of cut elimination).
C. Borralleras +13 more
core +9 more sources
FEBS Letters, EarlyView.This study reveals how the mitochondrial protein Slm35 is regulated in Saccharomyces cerevisiae. The authors identify stress‐responsive DNA elements and two upstream open reading frames (uORFs) in the 5′ untranslated region of SLM35. One uORF restricts translation, and its mutation increases Slm35 protein levels and mitophagy.
Hernán Romo‐Casanueva +5 more
wiley +1 more source
Unsolvability Cores in Classification Problems [PDF]
Logical Methods in Computer Science, 2014 Classification problems have been introduced by M. Ziegler as a generalization of promise problems. In this paper we are concerned with solvability and unsolvability questions with respect to a given set or language family, especially with cores of ...
Hermann K. -G. Walter, Ulrike Brandt
doaj +1 more source
FEBS Letters, EarlyView.We reconstituted Synechocystis glycogen synthesis in vitro from purified enzymes and showed that two GlgA isoenzymes produce glycogen with different architectures: GlgA1 yields denser, highly branched glycogen, whereas GlgA2 synthesizes longer, less‐branched chains.
Kenric Lee +3 more
wiley +1 more source
Logical Methods in Computer Science, 2013 Almost all representations considered in computable analysis are partial. We provide arguments in favor of total representations (by elements of the Baire space).
Victor Selivanov
doaj +1 more source
Continuous Regular Functions [PDF]
Logical Methods in Computer Science, 2020 Following Chaudhuri, Sankaranarayanan, and Vardi, we say that a function $f:[0,1] \to [0,1]$ is $r$-regular if there is a B\"{u}chi automaton that accepts precisely the set of base $r \in \mathbb{N}$ representations of elements of the graph of $f$.
Alexi Block Gorman +7 more
doaj +1 more source
"Boring formal methods" or "Sherlock Holmes deduction methods"?
, 2016 This paper provides an overview of common challenges in teaching of logic and formal methods to Computer Science and IT students. We discuss our experiences from the course IN3050: Applied Logic in Engineering, introduced as a "logic for everybody ...
BF Sherman +11 more
core +1 more source