4217 search results - page 69 / 844 » Computational indistinguishability logic |
119
click to vote
LOGCOM
2010
14 years 4 months ago
2010
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
AINA
2009
IEEE
15 years 4 months ago
2009
IEEE
—This paper makes two contributions towards the logical modelling of inhibition in metabolic networks. First it exposes the logical inconsistency of an existing state-of-the-art ...
TCS
2011
14 years 4 months ago
2011
We provide new correctness criteria for all fragments (multiplicative, exponential, additive) of linear logic. We use these criteria for proving that deciding the correctness of a...
NMR
2004
Springer
15 years 3 months ago
2004
Springer
In Answer Set Programming it is not possible to deduce any conclusion from an inconsistent program (ie: a program that has no model). The same issue occurs in classical logic wher...
JAPLL
2008
14 years 9 months ago
2008
Simple type theory, also known as higher-order logic, is a natural extension of first-order logic which is simple, elegant, highly expressive, and practical. This paper surveys th...