34 search results - page 4 / 7 » Substitutions into propositional tautologies |
150
click to vote
CSL
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. For a reasonable sound and complete proof calculus for firstorder logic consider the problem to decide, given a sentence of firstorder logic and a natural number n, whet...
172
click to vote
LOGCOM
1998
15 years 5 months ago
1998
Sound and complete modal propositional logic C is presented, in which 2P has the interpretation “ P is true in all states”. The interpretation is already known as the Carnapia...
163
click to vote
ICLP
2007
Springer
15 years 11 months ago
2007
Springer
aa We consider the problem of obtaining a minimal logic program strongly equivalent (under the stable models semantics) to a given arbitrary propositional theory. We propose a meth...
206
click to vote
AML
2011
15 years 18 days ago
2011
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...
105
click to vote
ENTCS
2007
15 years 5 months ago
2007
We provide a new look at formal aspects of component substitutability (replacement of a component with a new one) and independent implementability (reuse of a component in any sys...