Zobrazeno 1 - 10
of 264
pro vyhledávání: '"Constable, Robert"'
Autor:
Constable, Robert
The AGC family of protein kinases (related to protein kinases A, G and C) are a functionally and structurally distinct class of eukaryotic kinases that phosphorylate serine/threonine residues within their substrates. AGC kinases are implicated in div
Externí odkaz:
https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.756352
Publikováno v:
In Current Opinion in Behavioral Sciences August 2021 40:27-32
Autor:
Constable, Robert Mark
Much of contemporary Anglo-American radical social criticism, although paying intellectual homage to the work of Karl Marx, is firmly rooted in the modern liberal ideological tradition - corporate liberalism that began to evolve with the development
Externí odkaz:
http://hdl.handle.net/11375/7663
Autor:
Constable, Robert L.
This article presents a computational semantics for classical logic using constructive type theory. Such semantics seems impossible because classical logic allows the Law of Excluded Middle (LEM), not accepted in constructive logic since it does not
Externí odkaz:
http://arxiv.org/abs/1409.0266
Autor:
Constable, Robert, Bickford, Mark
We establish completeness for intuitionistic first-order logic, iFOL, showing that a formula is provable if and only if its embedding into minimal logic, mFOL, is uniformly valid under the Brouwer Heyting Kolmogorov (BHK) semantics, the intended sema
Externí odkaz:
http://arxiv.org/abs/1110.1614
Autor:
Constable, Robert
The Fischer-Lynch-Paterson theorem (FLP) says that it is impossible for processes in an asynchronous distributed system to achieve consensus on a binary value when a single process can fail; it is a widely cited theoretical result about network compu
Externí odkaz:
http://arxiv.org/abs/1109.3370
Publikováno v:
Logical Methods in Computer Science, Volume 7, Issue 2 (May 21, 2011) lmcs:804
To produce a program guaranteed to satisfy a given specification one can synthesize it from a formal constructive proof that a computation satisfying that specification exists. This process is particularly effective if the specifications are written
Externí odkaz:
http://arxiv.org/abs/0906.4315
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Logical Methods in Computer Science, Volume 4, Issue 3 (September 9, 2008) lmcs:1140
Church's Higher Order Logic is a basis for influential proof assistants -- HOL and PVS. Church's logic has a simple set-theoretic semantics, making it trustworthy and extensible. We factor HOL into a constructive core plus axioms of excluded middle a
Externí odkaz:
http://arxiv.org/abs/0806.1281
Publikováno v:
In Science of Computer Programming 15 November 2017 148:26-48